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/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/list-ext-properties/list-ext_1_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a [2018-01-29 23:43:43,385 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-29 23:43:43,387 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-29 23:43:43,438 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-29 23:43:43,439 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-29 23:43:43,440 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-29 23:43:43,441 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-29 23:43:43,442 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-29 23:43:43,444 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-29 23:43:43,445 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-29 23:43:43,446 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-29 23:43:43,446 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-29 23:43:43,447 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-29 23:43:43,449 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-29 23:43:43,450 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-29 23:43:43,452 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-29 23:43:43,454 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-29 23:43:43,456 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-29 23:43:43,457 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-29 23:43:43,459 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-29 23:43:43,461 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-29 23:43:43,461 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-29 23:43:43,462 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-29 23:43:43,463 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-29 23:43:43,463 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-29 23:43:43,465 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-29 23:43:43,465 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-29 23:43:43,466 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-29 23:43:43,466 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-29 23:43:43,466 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-29 23:43:43,467 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-29 23:43:43,467 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-29 23:43:43,475 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-29 23:43:43,475 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-29 23:43:43,476 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-29 23:43:43,476 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-29 23:43:43,476 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-29 23:43:43,476 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-29 23:43:43,477 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-29 23:43:43,477 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-29 23:43:43,477 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-29 23:43:43,477 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-29 23:43:43,477 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-29 23:43:43,478 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-29 23:43:43,478 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-29 23:43:43,478 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-29 23:43:43,478 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-29 23:43:43,478 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-29 23:43:43,478 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-29 23:43:43,478 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-29 23:43:43,479 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-29 23:43:43,479 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-29 23:43:43,479 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-29 23:43:43,479 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-29 23:43:43,479 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-29 23:43:43,479 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-29 23:43:43,480 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-29 23:43:43,480 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-29 23:43:43,480 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-29 23:43:43,480 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-29 23:43:43,480 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-29 23:43:43,480 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-29 23:43:43,481 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-29 23:43:43,481 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-29 23:43:43,481 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-29 23:43:43,481 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-29 23:43:43,514 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-29 23:43:43,525 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-29 23:43:43,528 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-29 23:43:43,529 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-29 23:43:43,530 INFO L276 PluginConnector]: CDTParser initialized [2018-01-29 23:43:43,530 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/list-ext_1_true-valid-memsafety.i [2018-01-29 23:43:43,687 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-29 23:43:43,691 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-29 23:43:43,692 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-29 23:43:43,692 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-29 23:43:43,696 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-29 23:43:43,697 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 11:43:43" (1/1) ... [2018-01-29 23:43:43,700 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f29a784 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:43:43, skipping insertion in model container [2018-01-29 23:43:43,700 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 11:43:43" (1/1) ... [2018-01-29 23:43:43,713 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 23:43:43,750 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 23:43:43,876 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 23:43:43,898 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 23:43:43,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:43:43 WrapperNode [2018-01-29 23:43:43,908 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-29 23:43:43,908 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-29 23:43:43,909 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-29 23:43:43,909 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-29 23:43:43,923 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:43:43" (1/1) ... [2018-01-29 23:43:43,923 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:43:43" (1/1) ... [2018-01-29 23:43:43,932 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:43:43" (1/1) ... [2018-01-29 23:43:43,933 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:43:43" (1/1) ... [2018-01-29 23:43:43,940 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:43:43" (1/1) ... [2018-01-29 23:43:43,945 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:43:43" (1/1) ... [2018-01-29 23:43:43,947 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:43:43" (1/1) ... [2018-01-29 23:43:43,950 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-29 23:43:43,950 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-29 23:43:43,950 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-29 23:43:43,950 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-29 23:43:43,952 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:43:43" (1/1) ... No working directory specified, using /storage/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-01-29 23:43:44,011 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-29 23:43:44,012 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-29 23:43:44,012 INFO L136 BoogieDeclarations]: Found implementation of procedure exit [2018-01-29 23:43:44,012 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-29 23:43:44,012 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-29 23:43:44,012 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-29 23:43:44,013 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-29 23:43:44,013 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-29 23:43:44,013 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-29 23:43:44,013 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-29 23:43:44,013 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-29 23:43:44,013 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-29 23:43:44,014 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-29 23:43:44,014 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-29 23:43:44,014 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-29 23:43:44,014 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-01-29 23:43:44,014 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-29 23:43:44,014 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-29 23:43:44,014 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-29 23:43:44,500 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-29 23:43:44,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 11:43:44 BoogieIcfgContainer [2018-01-29 23:43:44,501 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-29 23:43:44,502 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-29 23:43:44,502 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-29 23:43:44,505 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-29 23:43:44,505 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 11:43:43" (1/3) ... [2018-01-29 23:43:44,506 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b08e394 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 11:43:44, skipping insertion in model container [2018-01-29 23:43:44,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:43:43" (2/3) ... [2018-01-29 23:43:44,507 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b08e394 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 11:43:44, skipping insertion in model container [2018-01-29 23:43:44,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 11:43:44" (3/3) ... [2018-01-29 23:43:44,508 INFO L107 eAbstractionObserver]: Analyzing ICFG list-ext_1_true-valid-memsafety.i [2018-01-29 23:43:44,515 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-29 23:43:44,521 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 35 error locations. [2018-01-29 23:43:44,562 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-29 23:43:44,562 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-29 23:43:44,562 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-29 23:43:44,562 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-29 23:43:44,562 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-29 23:43:44,562 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-29 23:43:44,562 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-29 23:43:44,563 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-29 23:43:44,563 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-29 23:43:44,582 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2018-01-29 23:43:44,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-29 23:43:44,588 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:43:44,589 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:43:44,589 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:43:44,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1672034257, now seen corresponding path program 1 times [2018-01-29 23:43:44,594 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:43:44,595 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:43:44,637 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:44,638 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:43:44,638 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:44,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:43:44,687 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:43:44,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:43:44,723 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:43:44,723 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-29 23:43:44,725 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-29 23:43:44,735 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-29 23:43:44,736 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-29 23:43:44,738 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 2 states. [2018-01-29 23:43:44,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:43:44,850 INFO L93 Difference]: Finished difference Result 246 states and 269 transitions. [2018-01-29 23:43:44,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-29 23:43:44,851 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-01-29 23:43:44,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:43:44,861 INFO L225 Difference]: With dead ends: 246 [2018-01-29 23:43:44,861 INFO L226 Difference]: Without dead ends: 134 [2018-01-29 23:43:44,866 INFO L553 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-01-29 23:43:44,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-01-29 23:43:44,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-01-29 23:43:44,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-01-29 23:43:44,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 140 transitions. [2018-01-29 23:43:44,906 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 140 transitions. Word has length 16 [2018-01-29 23:43:44,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:43:44,907 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 140 transitions. [2018-01-29 23:43:44,907 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-29 23:43:44,907 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 140 transitions. [2018-01-29 23:43:44,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-29 23:43:44,908 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:43:44,908 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:43:44,908 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:43:44,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1748285025, now seen corresponding path program 1 times [2018-01-29 23:43:44,909 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:43:44,909 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:43:44,910 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:44,910 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:43:44,910 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:44,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:43:44,930 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:43:44,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:43:44,968 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:43:44,969 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 23:43:44,970 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-29 23:43:44,971 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-29 23:43:44,971 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-29 23:43:44,971 INFO L87 Difference]: Start difference. First operand 134 states and 140 transitions. Second operand 3 states. [2018-01-29 23:43:45,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:43:45,001 INFO L93 Difference]: Finished difference Result 256 states and 269 transitions. [2018-01-29 23:43:45,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-29 23:43:45,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-01-29 23:43:45,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:43:45,003 INFO L225 Difference]: With dead ends: 256 [2018-01-29 23:43:45,003 INFO L226 Difference]: Without dead ends: 135 [2018-01-29 23:43:45,004 INFO L553 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-01-29 23:43:45,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-01-29 23:43:45,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-01-29 23:43:45,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-29 23:43:45,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 141 transitions. [2018-01-29 23:43:45,012 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 141 transitions. Word has length 23 [2018-01-29 23:43:45,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:43:45,013 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 141 transitions. [2018-01-29 23:43:45,013 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-29 23:43:45,013 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 141 transitions. [2018-01-29 23:43:45,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-29 23:43:45,014 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:43:45,014 INFO L350 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-01-29 23:43:45,014 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:43:45,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1106730814, now seen corresponding path program 1 times [2018-01-29 23:43:45,014 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:43:45,014 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:43:45,015 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:45,015 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:43:45,015 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:45,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:43:45,032 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:43:45,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:43:45,091 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:43:45,091 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-29 23:43:45,091 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-29 23:43:45,092 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-29 23:43:45,092 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-29 23:43:45,092 INFO L87 Difference]: Start difference. First operand 135 states and 141 transitions. Second operand 5 states. [2018-01-29 23:43:45,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:43:45,325 INFO L93 Difference]: Finished difference Result 194 states and 208 transitions. [2018-01-29 23:43:45,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 23:43:45,325 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-01-29 23:43:45,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:43:45,327 INFO L225 Difference]: With dead ends: 194 [2018-01-29 23:43:45,327 INFO L226 Difference]: Without dead ends: 177 [2018-01-29 23:43:45,328 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-01-29 23:43:45,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-01-29 23:43:45,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 160. [2018-01-29 23:43:45,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-01-29 23:43:45,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 176 transitions. [2018-01-29 23:43:45,338 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 176 transitions. Word has length 25 [2018-01-29 23:43:45,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:43:45,338 INFO L432 AbstractCegarLoop]: Abstraction has 160 states and 176 transitions. [2018-01-29 23:43:45,339 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-29 23:43:45,339 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 176 transitions. [2018-01-29 23:43:45,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-29 23:43:45,340 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:43:45,340 INFO L350 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-01-29 23:43:45,340 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:43:45,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1106730813, now seen corresponding path program 1 times [2018-01-29 23:43:45,341 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:43:45,341 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:43:45,342 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:45,342 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:43:45,342 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:45,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:43:45,358 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:43:45,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:43:45,461 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:43:45,461 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-29 23:43:45,462 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-29 23:43:45,462 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-29 23:43:45,462 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-29 23:43:45,462 INFO L87 Difference]: Start difference. First operand 160 states and 176 transitions. Second operand 5 states. [2018-01-29 23:43:45,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:43:45,730 INFO L93 Difference]: Finished difference Result 227 states and 240 transitions. [2018-01-29 23:43:45,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-29 23:43:45,731 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-01-29 23:43:45,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:43:45,733 INFO L225 Difference]: With dead ends: 227 [2018-01-29 23:43:45,733 INFO L226 Difference]: Without dead ends: 210 [2018-01-29 23:43:45,734 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-29 23:43:45,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-01-29 23:43:45,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 196. [2018-01-29 23:43:45,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-01-29 23:43:45,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 210 transitions. [2018-01-29 23:43:45,750 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 210 transitions. Word has length 25 [2018-01-29 23:43:45,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:43:45,751 INFO L432 AbstractCegarLoop]: Abstraction has 196 states and 210 transitions. [2018-01-29 23:43:45,751 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-29 23:43:45,751 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 210 transitions. [2018-01-29 23:43:45,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-29 23:43:45,752 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:43:45,752 INFO L350 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:43:45,752 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:43:45,753 INFO L82 PathProgramCache]: Analyzing trace with hash -80957540, now seen corresponding path program 1 times [2018-01-29 23:43:45,753 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:43:45,753 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:43:45,754 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:45,754 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:43:45,754 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:45,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:43:45,769 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:43:45,819 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-29 23:43:45,819 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:43:45,819 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-29 23:43:45,820 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-29 23:43:45,820 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-29 23:43:45,820 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-29 23:43:45,820 INFO L87 Difference]: Start difference. First operand 196 states and 210 transitions. Second operand 4 states. [2018-01-29 23:43:45,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:43:45,886 INFO L93 Difference]: Finished difference Result 414 states and 442 transitions. [2018-01-29 23:43:45,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-29 23:43:45,887 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2018-01-29 23:43:45,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:43:45,888 INFO L225 Difference]: With dead ends: 414 [2018-01-29 23:43:45,888 INFO L226 Difference]: Without dead ends: 274 [2018-01-29 23:43:45,889 INFO L553 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-01-29 23:43:45,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-01-29 23:43:45,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 195. [2018-01-29 23:43:45,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-01-29 23:43:45,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 208 transitions. [2018-01-29 23:43:45,901 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 208 transitions. Word has length 42 [2018-01-29 23:43:45,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:43:45,901 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 208 transitions. [2018-01-29 23:43:45,901 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-29 23:43:45,901 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 208 transitions. [2018-01-29 23:43:45,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-29 23:43:45,902 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:43:45,902 INFO L350 BasicCegarLoop]: trace histogram [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] [2018-01-29 23:43:45,902 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:43:45,903 INFO L82 PathProgramCache]: Analyzing trace with hash -2057713468, now seen corresponding path program 1 times [2018-01-29 23:43:45,903 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:43:45,903 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:43:45,903 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:45,904 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:43:45,904 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:45,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:43:45,923 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:43:46,046 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:43:46,046 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:43:46,046 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-29 23:43:46,047 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-29 23:43:46,047 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-29 23:43:46,047 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-29 23:43:46,047 INFO L87 Difference]: Start difference. First operand 195 states and 208 transitions. Second operand 7 states. [2018-01-29 23:43:46,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:43:46,432 INFO L93 Difference]: Finished difference Result 383 states and 409 transitions. [2018-01-29 23:43:46,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-29 23:43:46,433 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2018-01-29 23:43:46,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:43:46,436 INFO L225 Difference]: With dead ends: 383 [2018-01-29 23:43:46,436 INFO L226 Difference]: Without dead ends: 380 [2018-01-29 23:43:46,437 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-01-29 23:43:46,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-01-29 23:43:46,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 209. [2018-01-29 23:43:46,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-01-29 23:43:46,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 226 transitions. [2018-01-29 23:43:46,449 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 226 transitions. Word has length 44 [2018-01-29 23:43:46,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:43:46,450 INFO L432 AbstractCegarLoop]: Abstraction has 209 states and 226 transitions. [2018-01-29 23:43:46,450 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-29 23:43:46,450 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 226 transitions. [2018-01-29 23:43:46,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-29 23:43:46,452 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:43:46,452 INFO L350 BasicCegarLoop]: trace histogram [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] [2018-01-29 23:43:46,452 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:43:46,452 INFO L82 PathProgramCache]: Analyzing trace with hash -2057713467, now seen corresponding path program 1 times [2018-01-29 23:43:46,452 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:43:46,453 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:43:46,453 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:46,453 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:43:46,453 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:46,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:43:46,472 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:43:46,614 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:43:46,615 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:43:46,615 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-29 23:43:46,615 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-29 23:43:46,616 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-29 23:43:46,616 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-29 23:43:46,617 INFO L87 Difference]: Start difference. First operand 209 states and 226 transitions. Second operand 7 states. [2018-01-29 23:43:47,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:43:47,013 INFO L93 Difference]: Finished difference Result 406 states and 434 transitions. [2018-01-29 23:43:47,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-29 23:43:47,013 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2018-01-29 23:43:47,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:43:47,016 INFO L225 Difference]: With dead ends: 406 [2018-01-29 23:43:47,016 INFO L226 Difference]: Without dead ends: 398 [2018-01-29 23:43:47,017 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2018-01-29 23:43:47,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2018-01-29 23:43:47,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 175. [2018-01-29 23:43:47,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-01-29 23:43:47,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 187 transitions. [2018-01-29 23:43:47,029 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 187 transitions. Word has length 44 [2018-01-29 23:43:47,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:43:47,030 INFO L432 AbstractCegarLoop]: Abstraction has 175 states and 187 transitions. [2018-01-29 23:43:47,030 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-29 23:43:47,030 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 187 transitions. [2018-01-29 23:43:47,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-29 23:43:47,032 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:43:47,032 INFO L350 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:43:47,032 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:43:47,032 INFO L82 PathProgramCache]: Analyzing trace with hash -724940903, now seen corresponding path program 1 times [2018-01-29 23:43:47,033 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:43:47,033 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:43:47,034 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:47,034 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:43:47,034 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:47,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:43:47,043 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:43:47,098 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-29 23:43:47,099 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:43:47,099 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-29 23:43:47,099 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-29 23:43:47,099 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-29 23:43:47,099 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-29 23:43:47,100 INFO L87 Difference]: Start difference. First operand 175 states and 187 transitions. Second operand 4 states. [2018-01-29 23:43:47,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:43:47,231 INFO L93 Difference]: Finished difference Result 349 states and 371 transitions. [2018-01-29 23:43:47,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-29 23:43:47,232 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2018-01-29 23:43:47,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:43:47,233 INFO L225 Difference]: With dead ends: 349 [2018-01-29 23:43:47,233 INFO L226 Difference]: Without dead ends: 217 [2018-01-29 23:43:47,234 INFO L553 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-01-29 23:43:47,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-01-29 23:43:47,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 175. [2018-01-29 23:43:47,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-01-29 23:43:47,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 186 transitions. [2018-01-29 23:43:47,242 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 186 transitions. Word has length 44 [2018-01-29 23:43:47,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:43:47,242 INFO L432 AbstractCegarLoop]: Abstraction has 175 states and 186 transitions. [2018-01-29 23:43:47,242 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-29 23:43:47,242 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 186 transitions. [2018-01-29 23:43:47,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-29 23:43:47,243 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:43:47,243 INFO L350 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:43:47,243 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:43:47,244 INFO L82 PathProgramCache]: Analyzing trace with hash 62944726, now seen corresponding path program 1 times [2018-01-29 23:43:47,244 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:43:47,244 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:43:47,245 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:47,245 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:43:47,245 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:47,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:43:47,263 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:43:47,373 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:43:47,373 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:43:47,374 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-29 23:43:47,374 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-29 23:43:47,374 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-29 23:43:47,374 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-01-29 23:43:47,375 INFO L87 Difference]: Start difference. First operand 175 states and 186 transitions. Second operand 7 states. [2018-01-29 23:43:47,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:43:47,567 INFO L93 Difference]: Finished difference Result 365 states and 384 transitions. [2018-01-29 23:43:47,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-29 23:43:47,568 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2018-01-29 23:43:47,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:43:47,570 INFO L225 Difference]: With dead ends: 365 [2018-01-29 23:43:47,570 INFO L226 Difference]: Without dead ends: 296 [2018-01-29 23:43:47,570 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-01-29 23:43:47,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-01-29 23:43:47,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 196. [2018-01-29 23:43:47,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-01-29 23:43:47,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 209 transitions. [2018-01-29 23:43:47,584 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 209 transitions. Word has length 46 [2018-01-29 23:43:47,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:43:47,584 INFO L432 AbstractCegarLoop]: Abstraction has 196 states and 209 transitions. [2018-01-29 23:43:47,584 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-29 23:43:47,585 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 209 transitions. [2018-01-29 23:43:47,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-29 23:43:47,585 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:43:47,586 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:43:47,586 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:43:47,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1585843408, now seen corresponding path program 1 times [2018-01-29 23:43:47,587 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:43:47,587 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:43:47,588 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:47,588 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:43:47,588 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:47,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:43:47,601 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:43:47,673 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:43:47,673 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:43:47,673 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:43:47,686 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:43:47,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:43:47,723 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:43:47,803 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:43:47,831 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:43:47,832 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-01-29 23:43:47,832 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-29 23:43:47,832 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-29 23:43:47,833 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-29 23:43:47,833 INFO L87 Difference]: Start difference. First operand 196 states and 209 transitions. Second operand 8 states. [2018-01-29 23:43:48,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:43:48,015 INFO L93 Difference]: Finished difference Result 375 states and 399 transitions. [2018-01-29 23:43:48,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-29 23:43:48,015 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-01-29 23:43:48,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:43:48,017 INFO L225 Difference]: With dead ends: 375 [2018-01-29 23:43:48,017 INFO L226 Difference]: Without dead ends: 259 [2018-01-29 23:43:48,017 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-01-29 23:43:48,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-01-29 23:43:48,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 201. [2018-01-29 23:43:48,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-01-29 23:43:48,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 214 transitions. [2018-01-29 23:43:48,028 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 214 transitions. Word has length 47 [2018-01-29 23:43:48,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:43:48,028 INFO L432 AbstractCegarLoop]: Abstraction has 201 states and 214 transitions. [2018-01-29 23:43:48,028 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-29 23:43:48,029 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 214 transitions. [2018-01-29 23:43:48,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-29 23:43:48,030 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:43:48,030 INFO L350 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] [2018-01-29 23:43:48,030 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:43:48,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1255869165, now seen corresponding path program 1 times [2018-01-29 23:43:48,030 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:43:48,031 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:43:48,032 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:48,032 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:43:48,032 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:48,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:43:48,048 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:43:48,194 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:43:48,195 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:43:48,195 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-29 23:43:48,195 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-29 23:43:48,195 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-29 23:43:48,195 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-29 23:43:48,195 INFO L87 Difference]: Start difference. First operand 201 states and 214 transitions. Second operand 7 states. [2018-01-29 23:43:48,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:43:48,490 INFO L93 Difference]: Finished difference Result 290 states and 308 transitions. [2018-01-29 23:43:48,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-29 23:43:48,490 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 49 [2018-01-29 23:43:48,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:43:48,492 INFO L225 Difference]: With dead ends: 290 [2018-01-29 23:43:48,492 INFO L226 Difference]: Without dead ends: 285 [2018-01-29 23:43:48,493 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-01-29 23:43:48,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-01-29 23:43:48,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 195. [2018-01-29 23:43:48,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-01-29 23:43:48,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 208 transitions. [2018-01-29 23:43:48,504 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 208 transitions. Word has length 49 [2018-01-29 23:43:48,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:43:48,505 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 208 transitions. [2018-01-29 23:43:48,505 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-29 23:43:48,505 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 208 transitions. [2018-01-29 23:43:48,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-29 23:43:48,506 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:43:48,506 INFO L350 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] [2018-01-29 23:43:48,506 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:43:48,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1255869164, now seen corresponding path program 1 times [2018-01-29 23:43:48,506 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:43:48,507 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:43:48,507 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:48,507 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:43:48,508 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:48,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:43:48,519 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:43:48,590 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:43:48,590 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:43:48,590 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-29 23:43:48,590 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-29 23:43:48,591 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-29 23:43:48,591 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-29 23:43:48,591 INFO L87 Difference]: Start difference. First operand 195 states and 208 transitions. Second operand 7 states. [2018-01-29 23:43:49,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:43:49,023 INFO L93 Difference]: Finished difference Result 265 states and 282 transitions. [2018-01-29 23:43:49,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-29 23:43:49,023 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 49 [2018-01-29 23:43:49,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:43:49,024 INFO L225 Difference]: With dead ends: 265 [2018-01-29 23:43:49,025 INFO L226 Difference]: Without dead ends: 263 [2018-01-29 23:43:49,025 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-01-29 23:43:49,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-01-29 23:43:49,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 190. [2018-01-29 23:43:49,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-01-29 23:43:49,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 203 transitions. [2018-01-29 23:43:49,032 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 203 transitions. Word has length 49 [2018-01-29 23:43:49,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:43:49,032 INFO L432 AbstractCegarLoop]: Abstraction has 190 states and 203 transitions. [2018-01-29 23:43:49,032 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-29 23:43:49,033 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 203 transitions. [2018-01-29 23:43:49,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-29 23:43:49,033 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:43:49,033 INFO L350 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-29 23:43:49,033 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:43:49,033 INFO L82 PathProgramCache]: Analyzing trace with hash -755082119, now seen corresponding path program 1 times [2018-01-29 23:43:49,033 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:43:49,034 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:43:49,034 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:49,034 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:43:49,035 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:49,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:43:49,044 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:43:49,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:43:49,211 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:43:49,211 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-29 23:43:49,212 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-29 23:43:49,212 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-29 23:43:49,212 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-01-29 23:43:49,212 INFO L87 Difference]: Start difference. First operand 190 states and 203 transitions. Second operand 7 states. [2018-01-29 23:43:49,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:43:49,396 INFO L93 Difference]: Finished difference Result 318 states and 333 transitions. [2018-01-29 23:43:49,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-29 23:43:49,396 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2018-01-29 23:43:49,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:43:49,397 INFO L225 Difference]: With dead ends: 318 [2018-01-29 23:43:49,397 INFO L226 Difference]: Without dead ends: 265 [2018-01-29 23:43:49,398 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-01-29 23:43:49,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-01-29 23:43:49,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 194. [2018-01-29 23:43:49,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-01-29 23:43:49,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 207 transitions. [2018-01-29 23:43:49,405 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 207 transitions. Word has length 50 [2018-01-29 23:43:49,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:43:49,405 INFO L432 AbstractCegarLoop]: Abstraction has 194 states and 207 transitions. [2018-01-29 23:43:49,405 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-29 23:43:49,405 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 207 transitions. [2018-01-29 23:43:49,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-01-29 23:43:49,405 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:43:49,406 INFO L350 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, 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-01-29 23:43:49,406 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:43:49,406 INFO L82 PathProgramCache]: Analyzing trace with hash -138049933, now seen corresponding path program 1 times [2018-01-29 23:43:49,406 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:43:49,406 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:43:49,407 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:49,407 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:43:49,407 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:49,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:43:49,420 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:43:49,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:43:49,649 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:43:49,649 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-29 23:43:49,649 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 23:43:49,650 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 23:43:49,650 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-29 23:43:49,650 INFO L87 Difference]: Start difference. First operand 194 states and 207 transitions. Second operand 6 states. [2018-01-29 23:43:50,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:43:50,111 INFO L93 Difference]: Finished difference Result 242 states and 256 transitions. [2018-01-29 23:43:50,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-29 23:43:50,112 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-01-29 23:43:50,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:43:50,113 INFO L225 Difference]: With dead ends: 242 [2018-01-29 23:43:50,113 INFO L226 Difference]: Without dead ends: 237 [2018-01-29 23:43:50,114 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-01-29 23:43:50,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-01-29 23:43:50,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 202. [2018-01-29 23:43:50,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-01-29 23:43:50,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 215 transitions. [2018-01-29 23:43:50,130 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 215 transitions. Word has length 53 [2018-01-29 23:43:50,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:43:50,130 INFO L432 AbstractCegarLoop]: Abstraction has 202 states and 215 transitions. [2018-01-29 23:43:50,130 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 23:43:50,130 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 215 transitions. [2018-01-29 23:43:50,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-01-29 23:43:50,131 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:43:50,131 INFO L350 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-29 23:43:50,131 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:43:50,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1488692396, now seen corresponding path program 1 times [2018-01-29 23:43:50,132 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:43:50,132 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:43:50,133 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:50,133 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:43:50,133 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:50,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:43:50,147 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:43:50,347 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:43:50,348 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:43:50,348 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-29 23:43:50,348 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-29 23:43:50,348 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-29 23:43:50,348 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-29 23:43:50,349 INFO L87 Difference]: Start difference. First operand 202 states and 215 transitions. Second operand 8 states. [2018-01-29 23:43:50,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:43:50,560 INFO L93 Difference]: Finished difference Result 259 states and 271 transitions. [2018-01-29 23:43:50,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-29 23:43:50,560 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2018-01-29 23:43:50,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:43:50,561 INFO L225 Difference]: With dead ends: 259 [2018-01-29 23:43:50,561 INFO L226 Difference]: Without dead ends: 213 [2018-01-29 23:43:50,562 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-01-29 23:43:50,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-01-29 23:43:50,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 180. [2018-01-29 23:43:50,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-01-29 23:43:50,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 192 transitions. [2018-01-29 23:43:50,569 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 192 transitions. Word has length 57 [2018-01-29 23:43:50,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:43:50,569 INFO L432 AbstractCegarLoop]: Abstraction has 180 states and 192 transitions. [2018-01-29 23:43:50,569 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-29 23:43:50,569 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 192 transitions. [2018-01-29 23:43:50,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-01-29 23:43:50,570 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:43:50,570 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:43:50,570 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:43:50,570 INFO L82 PathProgramCache]: Analyzing trace with hash -520458793, now seen corresponding path program 1 times [2018-01-29 23:43:50,570 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:43:50,570 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:43:50,571 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:50,571 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:43:50,571 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:50,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:43:50,581 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:43:50,712 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-29 23:43:50,712 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:43:50,712 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:43:50,741 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:43:50,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:43:50,776 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:43:50,795 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-29 23:43:50,815 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:43:50,815 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-01-29 23:43:50,816 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-29 23:43:50,816 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-29 23:43:50,816 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-29 23:43:50,816 INFO L87 Difference]: Start difference. First operand 180 states and 192 transitions. Second operand 8 states. [2018-01-29 23:43:50,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:43:50,969 INFO L93 Difference]: Finished difference Result 473 states and 503 transitions. [2018-01-29 23:43:50,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-29 23:43:50,970 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2018-01-29 23:43:50,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:43:50,971 INFO L225 Difference]: With dead ends: 473 [2018-01-29 23:43:50,971 INFO L226 Difference]: Without dead ends: 339 [2018-01-29 23:43:50,972 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-01-29 23:43:50,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-01-29 23:43:50,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 196. [2018-01-29 23:43:50,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-01-29 23:43:50,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 208 transitions. [2018-01-29 23:43:50,979 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 208 transitions. Word has length 63 [2018-01-29 23:43:50,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:43:50,979 INFO L432 AbstractCegarLoop]: Abstraction has 196 states and 208 transitions. [2018-01-29 23:43:50,979 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-29 23:43:50,979 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 208 transitions. [2018-01-29 23:43:50,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-01-29 23:43:50,980 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:43:50,980 INFO L350 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, 1, 1, 1, 1, 1, 1] [2018-01-29 23:43:50,980 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:43:50,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1690057964, now seen corresponding path program 1 times [2018-01-29 23:43:50,980 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:43:50,980 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:43:50,981 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:50,981 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:43:50,981 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:50,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:43:50,994 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:43:51,202 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:43:51,203 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:43:51,203 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:43:51,208 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:43:51,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:43:51,233 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:43:51,253 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-01-29 23:43:51,255 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:43:51,258 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:51,258 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 23:43:51,322 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:43:51,325 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:43:51,329 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-01-29 23:43:51,329 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:43:51,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:51,375 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-01-29 23:43:51,424 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-01-29 23:43:51,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, 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-01-29 23:43:51,426 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:43:51,428 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:51,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:51,461 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:36 [2018-01-29 23:43:51,544 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:43:51,547 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 40 treesize of output 41 [2018-01-29 23:43:51,549 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 1 [2018-01-29 23:43:51,549 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:43:51,554 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:51,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:51,560 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:48, output treesize:33 [2018-01-29 23:43:51,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2018-01-29 23:43:51,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-29 23:43:51,573 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:43:51,579 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:51,587 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-01-29 23:43:51,588 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-01-29 23:43:51,729 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 40 treesize of output 33 [2018-01-29 23:43:51,732 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-01-29 23:43:51,732 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:43:51,738 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:43:51,739 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 21 treesize of output 15 [2018-01-29 23:43:51,740 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-29 23:43:51,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:51,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:43:51,755 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:51, output treesize:15 [2018-01-29 23:43:51,817 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:43:51,837 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:43:51,837 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 27 [2018-01-29 23:43:51,837 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-29 23:43:51,837 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-29 23:43:51,838 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=645, Unknown=0, NotChecked=0, Total=756 [2018-01-29 23:43:51,838 INFO L87 Difference]: Start difference. First operand 196 states and 208 transitions. Second operand 28 states. [2018-01-29 23:43:52,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:43:52,994 INFO L93 Difference]: Finished difference Result 394 states and 416 transitions. [2018-01-29 23:43:52,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-01-29 23:43:52,995 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 65 [2018-01-29 23:43:52,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:43:52,996 INFO L225 Difference]: With dead ends: 394 [2018-01-29 23:43:52,996 INFO L226 Difference]: Without dead ends: 393 [2018-01-29 23:43:52,997 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 521 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=451, Invalid=1901, Unknown=0, NotChecked=0, Total=2352 [2018-01-29 23:43:52,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2018-01-29 23:43:53,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 226. [2018-01-29 23:43:53,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-01-29 23:43:53,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 242 transitions. [2018-01-29 23:43:53,009 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 242 transitions. Word has length 65 [2018-01-29 23:43:53,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:43:53,009 INFO L432 AbstractCegarLoop]: Abstraction has 226 states and 242 transitions. [2018-01-29 23:43:53,010 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-29 23:43:53,010 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 242 transitions. [2018-01-29 23:43:53,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-01-29 23:43:53,010 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:43:53,011 INFO L350 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, 1, 1, 1, 1, 1, 1] [2018-01-29 23:43:53,011 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:43:53,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1690057963, now seen corresponding path program 1 times [2018-01-29 23:43:53,011 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:43:53,011 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:43:53,012 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:53,012 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:43:53,012 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:53,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:43:53,028 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:43:53,352 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:43:53,352 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:43:53,352 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:43:53,358 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:43:53,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:43:53,386 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:43:53,395 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-01-29 23:43:53,395 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:43:53,418 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:53,419 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 23:43:53,539 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-01-29 23:43:53,540 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:43:53,550 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:43:53,551 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:43:53,552 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-01-29 23:43:53,552 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:43:53,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:53,559 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-01-29 23:43:53,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-01-29 23:43:53,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, 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-01-29 23:43:53,579 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:43:53,581 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:53,612 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-01-29 23:43:53,615 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-01-29 23:43:53,616 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:43:53,623 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:53,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:53,632 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:40 [2018-01-29 23:43:53,694 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:43:53,698 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 40 treesize of output 41 [2018-01-29 23:43:53,700 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 1 [2018-01-29 23:43:53,700 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:43:53,706 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:53,719 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:43:53,722 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 23 treesize of output 28 [2018-01-29 23:43:53,724 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-01-29 23:43:53,725 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:43:53,729 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:53,737 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:53,737 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:65, output treesize:35 [2018-01-29 23:43:53,746 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 60 treesize of output 56 [2018-01-29 23:43:53,749 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-01-29 23:43:53,749 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:43:53,775 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:53,804 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 29 treesize of output 30 [2018-01-29 23:43:53,809 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-01-29 23:43:53,810 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:43:53,815 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:53,823 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-01-29 23:43:53,823 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:70, output treesize:54 [2018-01-29 23:43:53,922 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 53 treesize of output 44 [2018-01-29 23:43:53,926 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-01-29 23:43:53,926 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:43:53,947 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:43:53,948 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 24 [2018-01-29 23:43:53,949 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-29 23:43:53,953 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:53,963 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-01-29 23:43:53,965 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:43:53,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-01-29 23:43:53,965 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-29 23:43:53,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 7 treesize of output 1 [2018-01-29 23:43:53,970 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-29 23:43:53,971 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:53,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:53,977 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:75, output treesize:9 [2018-01-29 23:43:54,010 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:43:54,030 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:43:54,031 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 22 [2018-01-29 23:43:54,031 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-29 23:43:54,031 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-29 23:43:54,031 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2018-01-29 23:43:54,032 INFO L87 Difference]: Start difference. First operand 226 states and 242 transitions. Second operand 23 states. [2018-01-29 23:43:55,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:43:55,187 INFO L93 Difference]: Finished difference Result 421 states and 446 transitions. [2018-01-29 23:43:55,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-29 23:43:55,187 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 65 [2018-01-29 23:43:55,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:43:55,189 INFO L225 Difference]: With dead ends: 421 [2018-01-29 23:43:55,189 INFO L226 Difference]: Without dead ends: 416 [2018-01-29 23:43:55,189 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 51 SyntacticMatches, 6 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=295, Invalid=1345, Unknown=0, NotChecked=0, Total=1640 [2018-01-29 23:43:55,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2018-01-29 23:43:55,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 224. [2018-01-29 23:43:55,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-01-29 23:43:55,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 239 transitions. [2018-01-29 23:43:55,200 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 239 transitions. Word has length 65 [2018-01-29 23:43:55,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:43:55,200 INFO L432 AbstractCegarLoop]: Abstraction has 224 states and 239 transitions. [2018-01-29 23:43:55,200 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-29 23:43:55,200 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 239 transitions. [2018-01-29 23:43:55,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-01-29 23:43:55,201 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:43:55,201 INFO L350 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, 1, 1, 1, 1, 1, 1] [2018-01-29 23:43:55,201 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:43:55,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1393073208, now seen corresponding path program 1 times [2018-01-29 23:43:55,201 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:43:55,201 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:43:55,202 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:55,202 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:43:55,202 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:55,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:43:55,218 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:43:55,451 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:43:55,451 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:43:55,451 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:43:55,457 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:43:55,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:43:55,484 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:43:55,487 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-01-29 23:43:55,487 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:43:55,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:55,492 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 23:43:55,538 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-01-29 23:43:55,545 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-01-29 23:43:55,546 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:43:55,554 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:55,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:55,574 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-01-29 23:43:55,597 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:43:55,598 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:43:55,598 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-01-29 23:43:55,598 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:43:55,605 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:55,605 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:24 [2018-01-29 23:43:55,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2018-01-29 23:43:55,663 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:43:55,665 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 22 treesize of output 29 [2018-01-29 23:43:55,665 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:43:55,669 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:55,680 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-01-29 23:43:55,682 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-01-29 23:43:55,683 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:43:55,684 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:55,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:55,693 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:56, output treesize:30 [2018-01-29 23:43:55,731 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-01-29 23:43:55,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-01-29 23:43:55,733 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:43:55,734 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:55,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:55,740 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:18 [2018-01-29 23:43:55,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-01-29 23:43:55,780 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-01-29 23:43:55,781 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:43:55,788 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:55,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:55,794 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-01-29 23:43:55,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-01-29 23:43:55,822 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:43:55,824 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 22 treesize of output 14 [2018-01-29 23:43:55,824 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:43:55,829 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:55,835 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-01-29 23:43:55,836 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:25 [2018-01-29 23:43:55,886 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 22 treesize of output 20 [2018-01-29 23:43:55,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-29 23:43:55,888 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:43:55,893 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-01-29 23:43:55,893 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-29 23:43:55,894 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:55,898 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:55,898 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2018-01-29 23:43:55,907 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:43:55,927 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:43:55,927 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 24 [2018-01-29 23:43:55,927 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-29 23:43:55,927 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-29 23:43:55,928 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2018-01-29 23:43:55,928 INFO L87 Difference]: Start difference. First operand 224 states and 239 transitions. Second operand 24 states. [2018-01-29 23:43:56,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:43:56,860 INFO L93 Difference]: Finished difference Result 449 states and 475 transitions. [2018-01-29 23:43:56,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-29 23:43:56,860 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 65 [2018-01-29 23:43:56,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:43:56,862 INFO L225 Difference]: With dead ends: 449 [2018-01-29 23:43:56,862 INFO L226 Difference]: Without dead ends: 380 [2018-01-29 23:43:56,863 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=343, Invalid=1463, Unknown=0, NotChecked=0, Total=1806 [2018-01-29 23:43:56,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-01-29 23:43:56,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 253. [2018-01-29 23:43:56,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-01-29 23:43:56,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 269 transitions. [2018-01-29 23:43:56,879 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 269 transitions. Word has length 65 [2018-01-29 23:43:56,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:43:56,879 INFO L432 AbstractCegarLoop]: Abstraction has 253 states and 269 transitions. [2018-01-29 23:43:56,879 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-29 23:43:56,879 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 269 transitions. [2018-01-29 23:43:56,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-29 23:43:56,880 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:43:56,880 INFO L350 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:43:56,881 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:43:56,881 INFO L82 PathProgramCache]: Analyzing trace with hash 830266039, now seen corresponding path program 1 times [2018-01-29 23:43:56,881 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:43:56,881 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:43:56,882 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:56,882 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:43:56,882 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:56,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:43:56,897 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:43:57,113 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-29 23:43:57,113 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:43:57,113 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:43:57,118 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:43:57,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:43:57,140 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:43:57,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 6 treesize of output 5 [2018-01-29 23:43:57,143 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:43:57,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:57,146 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 23:43:57,197 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-01-29 23:43:57,200 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-01-29 23:43:57,200 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:43:57,202 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:57,210 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:57,210 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-01-29 23:43:57,234 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:43:57,235 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:43:57,235 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-01-29 23:43:57,236 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:43:57,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:57,242 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:24 [2018-01-29 23:43:57,279 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-01-29 23:43:57,281 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-01-29 23:43:57,281 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:43:57,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:57,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2018-01-29 23:43:57,298 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:43:57,299 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 22 treesize of output 29 [2018-01-29 23:43:57,299 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:43:57,302 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:57,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:57,310 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:56, output treesize:30 [2018-01-29 23:43:57,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-01-29 23:43:57,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-01-29 23:43:57,333 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:43:57,334 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:57,338 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:57,338 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:18 [2018-01-29 23:43:57,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-01-29 23:43:57,377 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-01-29 23:43:57,377 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:43:57,380 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:57,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:57,386 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-01-29 23:43:57,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-01-29 23:43:57,414 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:43:57,418 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 22 treesize of output 14 [2018-01-29 23:43:57,418 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:43:57,423 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:57,430 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-01-29 23:43:57,430 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:25 [2018-01-29 23:43:57,522 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-29 23:43:57,543 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:43:57,543 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 27 [2018-01-29 23:43:57,543 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-29 23:43:57,544 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-29 23:43:57,544 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=604, Unknown=0, NotChecked=0, Total=702 [2018-01-29 23:43:57,544 INFO L87 Difference]: Start difference. First operand 253 states and 269 transitions. Second operand 27 states. [2018-01-29 23:43:58,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:43:58,642 INFO L93 Difference]: Finished difference Result 476 states and 504 transitions. [2018-01-29 23:43:58,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-29 23:43:58,642 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 69 [2018-01-29 23:43:58,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:43:58,643 INFO L225 Difference]: With dead ends: 476 [2018-01-29 23:43:58,644 INFO L226 Difference]: Without dead ends: 417 [2018-01-29 23:43:58,644 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=424, Invalid=1928, Unknown=0, NotChecked=0, Total=2352 [2018-01-29 23:43:58,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2018-01-29 23:43:58,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 253. [2018-01-29 23:43:58,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-01-29 23:43:58,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 268 transitions. [2018-01-29 23:43:58,654 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 268 transitions. Word has length 69 [2018-01-29 23:43:58,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:43:58,654 INFO L432 AbstractCegarLoop]: Abstraction has 253 states and 268 transitions. [2018-01-29 23:43:58,654 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-29 23:43:58,654 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 268 transitions. [2018-01-29 23:43:58,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-29 23:43:58,655 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:43:58,655 INFO L350 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:43:58,655 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:43:58,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1529381339, now seen corresponding path program 1 times [2018-01-29 23:43:58,655 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:43:58,655 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:43:58,656 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:58,656 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:43:58,656 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:43:58,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:43:58,666 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:43:59,315 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:43:59,315 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:43:59,316 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:43:59,323 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:43:59,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:43:59,347 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:43:59,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 6 treesize of output 5 [2018-01-29 23:43:59,351 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:43:59,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:59,354 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 23:43:59,413 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:43:59,414 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:43:59,415 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-01-29 23:43:59,415 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:43:59,425 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:59,425 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-01-29 23:43:59,474 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-01-29 23:43:59,476 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-01-29 23:43:59,477 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:43:59,479 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:59,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-01-29 23:43:59,503 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:36 [2018-01-29 23:43:59,590 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:43:59,593 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 40 treesize of output 41 [2018-01-29 23:43:59,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-01-29 23:43:59,597 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:43:59,603 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:59,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:59,611 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:48, output treesize:33 [2018-01-29 23:43:59,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2018-01-29 23:43:59,620 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-01-29 23:43:59,621 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:43:59,625 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:59,631 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-01-29 23:43:59,631 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-01-29 23:43:59,739 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 40 treesize of output 33 [2018-01-29 23:43:59,741 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-01-29 23:43:59,741 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:43:59,777 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:43:59,778 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 21 treesize of output 15 [2018-01-29 23:43:59,778 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-29 23:43:59,807 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:43:59,839 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:43:59,839 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:51, output treesize:15 [2018-01-29 23:44:00,057 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:44:00,078 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:44:00,078 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2018-01-29 23:44:00,078 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-29 23:44:00,079 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-29 23:44:00,079 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=686, Unknown=0, NotChecked=0, Total=812 [2018-01-29 23:44:00,079 INFO L87 Difference]: Start difference. First operand 253 states and 268 transitions. Second operand 29 states. [2018-01-29 23:44:01,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:44:01,159 INFO L93 Difference]: Finished difference Result 378 states and 398 transitions. [2018-01-29 23:44:01,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-01-29 23:44:01,159 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 69 [2018-01-29 23:44:01,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:44:01,161 INFO L225 Difference]: With dead ends: 378 [2018-01-29 23:44:01,161 INFO L226 Difference]: Without dead ends: 377 [2018-01-29 23:44:01,161 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 889 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=595, Invalid=2485, Unknown=0, NotChecked=0, Total=3080 [2018-01-29 23:44:01,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2018-01-29 23:44:01,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 264. [2018-01-29 23:44:01,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-01-29 23:44:01,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 280 transitions. [2018-01-29 23:44:01,170 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 280 transitions. Word has length 69 [2018-01-29 23:44:01,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:44:01,171 INFO L432 AbstractCegarLoop]: Abstraction has 264 states and 280 transitions. [2018-01-29 23:44:01,171 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-29 23:44:01,171 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 280 transitions. [2018-01-29 23:44:01,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-29 23:44:01,171 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:44:01,172 INFO L350 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:44:01,172 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:44:01,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1529381340, now seen corresponding path program 1 times [2018-01-29 23:44:01,172 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:44:01,172 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:44:01,173 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:44:01,173 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:44:01,173 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:44:01,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:44:01,185 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:44:01,601 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:44:01,601 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:44:01,601 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:44:01,606 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:44:01,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:44:01,627 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:44:01,630 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-01-29 23:44:01,630 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:01,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:01,633 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 23:44:01,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 23:44:01,674 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:01,683 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:01,684 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:01,684 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-01-29 23:44:01,685 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:01,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:01,692 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-01-29 23:44:01,720 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-01-29 23:44:01,723 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-01-29 23:44:01,723 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:01,725 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:01,736 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-01-29 23:44:01,738 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-01-29 23:44:01,738 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:01,740 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:01,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:01,748 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:40 [2018-01-29 23:44:01,811 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:01,816 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 23 treesize of output 28 [2018-01-29 23:44:01,820 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-01-29 23:44:01,820 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:01,825 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:01,841 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:01,845 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 40 treesize of output 41 [2018-01-29 23:44:01,848 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 1 [2018-01-29 23:44:01,848 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:01,855 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:01,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:01,864 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:65, output treesize:35 [2018-01-29 23:44:01,873 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 60 treesize of output 56 [2018-01-29 23:44:01,876 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-01-29 23:44:01,877 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:01,889 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:01,918 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 29 treesize of output 30 [2018-01-29 23:44:01,919 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-01-29 23:44:01,920 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:01,924 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:01,931 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-01-29 23:44:01,932 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:70, output treesize:54 [2018-01-29 23:44:02,028 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 53 treesize of output 44 [2018-01-29 23:44:02,030 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-01-29 23:44:02,030 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:02,038 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:44:02,039 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 24 [2018-01-29 23:44:02,039 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:02,044 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:02,055 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-01-29 23:44:02,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-01-29 23:44:02,057 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:02,061 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:44:02,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-01-29 23:44:02,062 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:02,064 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:02,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:02,070 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:75, output treesize:9 [2018-01-29 23:44:02,100 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:44:02,121 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:44:02,121 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 23 [2018-01-29 23:44:02,121 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-29 23:44:02,122 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-29 23:44:02,122 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=475, Unknown=0, NotChecked=0, Total=552 [2018-01-29 23:44:02,122 INFO L87 Difference]: Start difference. First operand 264 states and 280 transitions. Second operand 24 states. [2018-01-29 23:44:03,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:44:03,321 INFO L93 Difference]: Finished difference Result 394 states and 415 transitions. [2018-01-29 23:44:03,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-29 23:44:03,322 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 69 [2018-01-29 23:44:03,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:44:03,323 INFO L225 Difference]: With dead ends: 394 [2018-01-29 23:44:03,323 INFO L226 Difference]: Without dead ends: 391 [2018-01-29 23:44:03,324 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 55 SyntacticMatches, 6 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 536 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=394, Invalid=1676, Unknown=0, NotChecked=0, Total=2070 [2018-01-29 23:44:03,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2018-01-29 23:44:03,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 264. [2018-01-29 23:44:03,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-01-29 23:44:03,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 280 transitions. [2018-01-29 23:44:03,338 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 280 transitions. Word has length 69 [2018-01-29 23:44:03,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:44:03,338 INFO L432 AbstractCegarLoop]: Abstraction has 264 states and 280 transitions. [2018-01-29 23:44:03,339 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-29 23:44:03,339 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 280 transitions. [2018-01-29 23:44:03,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-01-29 23:44:03,339 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:44:03,340 INFO L350 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:44:03,340 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:44:03,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1738945071, now seen corresponding path program 1 times [2018-01-29 23:44:03,340 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:44:03,340 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:44:03,341 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:44:03,341 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:44:03,341 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:44:03,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:44:03,353 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:44:03,525 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:44:03,525 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:44:03,525 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:44:03,530 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:44:03,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:44:03,552 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:44:03,554 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-01-29 23:44:03,555 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:03,557 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:03,557 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 23:44:03,591 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-01-29 23:44:03,593 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-01-29 23:44:03,593 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:03,594 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:03,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:03,600 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-01-29 23:44:03,620 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:03,621 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:03,622 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-01-29 23:44:03,622 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:03,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:03,635 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:24 [2018-01-29 23:44:03,673 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-01-29 23:44:03,705 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-01-29 23:44:03,705 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:03,707 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:03,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2018-01-29 23:44:03,722 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:03,723 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 22 treesize of output 29 [2018-01-29 23:44:03,723 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:03,727 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:03,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:03,737 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:56, output treesize:30 [2018-01-29 23:44:03,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-01-29 23:44:03,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-01-29 23:44:03,758 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:03,759 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:03,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:03,763 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:18 [2018-01-29 23:44:03,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-01-29 23:44:03,801 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-01-29 23:44:03,801 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:03,807 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:03,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:03,812 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-01-29 23:44:03,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-01-29 23:44:03,835 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:03,836 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 22 treesize of output 14 [2018-01-29 23:44:03,836 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:03,840 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:03,845 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-01-29 23:44:03,845 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:25 [2018-01-29 23:44:03,892 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 22 treesize of output 20 [2018-01-29 23:44:03,894 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-01-29 23:44:03,894 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:03,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-29 23:44:03,898 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:03,899 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:03,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:03,903 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2018-01-29 23:44:03,926 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:44:03,946 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:44:03,946 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 25 [2018-01-29 23:44:03,946 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-29 23:44:03,946 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-29 23:44:03,947 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2018-01-29 23:44:03,947 INFO L87 Difference]: Start difference. First operand 264 states and 280 transitions. Second operand 25 states. [2018-01-29 23:44:04,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:44:04,643 INFO L93 Difference]: Finished difference Result 420 states and 442 transitions. [2018-01-29 23:44:04,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-01-29 23:44:04,643 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 72 [2018-01-29 23:44:04,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:44:04,644 INFO L225 Difference]: With dead ends: 420 [2018-01-29 23:44:04,644 INFO L226 Difference]: Without dead ends: 386 [2018-01-29 23:44:04,645 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=375, Invalid=1787, Unknown=0, NotChecked=0, Total=2162 [2018-01-29 23:44:04,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-01-29 23:44:04,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 264. [2018-01-29 23:44:04,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-01-29 23:44:04,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 279 transitions. [2018-01-29 23:44:04,654 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 279 transitions. Word has length 72 [2018-01-29 23:44:04,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:44:04,654 INFO L432 AbstractCegarLoop]: Abstraction has 264 states and 279 transitions. [2018-01-29 23:44:04,654 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-29 23:44:04,654 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 279 transitions. [2018-01-29 23:44:04,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-01-29 23:44:04,655 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:44:04,655 INFO L350 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:44:04,655 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:44:04,655 INFO L82 PathProgramCache]: Analyzing trace with hash 389509082, now seen corresponding path program 2 times [2018-01-29 23:44:04,655 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:44:04,655 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:44:04,656 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:44:04,656 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:44:04,656 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:44:04,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:44:04,666 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:44:05,003 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:44:05,003 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:44:05,003 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:44:05,008 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:44:05,019 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:44:05,027 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:44:05,030 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:44:05,032 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:44:05,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-01-29 23:44:05,035 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:05,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:05,037 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 23:44:05,046 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:05,047 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:05,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-29 23:44:05,047 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:05,052 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:05,052 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-01-29 23:44:05,088 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-01-29 23:44:05,089 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-01-29 23:44:05,089 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:05,091 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:05,099 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-01-29 23:44:05,100 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-01-29 23:44:05,101 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:05,102 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:05,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:05,108 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:40, output treesize:29 [2018-01-29 23:44:05,171 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:05,175 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 31 treesize of output 32 [2018-01-29 23:44:05,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-29 23:44:05,177 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:05,182 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:05,193 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:05,196 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 35 [2018-01-29 23:44:05,197 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 19 [2018-01-29 23:44:05,197 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:05,201 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:05,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-01-29 23:44:05,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-29 23:44:05,212 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:05,213 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:05,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:05,221 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:74, output treesize:48 [2018-01-29 23:44:05,253 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 112 treesize of output 113 [2018-01-29 23:44:05,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-01-29 23:44:05,256 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:05,266 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:05,284 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 105 treesize of output 101 [2018-01-29 23:44:05,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-01-29 23:44:05,286 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:05,295 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:05,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 42 [2018-01-29 23:44:05,312 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:05,314 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 42 treesize of output 30 [2018-01-29 23:44:05,314 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:05,317 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:05,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:05,325 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:123, output treesize:68 [2018-01-29 23:44:05,393 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 65 treesize of output 51 [2018-01-29 23:44:05,395 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 40 treesize of output 29 [2018-01-29 23:44:05,396 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:05,402 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-01-29 23:44:05,403 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:05,407 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:05,415 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 39 treesize of output 33 [2018-01-29 23:44:05,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-01-29 23:44:05,417 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:05,423 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 20 treesize of output 11 [2018-01-29 23:44:05,423 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:05,426 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:05,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:05,430 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:79, output treesize:11 [2018-01-29 23:44:05,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-29 23:44:05,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-29 23:44:05,477 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:05,478 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:05,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:05,479 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-01-29 23:44:05,493 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:44:05,527 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:44:05,527 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 26 [2018-01-29 23:44:05,527 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-29 23:44:05,528 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-29 23:44:05,528 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2018-01-29 23:44:05,528 INFO L87 Difference]: Start difference. First operand 264 states and 279 transitions. Second operand 26 states. [2018-01-29 23:44:06,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:44:06,392 INFO L93 Difference]: Finished difference Result 442 states and 465 transitions. [2018-01-29 23:44:06,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-29 23:44:06,392 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 75 [2018-01-29 23:44:06,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:44:06,394 INFO L225 Difference]: With dead ends: 442 [2018-01-29 23:44:06,394 INFO L226 Difference]: Without dead ends: 373 [2018-01-29 23:44:06,395 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 63 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=271, Invalid=1621, Unknown=0, NotChecked=0, Total=1892 [2018-01-29 23:44:06,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2018-01-29 23:44:06,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 267. [2018-01-29 23:44:06,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-01-29 23:44:06,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 282 transitions. [2018-01-29 23:44:06,407 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 282 transitions. Word has length 75 [2018-01-29 23:44:06,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:44:06,407 INFO L432 AbstractCegarLoop]: Abstraction has 267 states and 282 transitions. [2018-01-29 23:44:06,407 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-29 23:44:06,407 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 282 transitions. [2018-01-29 23:44:06,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-01-29 23:44:06,408 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:44:06,408 INFO L350 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 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-01-29 23:44:06,408 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:44:06,409 INFO L82 PathProgramCache]: Analyzing trace with hash -23022467, now seen corresponding path program 1 times [2018-01-29 23:44:06,409 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:44:06,409 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:44:06,409 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:44:06,410 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:44:06,410 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:44:06,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:44:06,424 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:44:06,742 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:44:06,742 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:44:06,743 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:44:06,747 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:44:06,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:44:06,772 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:44:06,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-01-29 23:44:06,775 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:06,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:06,778 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 23:44:06,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-01-29 23:44:06,830 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:06,838 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:06,839 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:06,839 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-01-29 23:44:06,839 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:06,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:06,846 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-01-29 23:44:06,886 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-01-29 23:44:06,888 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-01-29 23:44:06,888 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:06,889 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:06,900 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-01-29 23:44:06,901 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-01-29 23:44:06,902 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:06,903 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:06,911 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:06,911 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:45, output treesize:31 [2018-01-29 23:44:06,988 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:06,998 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 40 treesize of output 41 [2018-01-29 23:44:07,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-29 23:44:07,001 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:07,009 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:07,023 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:07,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2018-01-29 23:44:07,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-01-29 23:44:07,029 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:07,032 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:07,043 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 12 [2018-01-29 23:44:07,045 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 15 [2018-01-29 23:44:07,045 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:07,047 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:07,061 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:07,062 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:79, output treesize:53 [2018-01-29 23:44:07,102 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 55 treesize of output 42 [2018-01-29 23:44:07,105 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:07,107 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 42 treesize of output 30 [2018-01-29 23:44:07,107 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:07,113 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:07,128 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 73 treesize of output 74 [2018-01-29 23:44:07,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-01-29 23:44:07,130 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:07,137 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:07,150 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 71 [2018-01-29 23:44:07,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-01-29 23:44:07,152 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:07,158 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:07,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:07,166 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:132, output treesize:77 [2018-01-29 23:44:07,264 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 76 treesize of output 65 [2018-01-29 23:44:07,268 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-01-29 23:44:07,268 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:07,278 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:44:07,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, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2018-01-29 23:44:07,279 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:07,284 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:07,295 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2018-01-29 23:44:07,297 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:44:07,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2018-01-29 23:44:07,297 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:07,303 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-01-29 23:44:07,303 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:07,306 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:07,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:07,312 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:98, output treesize:16 [2018-01-29 23:44:07,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-29 23:44:07,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-29 23:44:07,381 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:07,382 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:07,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:07,386 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:12 [2018-01-29 23:44:07,428 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:44:07,449 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:44:07,450 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 31 [2018-01-29 23:44:07,450 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-01-29 23:44:07,450 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-01-29 23:44:07,450 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=848, Unknown=0, NotChecked=0, Total=930 [2018-01-29 23:44:07,451 INFO L87 Difference]: Start difference. First operand 267 states and 282 transitions. Second operand 31 states. [2018-01-29 23:44:08,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:44:08,661 INFO L93 Difference]: Finished difference Result 401 states and 420 transitions. [2018-01-29 23:44:08,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-29 23:44:08,662 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 79 [2018-01-29 23:44:08,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:44:08,663 INFO L225 Difference]: With dead ends: 401 [2018-01-29 23:44:08,663 INFO L226 Difference]: Without dead ends: 348 [2018-01-29 23:44:08,663 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=317, Invalid=1939, Unknown=0, NotChecked=0, Total=2256 [2018-01-29 23:44:08,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2018-01-29 23:44:08,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 271. [2018-01-29 23:44:08,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-01-29 23:44:08,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 286 transitions. [2018-01-29 23:44:08,673 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 286 transitions. Word has length 79 [2018-01-29 23:44:08,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:44:08,701 INFO L432 AbstractCegarLoop]: Abstraction has 271 states and 286 transitions. [2018-01-29 23:44:08,702 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-01-29 23:44:08,702 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 286 transitions. [2018-01-29 23:44:08,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-01-29 23:44:08,702 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:44:08,702 INFO L350 BasicCegarLoop]: trace histogram [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, 1, 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-01-29 23:44:08,703 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:44:08,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1778982527, now seen corresponding path program 2 times [2018-01-29 23:44:08,703 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:44:08,703 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:44:08,703 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:44:08,703 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:44:08,703 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:44:08,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:44:08,714 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:44:09,007 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:44:09,008 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:44:09,008 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:44:09,012 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:44:09,024 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:44:09,033 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:44:09,036 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:44:09,039 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:44:09,042 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-01-29 23:44:09,043 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:09,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:09,045 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 23:44:09,078 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:09,078 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:09,079 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-01-29 23:44:09,079 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:09,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:09,084 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-01-29 23:44:09,123 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-01-29 23:44:09,124 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-01-29 23:44:09,124 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:09,125 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:09,134 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-01-29 23:44:09,135 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-01-29 23:44:09,135 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:09,137 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:09,143 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:09,143 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:40, output treesize:29 [2018-01-29 23:44:09,222 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 12 [2018-01-29 23:44:09,225 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 15 [2018-01-29 23:44:09,225 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:09,228 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:09,246 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:09,249 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 50 [2018-01-29 23:44:09,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 16 treesize of output 19 [2018-01-29 23:44:09,252 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:09,258 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:09,269 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:09,272 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 46 treesize of output 47 [2018-01-29 23:44:09,274 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 15 [2018-01-29 23:44:09,274 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:09,280 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:09,287 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:09,287 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:74, output treesize:48 [2018-01-29 23:44:09,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 113 [2018-01-29 23:44:09,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-01-29 23:44:09,328 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:09,343 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:09,358 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 55 treesize of output 42 [2018-01-29 23:44:09,360 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:09,362 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 42 treesize of output 30 [2018-01-29 23:44:09,363 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:09,367 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:09,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2018-01-29 23:44:09,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-01-29 23:44:09,385 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:09,390 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:09,410 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:09,411 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:123, output treesize:68 [2018-01-29 23:44:09,474 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 65 treesize of output 51 [2018-01-29 23:44:09,476 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 40 treesize of output 29 [2018-01-29 23:44:09,477 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:09,483 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-01-29 23:44:09,483 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:09,487 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:09,495 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 39 treesize of output 33 [2018-01-29 23:44:09,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-01-29 23:44:09,497 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:09,503 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 20 treesize of output 11 [2018-01-29 23:44:09,503 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:09,507 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:09,512 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:09,512 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:79, output treesize:11 [2018-01-29 23:44:09,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-29 23:44:09,549 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-29 23:44:09,549 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:09,550 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:09,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:09,551 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-01-29 23:44:09,567 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:44:09,588 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:44:09,588 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 29 [2018-01-29 23:44:09,588 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-29 23:44:09,588 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-29 23:44:09,589 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=715, Unknown=0, NotChecked=0, Total=812 [2018-01-29 23:44:09,589 INFO L87 Difference]: Start difference. First operand 271 states and 286 transitions. Second operand 29 states. [2018-01-29 23:44:10,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:44:10,665 INFO L93 Difference]: Finished difference Result 388 states and 405 transitions. [2018-01-29 23:44:10,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-29 23:44:10,666 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 79 [2018-01-29 23:44:10,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:44:10,667 INFO L225 Difference]: With dead ends: 388 [2018-01-29 23:44:10,667 INFO L226 Difference]: Without dead ends: 335 [2018-01-29 23:44:10,668 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 572 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=380, Invalid=1972, Unknown=0, NotChecked=0, Total=2352 [2018-01-29 23:44:10,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-01-29 23:44:10,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 271. [2018-01-29 23:44:10,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-01-29 23:44:10,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 286 transitions. [2018-01-29 23:44:10,683 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 286 transitions. Word has length 79 [2018-01-29 23:44:10,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:44:10,684 INFO L432 AbstractCegarLoop]: Abstraction has 271 states and 286 transitions. [2018-01-29 23:44:10,684 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-29 23:44:10,684 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 286 transitions. [2018-01-29 23:44:10,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-01-29 23:44:10,685 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:44:10,685 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 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, 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-01-29 23:44:10,685 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:44:10,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1546617945, now seen corresponding path program 2 times [2018-01-29 23:44:10,686 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:44:10,686 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:44:10,686 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:44:10,686 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:44:10,687 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:44:10,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:44:10,699 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:44:10,773 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-29 23:44:10,773 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:44:10,773 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:44:10,780 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:44:10,798 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:44:10,815 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:44:10,818 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:44:10,821 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:44:10,855 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-29 23:44:10,889 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:44:10,889 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-01-29 23:44:10,889 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-29 23:44:10,889 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-29 23:44:10,890 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-01-29 23:44:10,890 INFO L87 Difference]: Start difference. First operand 271 states and 286 transitions. Second operand 10 states. [2018-01-29 23:44:11,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:44:11,013 INFO L93 Difference]: Finished difference Result 593 states and 628 transitions. [2018-01-29 23:44:11,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-29 23:44:11,013 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 82 [2018-01-29 23:44:11,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:44:11,015 INFO L225 Difference]: With dead ends: 593 [2018-01-29 23:44:11,015 INFO L226 Difference]: Without dead ends: 459 [2018-01-29 23:44:11,015 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2018-01-29 23:44:11,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-01-29 23:44:11,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 287. [2018-01-29 23:44:11,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-01-29 23:44:11,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 302 transitions. [2018-01-29 23:44:11,027 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 302 transitions. Word has length 82 [2018-01-29 23:44:11,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:44:11,027 INFO L432 AbstractCegarLoop]: Abstraction has 287 states and 302 transitions. [2018-01-29 23:44:11,027 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-29 23:44:11,027 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 302 transitions. [2018-01-29 23:44:11,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-01-29 23:44:11,028 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:44:11,028 INFO L350 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, 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-01-29 23:44:11,028 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:44:11,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1192886289, now seen corresponding path program 1 times [2018-01-29 23:44:11,028 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:44:11,028 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:44:11,029 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:44:11,029 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:44:11,029 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:44:11,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:44:11,038 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:44:11,348 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-29 23:44:11,348 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:44:11,348 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:44:11,353 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:44:11,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:44:11,381 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:44:11,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 23:44:11,383 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:11,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:11,386 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 23:44:11,443 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:11,444 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:11,444 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-01-29 23:44:11,445 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:11,450 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:11,451 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-01-29 23:44:11,506 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-01-29 23:44:11,507 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-01-29 23:44:11,508 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:11,509 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:11,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:11,516 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2018-01-29 23:44:11,611 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:11,614 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 46 [2018-01-29 23:44:11,622 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 1 [2018-01-29 23:44:11,623 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:11,629 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:11,637 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-01-29 23:44:11,637 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:30 [2018-01-29 23:44:11,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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-01-29 23:44:11,663 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-01-29 23:44:11,663 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:11,668 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:11,674 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-01-29 23:44:11,674 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:42 [2018-01-29 23:44:11,768 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 45 treesize of output 38 [2018-01-29 23:44:11,770 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-01-29 23:44:11,770 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:11,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 21 [2018-01-29 23:44:11,781 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-29 23:44:11,785 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 23:44:11,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-29 23:44:11,794 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:51, output treesize:13 [2018-01-29 23:44:11,857 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-29 23:44:11,877 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:44:11,877 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 28 [2018-01-29 23:44:11,878 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-29 23:44:11,878 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-29 23:44:11,878 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=685, Unknown=0, NotChecked=0, Total=756 [2018-01-29 23:44:11,878 INFO L87 Difference]: Start difference. First operand 287 states and 302 transitions. Second operand 28 states. [2018-01-29 23:44:12,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:44:12,894 INFO L93 Difference]: Finished difference Result 386 states and 404 transitions. [2018-01-29 23:44:12,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-29 23:44:12,894 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 82 [2018-01-29 23:44:12,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:44:12,896 INFO L225 Difference]: With dead ends: 386 [2018-01-29 23:44:12,896 INFO L226 Difference]: Without dead ends: 381 [2018-01-29 23:44:12,896 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=294, Invalid=1598, Unknown=0, NotChecked=0, Total=1892 [2018-01-29 23:44:12,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-01-29 23:44:12,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 298. [2018-01-29 23:44:12,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2018-01-29 23:44:12,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 313 transitions. [2018-01-29 23:44:12,909 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 313 transitions. Word has length 82 [2018-01-29 23:44:12,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:44:12,910 INFO L432 AbstractCegarLoop]: Abstraction has 298 states and 313 transitions. [2018-01-29 23:44:12,910 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-29 23:44:12,910 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 313 transitions. [2018-01-29 23:44:12,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-01-29 23:44:12,911 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:44:12,911 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 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, 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-01-29 23:44:12,911 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:44:12,911 INFO L82 PathProgramCache]: Analyzing trace with hash -865220519, now seen corresponding path program 1 times [2018-01-29 23:44:12,911 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:44:12,911 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:44:12,912 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:44:12,912 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:44:12,912 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:44:12,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:44:12,920 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:44:13,008 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-29 23:44:13,008 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:44:13,008 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:44:13,020 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:44:13,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:44:13,052 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:44:13,071 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-29 23:44:13,092 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:44:13,092 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-01-29 23:44:13,093 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-29 23:44:13,093 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-29 23:44:13,093 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-01-29 23:44:13,093 INFO L87 Difference]: Start difference. First operand 298 states and 313 transitions. Second operand 10 states. [2018-01-29 23:44:13,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:44:13,187 INFO L93 Difference]: Finished difference Result 493 states and 520 transitions. [2018-01-29 23:44:13,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-29 23:44:13,187 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 82 [2018-01-29 23:44:13,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:44:13,189 INFO L225 Difference]: With dead ends: 493 [2018-01-29 23:44:13,189 INFO L226 Difference]: Without dead ends: 384 [2018-01-29 23:44:13,190 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2018-01-29 23:44:13,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2018-01-29 23:44:13,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 317. [2018-01-29 23:44:13,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-01-29 23:44:13,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 333 transitions. [2018-01-29 23:44:13,206 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 333 transitions. Word has length 82 [2018-01-29 23:44:13,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:44:13,207 INFO L432 AbstractCegarLoop]: Abstraction has 317 states and 333 transitions. [2018-01-29 23:44:13,207 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-29 23:44:13,207 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 333 transitions. [2018-01-29 23:44:13,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-01-29 23:44:13,208 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:44:13,208 INFO L350 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, 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-01-29 23:44:13,208 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:44:13,208 INFO L82 PathProgramCache]: Analyzing trace with hash -297368469, now seen corresponding path program 1 times [2018-01-29 23:44:13,209 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:44:13,209 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:44:13,209 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:44:13,209 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:44:13,210 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:44:13,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:44:13,220 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:44:13,417 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-29 23:44:13,417 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:44:13,417 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:44:13,422 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:44:13,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:44:13,447 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:44:13,449 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-01-29 23:44:13,449 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:13,451 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:13,451 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 23:44:13,493 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:13,494 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:13,494 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-01-29 23:44:13,494 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:13,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:13,499 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-01-29 23:44:13,540 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-01-29 23:44:13,541 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-01-29 23:44:13,541 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:13,542 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:13,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:13,548 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2018-01-29 23:44:13,604 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:13,606 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 46 [2018-01-29 23:44:13,623 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 1 [2018-01-29 23:44:13,624 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:13,661 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:13,690 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-01-29 23:44:13,690 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:36 [2018-01-29 23:44:13,724 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-01-29 23:44:13,725 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-01-29 23:44:13,725 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:13,729 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:13,734 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-01-29 23:44:13,734 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:42 [2018-01-29 23:44:13,805 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 45 treesize of output 38 [2018-01-29 23:44:13,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-29 23:44:13,807 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:13,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 21 [2018-01-29 23:44:13,816 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-29 23:44:13,819 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 23:44:13,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-29 23:44:13,826 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:51, output treesize:13 [2018-01-29 23:44:13,884 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-29 23:44:13,918 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:44:13,918 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 29 [2018-01-29 23:44:13,918 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-29 23:44:13,918 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-29 23:44:13,918 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=729, Unknown=0, NotChecked=0, Total=812 [2018-01-29 23:44:13,919 INFO L87 Difference]: Start difference. First operand 317 states and 333 transitions. Second operand 29 states. [2018-01-29 23:44:15,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:44:15,074 INFO L93 Difference]: Finished difference Result 392 states and 408 transitions. [2018-01-29 23:44:15,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-29 23:44:15,075 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 82 [2018-01-29 23:44:15,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:44:15,076 INFO L225 Difference]: With dead ends: 392 [2018-01-29 23:44:15,076 INFO L226 Difference]: Without dead ends: 387 [2018-01-29 23:44:15,077 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=379, Invalid=1973, Unknown=0, NotChecked=0, Total=2352 [2018-01-29 23:44:15,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-01-29 23:44:15,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 314. [2018-01-29 23:44:15,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2018-01-29 23:44:15,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 330 transitions. [2018-01-29 23:44:15,092 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 330 transitions. Word has length 82 [2018-01-29 23:44:15,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:44:15,093 INFO L432 AbstractCegarLoop]: Abstraction has 314 states and 330 transitions. [2018-01-29 23:44:15,093 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-29 23:44:15,093 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 330 transitions. [2018-01-29 23:44:15,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-01-29 23:44:15,094 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:44:15,094 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:44:15,094 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:44:15,094 INFO L82 PathProgramCache]: Analyzing trace with hash 495796502, now seen corresponding path program 3 times [2018-01-29 23:44:15,095 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:44:15,095 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:44:15,095 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:44:15,095 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:44:15,095 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:44:15,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:44:15,110 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:44:15,671 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:44:15,672 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:44:15,672 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:44:15,677 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 23:44:15,690 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:44:15,698 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:44:15,716 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:44:15,718 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:44:15,722 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:44:15,724 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-01-29 23:44:15,725 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:15,738 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:15,738 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 23:44:15,754 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:15,755 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:15,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-29 23:44:15,756 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:15,760 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:15,761 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-01-29 23:44:15,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 23:44:15,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-01-29 23:44:15,775 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:15,776 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:15,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:15,782 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2018-01-29 23:44:15,845 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:15,848 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 31 treesize of output 32 [2018-01-29 23:44:15,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 1 [2018-01-29 23:44:15,850 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:15,853 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:15,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:15,857 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:19 [2018-01-29 23:44:15,926 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 14 [2018-01-29 23:44:15,929 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-01-29 23:44:15,929 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:15,931 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:15,942 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:15,945 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 42 treesize of output 43 [2018-01-29 23:44:15,955 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-01-29 23:44:15,956 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:15,962 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:15,970 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:15,970 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:37 [2018-01-29 23:44:15,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2018-01-29 23:44:15,997 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-01-29 23:44:15,997 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:15,999 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:16,006 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-01-29 23:44:16,006 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:60, output treesize:37 [2018-01-29 23:44:16,108 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 18 [2018-01-29 23:44:16,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-01-29 23:44:16,115 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:16,117 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:16,221 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 83 [2018-01-29 23:44:16,227 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:16,229 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 61 treesize of output 63 [2018-01-29 23:44:16,229 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:16,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 47 [2018-01-29 23:44:16,320 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-01-29 23:44:16,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 48 [2018-01-29 23:44:16,406 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:16,439 INFO L267 ElimStorePlain]: Start of recursive call 4: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 23:44:16,456 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 2 xjuncts. [2018-01-29 23:44:16,456 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:63, output treesize:93 [2018-01-29 23:44:16,508 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 78 treesize of output 65 [2018-01-29 23:44:16,511 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 26 treesize of output 11 [2018-01-29 23:44:16,511 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:16,517 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:16,565 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 114 treesize of output 109 [2018-01-29 23:44:16,571 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:44:17,040 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 101 treesize of output 100 [2018-01-29 23:44:17,040 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:17,185 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 82 treesize of output 90 [2018-01-29 23:44:17,186 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-01-29 23:44:17,279 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 84 [2018-01-29 23:44:17,280 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:44:17,355 INFO L267 ElimStorePlain]: Start of recursive call 4: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-01-29 23:44:17,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 100 treesize of output 75 [2018-01-29 23:44:17,479 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 17 [2018-01-29 23:44:17,479 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:17,486 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:17,488 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 127 treesize of output 102 [2018-01-29 23:44:17,491 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 17 [2018-01-29 23:44:17,491 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:17,500 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:17,502 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 81 treesize of output 64 [2018-01-29 23:44:17,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2018-01-29 23:44:17,505 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:17,512 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:17,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 62 [2018-01-29 23:44:17,518 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 26 treesize of output 11 [2018-01-29 23:44:17,518 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:17,525 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:17,574 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 51 treesize of output 47 [2018-01-29 23:44:17,576 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-01-29 23:44:17,576 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:17,581 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:17,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: 5 dim-0 vars, and 4 xjuncts. [2018-01-29 23:44:17,620 INFO L202 ElimStorePlain]: Needed 18 recursive calls to eliminate 5 variables, input treesize:193, output treesize:229 [2018-01-29 23:44:17,872 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 53 treesize of output 45 [2018-01-29 23:44:17,874 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-01-29 23:44:17,874 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:17,879 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:17,908 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 48 [2018-01-29 23:44:17,910 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 11 treesize of output 7 [2018-01-29 23:44:17,910 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:17,918 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:17,954 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 65 treesize of output 69 [2018-01-29 23:44:17,956 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 51 treesize of output 44 [2018-01-29 23:44:17,957 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:17,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 55 [2018-01-29 23:44:17,977 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:17,995 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 23:44:18,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-01-29 23:44:18,030 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:177, output treesize:176 [2018-01-29 23:44:18,261 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 1 case distinctions, treesize of input 56 treesize of output 47 [2018-01-29 23:44:18,264 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 32 treesize of output 23 [2018-01-29 23:44:18,264 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:18,279 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 35 treesize of output 26 [2018-01-29 23:44:18,279 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:18,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-01-29 23:44:18,291 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:18,297 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:18,307 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 36 treesize of output 24 [2018-01-29 23:44:18,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-01-29 23:44:18,309 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:18,318 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:18,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:18,326 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:93, output treesize:5 [2018-01-29 23:44:18,366 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:44:18,385 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:44:18,386 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 23] total 34 [2018-01-29 23:44:18,386 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-01-29 23:44:18,386 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-01-29 23:44:18,386 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1093, Unknown=0, NotChecked=0, Total=1190 [2018-01-29 23:44:18,387 INFO L87 Difference]: Start difference. First operand 314 states and 330 transitions. Second operand 35 states. [2018-01-29 23:44:20,498 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 129 DAG size of output 87 [2018-01-29 23:44:22,924 WARN L146 SmtUtils]: Spent 141ms on a formula simplification. DAG size of input: 99 DAG size of output 95 [2018-01-29 23:44:23,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:44:23,281 INFO L93 Difference]: Finished difference Result 590 states and 618 transitions. [2018-01-29 23:44:23,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-01-29 23:44:23,281 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 84 [2018-01-29 23:44:23,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:44:23,283 INFO L225 Difference]: With dead ends: 590 [2018-01-29 23:44:23,283 INFO L226 Difference]: Without dead ends: 589 [2018-01-29 23:44:23,285 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 64 SyntacticMatches, 6 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1817 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=917, Invalid=6393, Unknown=0, NotChecked=0, Total=7310 [2018-01-29 23:44:23,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2018-01-29 23:44:23,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 344. [2018-01-29 23:44:23,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2018-01-29 23:44:23,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 364 transitions. [2018-01-29 23:44:23,299 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 364 transitions. Word has length 84 [2018-01-29 23:44:23,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:44:23,299 INFO L432 AbstractCegarLoop]: Abstraction has 344 states and 364 transitions. [2018-01-29 23:44:23,299 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-01-29 23:44:23,299 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 364 transitions. [2018-01-29 23:44:23,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-01-29 23:44:23,300 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:44:23,300 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:44:23,300 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:44:23,300 INFO L82 PathProgramCache]: Analyzing trace with hash 495796503, now seen corresponding path program 2 times [2018-01-29 23:44:23,300 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:44:23,301 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:44:23,301 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:44:23,301 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:44:23,301 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:44:23,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:44:23,314 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:44:23,895 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:44:23,896 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:44:23,896 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:44:23,902 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:44:23,917 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:44:23,930 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:44:23,934 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:44:23,937 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:44:23,940 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-01-29 23:44:23,941 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:23,979 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:23,980 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 23:44:23,992 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:23,993 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:23,994 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-01-29 23:44:23,994 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:24,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:24,002 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-01-29 23:44:24,073 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-01-29 23:44:24,076 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-01-29 23:44:24,076 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:24,078 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:24,092 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-01-29 23:44:24,094 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-01-29 23:44:24,094 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:24,095 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:24,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:24,103 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:34 [2018-01-29 23:44:24,174 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:24,177 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 31 treesize of output 32 [2018-01-29 23:44:24,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-01-29 23:44:24,179 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:24,182 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:24,191 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:24,193 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 23 treesize of output 28 [2018-01-29 23:44:24,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-01-29 23:44:24,194 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:24,197 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:24,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:24,202 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:61, output treesize:31 [2018-01-29 23:44:24,205 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:24,205 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:24,206 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-01-29 23:44:24,206 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:24,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:24,211 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:30 [2018-01-29 23:44:24,254 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:24,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-01-29 23:44:24,259 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-01-29 23:44:24,259 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:24,264 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:24,277 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:24,279 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 21 treesize of output 26 [2018-01-29 23:44:24,281 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-01-29 23:44:24,281 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:24,285 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:24,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:24,295 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:68, output treesize:48 [2018-01-29 23:44:24,402 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:24,417 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 75 [2018-01-29 23:44:24,419 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 71 treesize of output 59 [2018-01-29 23:44:24,420 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:24,451 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 38 [2018-01-29 23:44:24,451 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-29 23:44:24,466 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 23:44:24,485 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:24,488 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 23 treesize of output 24 [2018-01-29 23:44:24,490 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 1 [2018-01-29 23:44:24,490 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:24,492 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:24,508 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 2 xjuncts. [2018-01-29 23:44:24,508 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:92, output treesize:99 [2018-01-29 23:44:24,579 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 115 treesize of output 105 [2018-01-29 23:44:24,582 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 120 treesize of output 119 [2018-01-29 23:44:24,583 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:24,640 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 91 [2018-01-29 23:44:24,640 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-29 23:44:24,678 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 23:44:24,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 71 [2018-01-29 23:44:24,747 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-01-29 23:44:24,747 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:24,756 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:24,809 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 101 treesize of output 88 [2018-01-29 23:44:24,811 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 20 treesize of output 19 [2018-01-29 23:44:24,811 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:24,820 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:24,824 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 69 [2018-01-29 23:44:24,826 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-01-29 23:44:24,826 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:24,835 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:24,879 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 67 treesize of output 60 [2018-01-29 23:44:24,881 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-01-29 23:44:24,881 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:24,891 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:24,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-01-29 23:44:24,926 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 7 variables, input treesize:191, output treesize:208 [2018-01-29 23:44:25,139 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 56 [2018-01-29 23:44:25,141 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 32 treesize of output 21 [2018-01-29 23:44:25,141 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:25,151 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-01-29 23:44:25,151 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:25,159 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:25,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2018-01-29 23:44:25,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-29 23:44:25,199 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:25,205 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-01-29 23:44:25,205 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:25,209 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:25,241 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 72 treesize of output 70 [2018-01-29 23:44:25,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-29 23:44:25,243 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:25,253 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-01-29 23:44:25,253 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:25,260 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:25,293 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 1 case distinctions, treesize of input 98 treesize of output 83 [2018-01-29 23:44:25,295 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 68 treesize of output 59 [2018-01-29 23:44:25,296 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:25,321 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 76 treesize of output 67 [2018-01-29 23:44:25,322 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:25,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 55 [2018-01-29 23:44:25,355 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:44:25,379 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 55 treesize of output 48 [2018-01-29 23:44:25,380 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:25,407 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 59 treesize of output 56 [2018-01-29 23:44:25,408 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-29 23:44:25,438 INFO L267 ElimStorePlain]: Start of recursive call 11: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-29 23:44:25,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 36 [2018-01-29 23:44:25,488 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 21 treesize of output 12 [2018-01-29 23:44:25,488 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:25,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-01-29 23:44:25,494 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:25,498 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:25,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 42 [2018-01-29 23:44:25,546 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-01-29 23:44:25,546 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:25,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-29 23:44:25,554 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:25,560 INFO L267 ElimStorePlain]: Start of recursive call 20: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:25,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2018-01-29 23:44:25,564 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-01-29 23:44:25,564 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:25,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-29 23:44:25,573 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:25,579 INFO L267 ElimStorePlain]: Start of recursive call 23: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:25,582 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 44 treesize of output 38 [2018-01-29 23:44:25,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-29 23:44:25,583 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:25,591 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-01-29 23:44:25,591 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:25,596 INFO L267 ElimStorePlain]: Start of recursive call 26: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:25,627 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:25,628 INFO L202 ElimStorePlain]: Needed 28 recursive calls to eliminate 13 variables, input treesize:241, output treesize:9 [2018-01-29 23:44:25,716 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:44:25,736 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:44:25,736 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 34 [2018-01-29 23:44:25,736 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-01-29 23:44:25,736 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-01-29 23:44:25,737 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1088, Unknown=0, NotChecked=0, Total=1190 [2018-01-29 23:44:25,737 INFO L87 Difference]: Start difference. First operand 344 states and 364 transitions. Second operand 35 states. [2018-01-29 23:44:29,996 WARN L146 SmtUtils]: Spent 2359ms on a formula simplification. DAG size of input: 134 DAG size of output 85 [2018-01-29 23:44:31,602 WARN L146 SmtUtils]: Spent 1071ms on a formula simplification. DAG size of input: 81 DAG size of output 79 [2018-01-29 23:44:32,081 WARN L146 SmtUtils]: Spent 189ms on a formula simplification. DAG size of input: 136 DAG size of output 79 [2018-01-29 23:44:32,433 WARN L146 SmtUtils]: Spent 225ms on a formula simplification. DAG size of input: 141 DAG size of output 84 [2018-01-29 23:44:32,706 WARN L146 SmtUtils]: Spent 157ms on a formula simplification. DAG size of input: 121 DAG size of output 117 [2018-01-29 23:44:33,445 WARN L146 SmtUtils]: Spent 496ms on a formula simplification. DAG size of input: 78 DAG size of output 76 [2018-01-29 23:44:33,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:44:33,870 INFO L93 Difference]: Finished difference Result 558 states and 586 transitions. [2018-01-29 23:44:33,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-01-29 23:44:33,870 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 84 [2018-01-29 23:44:33,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:44:33,872 INFO L225 Difference]: With dead ends: 558 [2018-01-29 23:44:33,872 INFO L226 Difference]: Without dead ends: 553 [2018-01-29 23:44:33,873 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 829 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=589, Invalid=3967, Unknown=0, NotChecked=0, Total=4556 [2018-01-29 23:44:33,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2018-01-29 23:44:33,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 342. [2018-01-29 23:44:33,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2018-01-29 23:44:33,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 361 transitions. [2018-01-29 23:44:33,889 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 361 transitions. Word has length 84 [2018-01-29 23:44:33,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:44:33,889 INFO L432 AbstractCegarLoop]: Abstraction has 342 states and 361 transitions. [2018-01-29 23:44:33,889 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-01-29 23:44:33,889 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 361 transitions. [2018-01-29 23:44:33,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-01-29 23:44:33,890 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:44:33,890 INFO L350 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 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-01-29 23:44:33,890 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:44:33,890 INFO L82 PathProgramCache]: Analyzing trace with hash -716039622, now seen corresponding path program 1 times [2018-01-29 23:44:33,890 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:44:33,891 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:44:33,891 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:44:33,891 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:44:33,891 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:44:33,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:44:33,905 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:44:34,414 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:44:34,415 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:44:34,415 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:44:34,422 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:44:34,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:44:34,453 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:44:34,455 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-01-29 23:44:34,455 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:34,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:34,458 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 23:44:34,514 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:34,515 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:34,515 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-01-29 23:44:34,516 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:34,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:34,520 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-01-29 23:44:34,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-01-29 23:44:34,533 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-01-29 23:44:34,533 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:34,534 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:34,541 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:34,541 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:25 [2018-01-29 23:44:34,564 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 25 treesize of output 26 [2018-01-29 23:44:34,565 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 1 [2018-01-29 23:44:34,565 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:34,568 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:34,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:34,572 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:22 [2018-01-29 23:44:34,580 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:34,581 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:34,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-29 23:44:34,581 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:34,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:34,585 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:21 [2018-01-29 23:44:34,613 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 23 treesize of output 24 [2018-01-29 23:44:34,614 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-01-29 23:44:34,615 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:34,618 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:34,624 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:34,624 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:32 [2018-01-29 23:44:34,698 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:34,710 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 79 [2018-01-29 23:44:34,712 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 79 treesize of output 67 [2018-01-29 23:44:34,713 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:34,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 46 [2018-01-29 23:44:34,741 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-29 23:44:34,755 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 23:44:34,769 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 2 xjuncts. [2018-01-29 23:44:34,769 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:71, output treesize:91 [2018-01-29 23:44:34,810 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 50 treesize of output 44 [2018-01-29 23:44:34,811 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-01-29 23:44:34,812 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:34,816 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:34,845 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 76 [2018-01-29 23:44:34,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 64 [2018-01-29 23:44:34,860 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-29 23:44:34,900 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 63 treesize of output 62 [2018-01-29 23:44:34,900 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:34,918 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 23:44:34,938 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-01-29 23:44:34,939 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:129, output treesize:143 [2018-01-29 23:44:35,103 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 52 treesize of output 45 [2018-01-29 23:44:35,106 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:44:35,137 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 25 treesize of output 17 [2018-01-29 23:44:35,138 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:35,144 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-01-29 23:44:35,144 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:35,147 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:35,166 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 5 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 68 [2018-01-29 23:44:35,169 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:44:35,169 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 58 treesize of output 46 [2018-01-29 23:44:35,169 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:35,188 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:44:35,188 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 46 treesize of output 38 [2018-01-29 23:44:35,189 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:35,209 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 32 treesize of output 33 [2018-01-29 23:44:35,209 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-01-29 23:44:35,229 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 40 treesize of output 33 [2018-01-29 23:44:35,229 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:35,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2018-01-29 23:44:35,246 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:35,253 INFO L267 ElimStorePlain]: Start of recursive call 5: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:35,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:35,261 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 9 variables, input treesize:127, output treesize:5 [2018-01-29 23:44:35,297 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:44:35,317 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:44:35,317 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 30 [2018-01-29 23:44:35,318 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-01-29 23:44:35,318 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-01-29 23:44:35,318 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=829, Unknown=0, NotChecked=0, Total=930 [2018-01-29 23:44:35,318 INFO L87 Difference]: Start difference. First operand 342 states and 361 transitions. Second operand 31 states. [2018-01-29 23:44:37,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:44:37,423 INFO L93 Difference]: Finished difference Result 538 states and 565 transitions. [2018-01-29 23:44:37,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-01-29 23:44:37,424 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 84 [2018-01-29 23:44:37,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:44:37,425 INFO L225 Difference]: With dead ends: 538 [2018-01-29 23:44:37,425 INFO L226 Difference]: Without dead ends: 537 [2018-01-29 23:44:37,426 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 65 SyntacticMatches, 9 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 884 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=598, Invalid=3184, Unknown=0, NotChecked=0, Total=3782 [2018-01-29 23:44:37,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2018-01-29 23:44:37,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 380. [2018-01-29 23:44:37,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-01-29 23:44:37,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 402 transitions. [2018-01-29 23:44:37,445 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 402 transitions. Word has length 84 [2018-01-29 23:44:37,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:44:37,446 INFO L432 AbstractCegarLoop]: Abstraction has 380 states and 402 transitions. [2018-01-29 23:44:37,446 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-01-29 23:44:37,446 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 402 transitions. [2018-01-29 23:44:37,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-01-29 23:44:37,446 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:44:37,447 INFO L350 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 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-01-29 23:44:37,447 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:44:37,447 INFO L82 PathProgramCache]: Analyzing trace with hash -716039621, now seen corresponding path program 1 times [2018-01-29 23:44:37,447 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:44:37,447 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:44:37,447 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:44:37,447 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:44:37,447 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:44:37,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:44:37,458 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:44:37,879 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:44:37,879 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:44:37,879 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:44:37,884 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:44:37,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:44:37,911 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:44:37,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 23:44:37,926 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:37,928 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:37,928 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 23:44:37,982 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:37,983 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:37,983 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-01-29 23:44:37,983 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:37,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:37,991 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-01-29 23:44:38,044 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-01-29 23:44:38,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-01-29 23:44:38,046 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:38,047 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:38,058 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-01-29 23:44:38,059 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-01-29 23:44:38,059 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:38,061 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:38,069 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:38,069 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:45 [2018-01-29 23:44:38,159 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:38,162 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 40 treesize of output 41 [2018-01-29 23:44:38,164 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 1 [2018-01-29 23:44:38,164 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:38,169 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:38,178 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:38,181 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 23 treesize of output 28 [2018-01-29 23:44:38,182 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-01-29 23:44:38,182 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:38,185 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:38,192 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:38,192 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:70, output treesize:40 [2018-01-29 23:44:38,194 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:38,195 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:38,195 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:38,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-01-29 23:44:38,196 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:38,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:38,202 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:38 [2018-01-29 23:44:38,253 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:38,256 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 37 treesize of output 38 [2018-01-29 23:44:38,258 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-01-29 23:44:38,258 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:38,264 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:38,278 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:38,281 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 21 treesize of output 26 [2018-01-29 23:44:38,282 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-01-29 23:44:38,283 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:38,286 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:38,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:38,299 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:76, output treesize:62 [2018-01-29 23:44:38,412 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:38,412 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:38,418 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 84 [2018-01-29 23:44:38,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-01-29 23:44:38,421 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:38,429 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:38,442 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:38,445 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 23 treesize of output 34 [2018-01-29 23:44:38,447 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-01-29 23:44:38,447 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:38,450 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:38,459 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-01-29 23:44:38,459 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:110, output treesize:70 [2018-01-29 23:44:38,497 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 95 [2018-01-29 23:44:38,499 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 20 treesize of output 19 [2018-01-29 23:44:38,499 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:38,508 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:38,524 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 41 treesize of output 42 [2018-01-29 23:44:38,526 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 20 treesize of output 19 [2018-01-29 23:44:38,526 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:38,530 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:38,541 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-01-29 23:44:38,542 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:133, output treesize:105 [2018-01-29 23:44:38,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 73 [2018-01-29 23:44:38,722 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:44:38,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2018-01-29 23:44:38,723 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:38,733 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-01-29 23:44:38,733 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:38,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2018-01-29 23:44:38,741 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:44:38,747 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:44:38,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2018-01-29 23:44:38,762 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:44:38,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-01-29 23:44:38,762 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:38,767 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-01-29 23:44:38,767 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:38,768 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:38,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:38,777 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:126, output treesize:9 [2018-01-29 23:44:38,861 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:44:38,881 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:44:38,881 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 37 [2018-01-29 23:44:38,881 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-01-29 23:44:38,881 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-01-29 23:44:38,882 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1281, Unknown=0, NotChecked=0, Total=1406 [2018-01-29 23:44:38,882 INFO L87 Difference]: Start difference. First operand 380 states and 402 transitions. Second operand 38 states. [2018-01-29 23:44:42,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:44:42,163 INFO L93 Difference]: Finished difference Result 598 states and 627 transitions. [2018-01-29 23:44:42,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-01-29 23:44:42,164 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 84 [2018-01-29 23:44:42,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:44:42,165 INFO L225 Difference]: With dead ends: 598 [2018-01-29 23:44:42,165 INFO L226 Difference]: Without dead ends: 593 [2018-01-29 23:44:42,167 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1116 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=721, Invalid=4829, Unknown=0, NotChecked=0, Total=5550 [2018-01-29 23:44:42,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2018-01-29 23:44:42,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 361. [2018-01-29 23:44:42,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-01-29 23:44:42,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 381 transitions. [2018-01-29 23:44:42,184 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 381 transitions. Word has length 84 [2018-01-29 23:44:42,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:44:42,184 INFO L432 AbstractCegarLoop]: Abstraction has 361 states and 381 transitions. [2018-01-29 23:44:42,184 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-01-29 23:44:42,185 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 381 transitions. [2018-01-29 23:44:42,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-01-29 23:44:42,185 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:44:42,185 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:44:42,185 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:44:42,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1601780074, now seen corresponding path program 2 times [2018-01-29 23:44:42,186 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:44:42,186 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:44:42,186 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:44:42,186 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:44:42,186 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:44:42,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:44:42,199 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:44:42,839 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:44:42,840 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:44:42,840 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:44:42,846 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:44:42,859 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:44:42,871 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:44:42,876 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:44:42,879 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:44:42,881 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-01-29 23:44:42,881 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:42,889 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:42,890 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 23:44:42,935 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:42,936 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:42,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-01-29 23:44:42,937 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:42,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:42,941 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-01-29 23:44:42,980 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-01-29 23:44:42,982 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-01-29 23:44:42,982 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:42,983 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:42,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:42,990 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:25 [2018-01-29 23:44:43,059 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:43,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2018-01-29 23:44:43,065 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 1 [2018-01-29 23:44:43,066 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:43,069 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:43,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:43,075 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:28 [2018-01-29 23:44:43,077 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:43,078 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:43,078 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-01-29 23:44:43,078 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:43,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:43,083 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:27 [2018-01-29 23:44:43,129 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:43,132 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 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-01-29 23:44:43,150 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-01-29 23:44:43,151 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:43,156 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:43,164 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:43,164 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:38 [2018-01-29 23:44:43,251 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:43,264 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 79 [2018-01-29 23:44:43,266 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 79 treesize of output 67 [2018-01-29 23:44:43,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:43,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 46 [2018-01-29 23:44:43,296 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-29 23:44:43,309 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 23:44:43,323 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 2 xjuncts. [2018-01-29 23:44:43,323 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:71, output treesize:79 [2018-01-29 23:44:43,368 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 50 treesize of output 44 [2018-01-29 23:44:43,370 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-01-29 23:44:43,370 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:43,374 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:43,403 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 76 [2018-01-29 23:44:43,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 84 [2018-01-29 23:44:43,406 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:43,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 64 [2018-01-29 23:44:43,434 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-01-29 23:44:43,453 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 23:44:43,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-01-29 23:44:43,474 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:129, output treesize:143 [2018-01-29 23:44:43,603 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 1 case distinctions, treesize of input 58 treesize of output 49 [2018-01-29 23:44:43,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 34 [2018-01-29 23:44:43,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:43,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 19 [2018-01-29 23:44:43,617 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:43,628 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 34 treesize of output 25 [2018-01-29 23:44:43,628 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:43,642 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 25 treesize of output 26 [2018-01-29 23:44:43,643 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-01-29 23:44:43,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-01-29 23:44:43,657 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:43,662 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:43,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2018-01-29 23:44:43,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-01-29 23:44:43,673 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:43,677 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-01-29 23:44:43,677 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:43,679 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:43,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:43,685 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 7 variables, input treesize:97, output treesize:5 [2018-01-29 23:44:43,758 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:44:43,778 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:44:43,778 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 35 [2018-01-29 23:44:43,778 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-01-29 23:44:43,778 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-01-29 23:44:43,779 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1082, Unknown=0, NotChecked=0, Total=1190 [2018-01-29 23:44:43,779 INFO L87 Difference]: Start difference. First operand 361 states and 381 transitions. Second operand 35 states. [2018-01-29 23:44:47,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:44:47,328 INFO L93 Difference]: Finished difference Result 698 states and 732 transitions. [2018-01-29 23:44:47,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-01-29 23:44:47,329 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 84 [2018-01-29 23:44:47,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:44:47,330 INFO L225 Difference]: With dead ends: 698 [2018-01-29 23:44:47,331 INFO L226 Difference]: Without dead ends: 629 [2018-01-29 23:44:47,331 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1772 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1062, Invalid=5910, Unknown=0, NotChecked=0, Total=6972 [2018-01-29 23:44:47,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2018-01-29 23:44:47,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 406. [2018-01-29 23:44:47,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2018-01-29 23:44:47,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 428 transitions. [2018-01-29 23:44:47,351 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 428 transitions. Word has length 84 [2018-01-29 23:44:47,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:44:47,351 INFO L432 AbstractCegarLoop]: Abstraction has 406 states and 428 transitions. [2018-01-29 23:44:47,351 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-01-29 23:44:47,351 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 428 transitions. [2018-01-29 23:44:47,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-01-29 23:44:47,352 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:44:47,352 INFO L350 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-29 23:44:47,352 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:44:47,352 INFO L82 PathProgramCache]: Analyzing trace with hash 969605160, now seen corresponding path program 1 times [2018-01-29 23:44:47,352 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:44:47,352 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:44:47,353 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:44:47,353 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:44:47,353 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:44:47,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:44:47,361 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:44:47,752 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:44:47,752 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:44:47,752 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:44:47,758 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:44:47,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:44:47,785 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:44:47,787 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-01-29 23:44:47,788 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:47,790 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:47,790 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 23:44:47,853 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:47,853 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:47,854 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-01-29 23:44:47,854 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:47,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:47,861 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:28 [2018-01-29 23:44:47,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, 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-01-29 23:44:47,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, 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-01-29 23:44:47,904 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:47,905 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:47,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:47,914 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:40 [2018-01-29 23:44:47,992 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:47,995 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 46 treesize of output 47 [2018-01-29 23:44:47,996 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 1 [2018-01-29 23:44:47,997 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:48,001 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:48,008 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-01-29 23:44:48,008 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:40 [2018-01-29 23:44:48,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, 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-01-29 23:44:48,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 16 treesize of output 15 [2018-01-29 23:44:48,034 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:48,038 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:48,046 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-01-29 23:44:48,046 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:62, output treesize:52 [2018-01-29 23:44:48,126 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 46 treesize of output 39 [2018-01-29 23:44:48,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 7 treesize of output 1 [2018-01-29 23:44:48,127 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:48,135 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 25 treesize of output 22 [2018-01-29 23:44:48,136 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-29 23:44:48,143 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-29 23:44:48,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-29 23:44:48,154 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:61, output treesize:48 [2018-01-29 23:44:48,397 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:48,398 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-01-29 23:44:48,398 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:48,402 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-01-29 23:44:48,403 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:15 [2018-01-29 23:44:48,481 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-29 23:44:48,501 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:44:48,501 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2018-01-29 23:44:48,501 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-29 23:44:48,501 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-29 23:44:48,501 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=954, Unknown=0, NotChecked=0, Total=1056 [2018-01-29 23:44:48,502 INFO L87 Difference]: Start difference. First operand 406 states and 428 transitions. Second operand 33 states. [2018-01-29 23:44:50,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:44:50,050 INFO L93 Difference]: Finished difference Result 481 states and 505 transitions. [2018-01-29 23:44:50,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-29 23:44:50,050 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 86 [2018-01-29 23:44:50,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:44:50,051 INFO L225 Difference]: With dead ends: 481 [2018-01-29 23:44:50,051 INFO L226 Difference]: Without dead ends: 480 [2018-01-29 23:44:50,052 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 68 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=465, Invalid=2397, Unknown=0, NotChecked=0, Total=2862 [2018-01-29 23:44:50,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2018-01-29 23:44:50,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 425. [2018-01-29 23:44:50,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-01-29 23:44:50,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 448 transitions. [2018-01-29 23:44:50,075 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 448 transitions. Word has length 86 [2018-01-29 23:44:50,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:44:50,075 INFO L432 AbstractCegarLoop]: Abstraction has 425 states and 448 transitions. [2018-01-29 23:44:50,075 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-29 23:44:50,075 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 448 transitions. [2018-01-29 23:44:50,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-01-29 23:44:50,076 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:44:50,076 INFO L350 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-29 23:44:50,076 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:44:50,076 INFO L82 PathProgramCache]: Analyzing trace with hash 969605161, now seen corresponding path program 1 times [2018-01-29 23:44:50,077 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:44:50,077 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:44:50,077 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:44:50,077 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:44:50,077 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:44:50,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:44:50,086 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:44:50,620 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:44:50,620 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:44:50,620 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:44:50,625 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:44:50,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:44:50,649 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:44:50,651 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-01-29 23:44:50,651 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:50,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:50,653 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 23:44:50,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 6 treesize of output 5 [2018-01-29 23:44:50,720 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:50,729 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:50,729 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:50,730 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-01-29 23:44:50,730 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:50,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:50,736 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-01-29 23:44:50,779 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-01-29 23:44:50,780 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-01-29 23:44:50,780 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:50,782 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:50,791 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-01-29 23:44:50,792 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-01-29 23:44:50,792 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:50,793 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:50,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:50,801 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:40 [2018-01-29 23:44:50,876 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:50,879 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 25 treesize of output 32 [2018-01-29 23:44:50,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-01-29 23:44:50,880 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:50,883 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:50,893 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:50,896 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 46 treesize of output 47 [2018-01-29 23:44:50,897 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 1 [2018-01-29 23:44:50,897 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:50,901 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:50,908 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-01-29 23:44:50,908 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:76, output treesize:46 [2018-01-29 23:44:50,935 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 35 treesize of output 36 [2018-01-29 23:44:50,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, 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-01-29 23:44:50,936 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:50,940 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:50,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 56 [2018-01-29 23:44:50,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 16 treesize of output 15 [2018-01-29 23:44:50,954 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:50,959 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:50,968 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-01-29 23:44:50,968 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:87, output treesize:67 [2018-01-29 23:44:51,043 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 61 treesize of output 52 [2018-01-29 23:44:51,044 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-01-29 23:44:51,045 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:51,054 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 38 treesize of output 31 [2018-01-29 23:44:51,055 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-29 23:44:51,065 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-29 23:44:51,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-01-29 23:44:51,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 7 treesize of output 1 [2018-01-29 23:44:51,083 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:51,090 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:51,091 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 15 treesize of output 8 [2018-01-29 23:44:51,091 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:51,094 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:51,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2018-01-29 23:44:51,097 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-01-29 23:44:51,098 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:51,106 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 1 case distinctions, treesize of input 15 treesize of output 12 [2018-01-29 23:44:51,106 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-01-29 23:44:51,111 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 23:44:51,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-01-29 23:44:51,127 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:85, output treesize:40 [2018-01-29 23:44:51,282 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-29 23:44:51,301 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:44:51,301 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 31 [2018-01-29 23:44:51,302 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-01-29 23:44:51,302 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-01-29 23:44:51,302 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2018-01-29 23:44:51,302 INFO L87 Difference]: Start difference. First operand 425 states and 448 transitions. Second operand 32 states. [2018-01-29 23:44:52,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:44:52,870 INFO L93 Difference]: Finished difference Result 502 states and 526 transitions. [2018-01-29 23:44:52,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-29 23:44:52,870 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 86 [2018-01-29 23:44:52,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:44:52,872 INFO L225 Difference]: With dead ends: 502 [2018-01-29 23:44:52,873 INFO L226 Difference]: Without dead ends: 498 [2018-01-29 23:44:52,873 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 69 SyntacticMatches, 5 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=399, Invalid=2253, Unknown=0, NotChecked=0, Total=2652 [2018-01-29 23:44:52,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2018-01-29 23:44:52,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 423. [2018-01-29 23:44:52,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2018-01-29 23:44:52,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 445 transitions. [2018-01-29 23:44:52,898 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 445 transitions. Word has length 86 [2018-01-29 23:44:52,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:44:52,898 INFO L432 AbstractCegarLoop]: Abstraction has 423 states and 445 transitions. [2018-01-29 23:44:52,898 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-01-29 23:44:52,898 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 445 transitions. [2018-01-29 23:44:52,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-01-29 23:44:52,899 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:44:52,899 INFO L350 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-29 23:44:52,899 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:44:52,899 INFO L82 PathProgramCache]: Analyzing trace with hash 169666212, now seen corresponding path program 1 times [2018-01-29 23:44:52,899 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:44:52,900 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:44:52,900 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:44:52,900 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:44:52,900 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:44:52,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:44:52,908 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:44:53,231 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:44:53,232 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:44:53,232 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:44:53,236 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:44:53,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:44:53,261 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:44:53,264 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-01-29 23:44:53,264 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:53,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:53,267 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 23:44:53,355 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:53,356 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:53,356 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-01-29 23:44:53,357 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:53,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:53,364 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:28 [2018-01-29 23:44:53,405 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-01-29 23:44:53,407 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-01-29 23:44:53,407 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:53,408 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:53,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:53,416 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:40 [2018-01-29 23:44:53,486 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:53,489 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 46 treesize of output 47 [2018-01-29 23:44:53,490 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 1 [2018-01-29 23:44:53,490 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:53,494 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:53,502 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-01-29 23:44:53,502 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:46 [2018-01-29 23:44:53,526 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-01-29 23:44:53,527 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-01-29 23:44:53,527 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:53,531 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:53,539 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-01-29 23:44:53,539 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:62, output treesize:52 [2018-01-29 23:44:53,617 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 46 treesize of output 39 [2018-01-29 23:44:53,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-01-29 23:44:53,619 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:53,631 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 25 treesize of output 22 [2018-01-29 23:44:53,632 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-29 23:44:53,640 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-29 23:44:53,652 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-29 23:44:53,652 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:61, output treesize:48 [2018-01-29 23:44:53,757 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:53,758 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-01-29 23:44:53,758 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:53,762 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-01-29 23:44:53,763 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:15 [2018-01-29 23:44:53,838 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-29 23:44:53,858 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:44:53,858 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 34 [2018-01-29 23:44:53,858 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-01-29 23:44:53,859 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-01-29 23:44:53,859 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1075, Unknown=0, NotChecked=0, Total=1190 [2018-01-29 23:44:53,859 INFO L87 Difference]: Start difference. First operand 423 states and 445 transitions. Second operand 35 states. [2018-01-29 23:44:55,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:44:55,471 INFO L93 Difference]: Finished difference Result 495 states and 520 transitions. [2018-01-29 23:44:55,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-01-29 23:44:55,471 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 86 [2018-01-29 23:44:55,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:44:55,473 INFO L225 Difference]: With dead ends: 495 [2018-01-29 23:44:55,473 INFO L226 Difference]: Without dead ends: 494 [2018-01-29 23:44:55,473 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 929 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=594, Invalid=2946, Unknown=0, NotChecked=0, Total=3540 [2018-01-29 23:44:55,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2018-01-29 23:44:55,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 431. [2018-01-29 23:44:55,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2018-01-29 23:44:55,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 454 transitions. [2018-01-29 23:44:55,498 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 454 transitions. Word has length 86 [2018-01-29 23:44:55,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:44:55,498 INFO L432 AbstractCegarLoop]: Abstraction has 431 states and 454 transitions. [2018-01-29 23:44:55,498 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-01-29 23:44:55,498 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 454 transitions. [2018-01-29 23:44:55,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-01-29 23:44:55,499 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:44:55,499 INFO L350 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-29 23:44:55,499 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:44:55,499 INFO L82 PathProgramCache]: Analyzing trace with hash 169666213, now seen corresponding path program 1 times [2018-01-29 23:44:55,499 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:44:55,499 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:44:55,500 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:44:55,500 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:44:55,500 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:44:55,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:44:55,507 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:44:55,909 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:44:55,910 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:44:55,910 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:44:55,915 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:44:55,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:44:55,940 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:44:55,942 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-01-29 23:44:55,942 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:55,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:55,945 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 23:44:55,996 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-01-29 23:44:55,996 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:56,003 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:56,004 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:56,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-01-29 23:44:56,004 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:56,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:56,010 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-01-29 23:44:56,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-01-29 23:44:56,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-29 23:44:56,048 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:56,050 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:56,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 23:44:56,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-29 23:44:56,062 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:56,064 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:56,072 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:56,072 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:40 [2018-01-29 23:44:56,133 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:56,136 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 46 treesize of output 47 [2018-01-29 23:44:56,138 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 1 [2018-01-29 23:44:56,138 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:56,143 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:56,153 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:56,155 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 25 treesize of output 32 [2018-01-29 23:44:56,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 18 treesize of output 17 [2018-01-29 23:44:56,157 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:56,160 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:56,166 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-01-29 23:44:56,166 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:76, output treesize:46 [2018-01-29 23:44:56,189 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 72 treesize of output 66 [2018-01-29 23:44:56,190 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-01-29 23:44:56,190 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:56,196 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:56,208 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 35 treesize of output 36 [2018-01-29 23:44:56,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 16 treesize of output 15 [2018-01-29 23:44:56,210 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:56,214 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:56,222 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-01-29 23:44:56,222 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:87, output treesize:67 [2018-01-29 23:44:56,299 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 61 treesize of output 52 [2018-01-29 23:44:56,301 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-01-29 23:44:56,301 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:56,313 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 38 treesize of output 31 [2018-01-29 23:44:56,313 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-29 23:44:56,324 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-29 23:44:56,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2018-01-29 23:44:56,342 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-01-29 23:44:56,342 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:56,351 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 1 case distinctions, treesize of input 15 treesize of output 12 [2018-01-29 23:44:56,351 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-01-29 23:44:56,356 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 23:44:56,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-01-29 23:44:56,359 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:56,360 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 15 treesize of output 8 [2018-01-29 23:44:56,360 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:56,366 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-01-29 23:44:56,366 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:56,369 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:56,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-01-29 23:44:56,385 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:85, output treesize:40 [2018-01-29 23:44:56,513 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-29 23:44:56,533 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:44:56,533 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 32 [2018-01-29 23:44:56,533 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-29 23:44:56,534 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-29 23:44:56,534 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=953, Unknown=0, NotChecked=0, Total=1056 [2018-01-29 23:44:56,534 INFO L87 Difference]: Start difference. First operand 431 states and 454 transitions. Second operand 33 states. [2018-01-29 23:44:58,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:44:58,202 INFO L93 Difference]: Finished difference Result 516 states and 541 transitions. [2018-01-29 23:44:58,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-29 23:44:58,202 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 86 [2018-01-29 23:44:58,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:44:58,203 INFO L225 Difference]: With dead ends: 516 [2018-01-29 23:44:58,204 INFO L226 Difference]: Without dead ends: 512 [2018-01-29 23:44:58,204 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 69 SyntacticMatches, 5 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 871 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=489, Invalid=2591, Unknown=0, NotChecked=0, Total=3080 [2018-01-29 23:44:58,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2018-01-29 23:44:58,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 412. [2018-01-29 23:44:58,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2018-01-29 23:44:58,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 434 transitions. [2018-01-29 23:44:58,227 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 434 transitions. Word has length 86 [2018-01-29 23:44:58,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:44:58,227 INFO L432 AbstractCegarLoop]: Abstraction has 412 states and 434 transitions. [2018-01-29 23:44:58,227 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-29 23:44:58,227 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 434 transitions. [2018-01-29 23:44:58,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-01-29 23:44:58,228 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:44:58,228 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:44:58,228 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:44:58,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1458800569, now seen corresponding path program 2 times [2018-01-29 23:44:58,228 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:44:58,228 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:44:58,229 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:44:58,229 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:44:58,229 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:44:58,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:44:58,241 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:44:58,501 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-29 23:44:58,501 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:44:58,501 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:44:58,506 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:44:58,517 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:44:58,528 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:44:58,531 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:44:58,535 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:44:58,536 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-01-29 23:44:58,537 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:58,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:58,539 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 23:44:58,584 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:58,584 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:58,585 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-01-29 23:44:58,585 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:58,588 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:58,589 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-01-29 23:44:58,624 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-01-29 23:44:58,626 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-01-29 23:44:58,626 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:58,628 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:58,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:58,635 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:25 [2018-01-29 23:44:58,703 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:58,706 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 35 treesize of output 36 [2018-01-29 23:44:58,707 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 1 [2018-01-29 23:44:58,707 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:58,710 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:58,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:58,715 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:28 [2018-01-29 23:44:58,717 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:58,717 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:58,718 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-01-29 23:44:58,718 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:58,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:58,722 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:27 [2018-01-29 23:44:58,765 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:58,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 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-01-29 23:44:58,769 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-01-29 23:44:58,769 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:58,774 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:58,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:58,781 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:38 [2018-01-29 23:44:58,874 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:44:58,887 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 79 [2018-01-29 23:44:58,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 50 [2018-01-29 23:44:58,896 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 23:44:58,927 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 65 treesize of output 53 [2018-01-29 23:44:58,927 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:58,941 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 23:44:58,956 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 2 xjuncts. [2018-01-29 23:44:58,956 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:71, output treesize:91 [2018-01-29 23:44:59,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2018-01-29 23:44:59,005 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-01-29 23:44:59,005 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:59,011 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:59,041 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 76 [2018-01-29 23:44:59,043 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 85 treesize of output 84 [2018-01-29 23:44:59,044 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:59,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 69 [2018-01-29 23:44:59,073 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-01-29 23:44:59,091 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 23:44:59,113 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-01-29 23:44:59,113 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:129, output treesize:143 [2018-01-29 23:44:59,326 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 1 case distinctions, treesize of input 74 treesize of output 61 [2018-01-29 23:44:59,328 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 54 treesize of output 47 [2018-01-29 23:44:59,329 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:59,354 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 46 treesize of output 47 [2018-01-29 23:44:59,355 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-29 23:44:59,382 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 35 treesize of output 20 [2018-01-29 23:44:59,383 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:59,384 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 39 treesize of output 24 [2018-01-29 23:44:59,384 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:59,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 39 [2018-01-29 23:44:59,407 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:59,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 16 [2018-01-29 23:44:59,427 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:59,437 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:59,451 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 38 [2018-01-29 23:44:59,453 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-01-29 23:44:59,453 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:59,459 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-01-29 23:44:59,459 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-29 23:44:59,463 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:59,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:44:59,473 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 9 variables, input treesize:127, output treesize:5 [2018-01-29 23:44:59,550 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:44:59,570 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:44:59,571 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 38 [2018-01-29 23:44:59,571 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-01-29 23:44:59,571 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-01-29 23:44:59,571 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1283, Unknown=0, NotChecked=0, Total=1406 [2018-01-29 23:44:59,571 INFO L87 Difference]: Start difference. First operand 412 states and 434 transitions. Second operand 38 states. [2018-01-29 23:45:03,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:45:03,513 INFO L93 Difference]: Finished difference Result 746 states and 783 transitions. [2018-01-29 23:45:03,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-01-29 23:45:03,549 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 88 [2018-01-29 23:45:03,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:45:03,551 INFO L225 Difference]: With dead ends: 746 [2018-01-29 23:45:03,551 INFO L226 Difference]: Without dead ends: 687 [2018-01-29 23:45:03,552 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1842 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1224, Invalid=6608, Unknown=0, NotChecked=0, Total=7832 [2018-01-29 23:45:03,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2018-01-29 23:45:03,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 432. [2018-01-29 23:45:03,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2018-01-29 23:45:03,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 454 transitions. [2018-01-29 23:45:03,580 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 454 transitions. Word has length 88 [2018-01-29 23:45:03,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:45:03,580 INFO L432 AbstractCegarLoop]: Abstraction has 432 states and 454 transitions. [2018-01-29 23:45:03,580 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-01-29 23:45:03,580 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 454 transitions. [2018-01-29 23:45:03,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-01-29 23:45:03,581 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:45:03,581 INFO L350 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 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-01-29 23:45:03,581 INFO L371 AbstractCegarLoop]: === Iteration 41 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:45:03,581 INFO L82 PathProgramCache]: Analyzing trace with hash -2137051427, now seen corresponding path program 1 times [2018-01-29 23:45:03,581 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:45:03,581 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:45:03,582 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:45:03,582 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:45:03,582 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:45:03,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:45:03,593 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:45:03,839 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-29 23:45:03,839 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:45:03,839 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:45:03,845 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:45:03,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:45:03,869 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:45:03,871 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-01-29 23:45:03,871 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:03,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:03,873 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 23:45:03,922 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-01-29 23:45:03,923 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-01-29 23:45:03,923 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:03,924 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:03,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:03,931 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-01-29 23:45:03,954 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:45:03,954 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:45:03,955 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-01-29 23:45:03,955 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:03,961 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:03,961 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:24 [2018-01-29 23:45:04,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2018-01-29 23:45:04,005 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:45:04,006 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 22 treesize of output 29 [2018-01-29 23:45:04,006 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:04,010 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:04,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 23:45:04,022 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-01-29 23:45:04,022 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:04,023 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:04,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:04,032 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:61, output treesize:35 [2018-01-29 23:45:04,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-01-29 23:45:04,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-01-29 23:45:04,060 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:04,061 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:04,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:04,067 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:23 [2018-01-29 23:45:04,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-01-29 23:45:04,114 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-01-29 23:45:04,114 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:04,118 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:04,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:04,125 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2018-01-29 23:45:04,150 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:45:04,151 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:45:04,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-29 23:45:04,151 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:04,157 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:04,158 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:29 [2018-01-29 23:45:04,205 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-01-29 23:45:04,207 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-01-29 23:45:04,207 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:04,209 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:04,223 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 34 treesize of output 33 [2018-01-29 23:45:04,225 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:45:04,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-01-29 23:45:04,226 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:04,230 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:04,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:04,237 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:61, output treesize:35 [2018-01-29 23:45:04,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-01-29 23:45:04,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-01-29 23:45:04,264 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:04,265 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:04,271 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-01-29 23:45:04,272 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:29 [2018-01-29 23:45:04,339 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 46 [2018-01-29 23:45:04,342 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:45:04,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 37 [2018-01-29 23:45:04,347 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 23:45:04,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-01-29 23:45:04,374 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:04,386 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 23:45:04,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-29 23:45:04,402 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:40, output treesize:62 [2018-01-29 23:45:04,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-01-29 23:45:04,449 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:45:04,450 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 22 treesize of output 14 [2018-01-29 23:45:04,450 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:04,454 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:04,460 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-01-29 23:45:04,460 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:25 [2018-01-29 23:45:04,518 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 22 treesize of output 20 [2018-01-29 23:45:04,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-29 23:45:04,520 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:04,525 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-01-29 23:45:04,525 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:04,526 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:04,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:04,530 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2018-01-29 23:45:04,568 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:45:04,589 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:45:04,589 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 38 [2018-01-29 23:45:04,589 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-01-29 23:45:04,590 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-01-29 23:45:04,590 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1241, Unknown=0, NotChecked=0, Total=1406 [2018-01-29 23:45:04,590 INFO L87 Difference]: Start difference. First operand 432 states and 454 transitions. Second operand 38 states. [2018-01-29 23:45:06,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:45:06,277 INFO L93 Difference]: Finished difference Result 713 states and 750 transitions. [2018-01-29 23:45:06,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-01-29 23:45:06,277 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 88 [2018-01-29 23:45:06,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:45:06,279 INFO L225 Difference]: With dead ends: 713 [2018-01-29 23:45:06,279 INFO L226 Difference]: Without dead ends: 654 [2018-01-29 23:45:06,280 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1214 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=689, Invalid=4003, Unknown=0, NotChecked=0, Total=4692 [2018-01-29 23:45:06,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2018-01-29 23:45:06,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 457. [2018-01-29 23:45:06,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2018-01-29 23:45:06,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 480 transitions. [2018-01-29 23:45:06,306 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 480 transitions. Word has length 88 [2018-01-29 23:45:06,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:45:06,306 INFO L432 AbstractCegarLoop]: Abstraction has 457 states and 480 transitions. [2018-01-29 23:45:06,306 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-01-29 23:45:06,306 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 480 transitions. [2018-01-29 23:45:06,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-01-29 23:45:06,307 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:45:06,307 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:45:06,307 INFO L371 AbstractCegarLoop]: === Iteration 42 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:45:06,307 INFO L82 PathProgramCache]: Analyzing trace with hash 246304057, now seen corresponding path program 3 times [2018-01-29 23:45:06,307 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:45:06,307 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:45:06,308 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:45:06,308 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:45:06,308 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:45:06,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:45:06,315 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:45:06,569 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:45:06,569 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:45:06,569 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:45:06,575 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 23:45:06,586 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:45:06,594 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:45:06,606 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:45:06,608 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:45:06,611 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:45:06,613 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-01-29 23:45:06,613 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:06,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:06,615 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 23:45:06,652 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:45:06,653 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:45:06,653 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-01-29 23:45:06,653 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:06,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:06,657 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-01-29 23:45:06,688 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-01-29 23:45:06,689 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-01-29 23:45:06,689 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:06,690 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:06,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:06,695 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2018-01-29 23:45:06,744 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:45:06,747 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 35 treesize of output 36 [2018-01-29 23:45:06,748 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 1 [2018-01-29 23:45:06,748 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:06,752 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:06,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:06,756 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:23 [2018-01-29 23:45:06,795 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:45:06,798 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-01-29 23:45:06,799 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-01-29 23:45:06,800 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:06,805 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:06,814 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 16 [2018-01-29 23:45:06,815 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-01-29 23:45:06,815 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:06,816 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:06,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:06,823 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:54, output treesize:43 [2018-01-29 23:45:06,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2018-01-29 23:45:06,849 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-01-29 23:45:06,849 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:06,850 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:06,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:06,854 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:28 [2018-01-29 23:45:06,912 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-01-29 23:45:06,914 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-01-29 23:45:06,914 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:06,916 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:06,935 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 37 treesize of output 47 [2018-01-29 23:45:06,937 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 38 treesize of output 26 [2018-01-29 23:45:06,937 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:06,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 28 [2018-01-29 23:45:06,959 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-29 23:45:06,969 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-29 23:45:06,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-29 23:45:06,981 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:57, output treesize:67 [2018-01-29 23:45:07,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 51 [2018-01-29 23:45:07,040 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:45:07,041 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 24 treesize of output 18 [2018-01-29 23:45:07,041 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:07,048 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:07,084 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 58 treesize of output 68 [2018-01-29 23:45:07,087 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 59 treesize of output 58 [2018-01-29 23:45:07,087 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:07,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 60 [2018-01-29 23:45:07,121 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-29 23:45:07,145 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-29 23:45:07,180 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 47 treesize of output 42 [2018-01-29 23:45:07,182 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 19 [2018-01-29 23:45:07,182 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:07,189 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:07,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 54 treesize of output 49 [2018-01-29 23:45:07,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 18 treesize of output 7 [2018-01-29 23:45:07,194 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:07,200 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:07,224 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 37 treesize of output 34 [2018-01-29 23:45:07,225 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-01-29 23:45:07,225 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:07,231 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:07,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-01-29 23:45:07,262 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:115, output treesize:102 [2018-01-29 23:45:07,550 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-01-29 23:45:07,552 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 11 treesize of output 7 [2018-01-29 23:45:07,552 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:07,562 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:07,590 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 52 treesize of output 56 [2018-01-29 23:45:07,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 42 [2018-01-29 23:45:07,592 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:07,619 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:45:07,619 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 48 treesize of output 44 [2018-01-29 23:45:07,620 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:07,643 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 23:45:07,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-01-29 23:45:07,674 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:90, output treesize:107 [2018-01-29 23:45:07,836 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2018-01-29 23:45:07,838 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-01-29 23:45:07,838 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:07,842 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:07,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:07,848 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:5 [2018-01-29 23:45:07,876 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:45:07,897 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:45:07,897 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 24] total 41 [2018-01-29 23:45:07,897 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-01-29 23:45:07,897 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-01-29 23:45:07,898 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1590, Unknown=0, NotChecked=0, Total=1722 [2018-01-29 23:45:07,898 INFO L87 Difference]: Start difference. First operand 457 states and 480 transitions. Second operand 42 states. [2018-01-29 23:45:11,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:45:11,826 INFO L93 Difference]: Finished difference Result 650 states and 681 transitions. [2018-01-29 23:45:11,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-01-29 23:45:11,826 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 88 [2018-01-29 23:45:11,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:45:11,828 INFO L225 Difference]: With dead ends: 650 [2018-01-29 23:45:11,828 INFO L226 Difference]: Without dead ends: 649 [2018-01-29 23:45:11,829 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2179 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1117, Invalid=7073, Unknown=0, NotChecked=0, Total=8190 [2018-01-29 23:45:11,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2018-01-29 23:45:11,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 481. [2018-01-29 23:45:11,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2018-01-29 23:45:11,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 506 transitions. [2018-01-29 23:45:11,857 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 506 transitions. Word has length 88 [2018-01-29 23:45:11,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:45:11,857 INFO L432 AbstractCegarLoop]: Abstraction has 481 states and 506 transitions. [2018-01-29 23:45:11,857 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-01-29 23:45:11,858 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 506 transitions. [2018-01-29 23:45:11,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-01-29 23:45:11,858 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:45:11,858 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:45:11,858 INFO L371 AbstractCegarLoop]: === Iteration 43 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:45:11,858 INFO L82 PathProgramCache]: Analyzing trace with hash 246304058, now seen corresponding path program 2 times [2018-01-29 23:45:11,859 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:45:11,859 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:45:11,859 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:45:11,859 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:45:11,860 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:45:11,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:45:11,870 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:45:12,348 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:45:12,348 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:45:12,349 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:45:12,353 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:45:12,364 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:45:12,374 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:45:12,379 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:45:12,382 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:45:12,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 23:45:12,384 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:12,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:12,386 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 23:45:12,428 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:45:12,430 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:45:12,430 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-01-29 23:45:12,430 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:12,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:12,439 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-01-29 23:45:12,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 23:45:12,477 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-01-29 23:45:12,478 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:12,479 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:12,490 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-01-29 23:45:12,492 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-01-29 23:45:12,492 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:12,493 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:12,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:12,502 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:34 [2018-01-29 23:45:12,575 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:45:12,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 35 treesize of output 36 [2018-01-29 23:45:12,580 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 1 [2018-01-29 23:45:12,581 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:12,585 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:12,595 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:45:12,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 25 treesize of output 32 [2018-01-29 23:45:12,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-01-29 23:45:12,599 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:12,602 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:12,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:12,609 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:67, output treesize:37 [2018-01-29 23:45:12,611 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:45:12,612 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:45:12,612 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-01-29 23:45:12,612 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:12,619 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:12,619 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:36 [2018-01-29 23:45:12,665 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:45:12,668 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 33 treesize of output 34 [2018-01-29 23:45:12,670 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-01-29 23:45:12,671 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:12,676 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:12,692 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:45:12,695 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 23 treesize of output 30 [2018-01-29 23:45:12,697 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-01-29 23:45:12,698 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:12,702 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:12,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:12,715 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:74, output treesize:54 [2018-01-29 23:45:12,825 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:45:12,841 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 81 [2018-01-29 23:45:12,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 81 treesize of output 69 [2018-01-29 23:45:12,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:12,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 48 [2018-01-29 23:45:12,881 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-29 23:45:12,899 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 23:45:12,923 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:45:12,926 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 25 treesize of output 26 [2018-01-29 23:45:12,929 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 1 [2018-01-29 23:45:12,929 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:12,932 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:12,949 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 2 xjuncts. [2018-01-29 23:45:12,950 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:102, output treesize:121 [2018-01-29 23:45:13,031 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 131 treesize of output 113 [2018-01-29 23:45:13,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 105 [2018-01-29 23:45:13,041 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 23:45:13,098 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 115 [2018-01-29 23:45:13,099 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:13,135 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 23:45:13,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 79 [2018-01-29 23:45:13,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-01-29 23:45:13,208 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:13,221 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:13,226 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 115 treesize of output 100 [2018-01-29 23:45:13,230 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-01-29 23:45:13,230 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:13,243 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:13,301 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 89 treesize of output 83 [2018-01-29 23:45:13,303 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-01-29 23:45:13,303 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:13,314 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:13,363 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 79 treesize of output 70 [2018-01-29 23:45:13,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 16 treesize of output 15 [2018-01-29 23:45:13,366 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:13,376 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:13,418 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-01-29 23:45:13,418 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 7 variables, input treesize:221, output treesize:240 [2018-01-29 23:45:13,620 WARN L143 SmtUtils]: Spent 152ms on a formula simplification that was a NOOP. DAG size: 63 [2018-01-29 23:45:13,851 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 1 case distinctions, treesize of input 120 treesize of output 99 [2018-01-29 23:45:13,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 69 [2018-01-29 23:45:13,872 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:13,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 80 [2018-01-29 23:45:13,906 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:45:13,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 73 [2018-01-29 23:45:13,940 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:13,972 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 73 treesize of output 58 [2018-01-29 23:45:13,972 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:14,008 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 69 treesize of output 66 [2018-01-29 23:45:14,009 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-29 23:45:14,050 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-29 23:45:14,131 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-01-29 23:45:14,133 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-01-29 23:45:14,133 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:14,143 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-01-29 23:45:14,143 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:14,150 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:14,152 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 62 treesize of output 56 [2018-01-29 23:45:14,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 7 treesize of output 1 [2018-01-29 23:45:14,154 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:14,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-01-29 23:45:14,165 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:14,173 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:14,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 52 [2018-01-29 23:45:14,177 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-01-29 23:45:14,177 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:14,187 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-01-29 23:45:14,188 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:14,195 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:14,262 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 90 treesize of output 74 [2018-01-29 23:45:14,264 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-01-29 23:45:14,264 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:14,275 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 40 treesize of output 21 [2018-01-29 23:45:14,276 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:14,285 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:14,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 42 [2018-01-29 23:45:14,346 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-01-29 23:45:14,346 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:14,354 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-01-29 23:45:14,354 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:14,360 INFO L267 ElimStorePlain]: Start of recursive call 20: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:14,415 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 76 [2018-01-29 23:45:14,417 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-01-29 23:45:14,417 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:14,429 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 40 treesize of output 21 [2018-01-29 23:45:14,429 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:14,438 INFO L267 ElimStorePlain]: Start of recursive call 23: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:14,488 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 50 treesize of output 44 [2018-01-29 23:45:14,490 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-01-29 23:45:14,490 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:14,498 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-01-29 23:45:14,498 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:14,504 INFO L267 ElimStorePlain]: Start of recursive call 26: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:14,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:14,548 INFO L202 ElimStorePlain]: Needed 28 recursive calls to eliminate 16 variables, input treesize:303, output treesize:9 [2018-01-29 23:45:14,641 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:45:14,661 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:45:14,661 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 39 [2018-01-29 23:45:14,662 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-01-29 23:45:14,662 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-01-29 23:45:14,662 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1426, Unknown=0, NotChecked=0, Total=1560 [2018-01-29 23:45:14,662 INFO L87 Difference]: Start difference. First operand 481 states and 506 transitions. Second operand 40 states. [2018-01-29 23:45:16,083 WARN L146 SmtUtils]: Spent 150ms on a formula simplification. DAG size of input: 127 DAG size of output 81 [2018-01-29 23:45:16,984 WARN L146 SmtUtils]: Spent 778ms on a formula simplification. DAG size of input: 129 DAG size of output 83 [2018-01-29 23:45:17,631 WARN L146 SmtUtils]: Spent 172ms on a formula simplification. DAG size of input: 134 DAG size of output 88 [2018-01-29 23:45:18,430 WARN L146 SmtUtils]: Spent 137ms on a formula simplification. DAG size of input: 139 DAG size of output 83 [2018-01-29 23:45:19,544 WARN L146 SmtUtils]: Spent 1018ms on a formula simplification. DAG size of input: 141 DAG size of output 85 [2018-01-29 23:45:20,273 WARN L146 SmtUtils]: Spent 173ms on a formula simplification. DAG size of input: 146 DAG size of output 90 [2018-01-29 23:45:21,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:45:21,208 INFO L93 Difference]: Finished difference Result 652 states and 684 transitions. [2018-01-29 23:45:21,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-01-29 23:45:21,208 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 88 [2018-01-29 23:45:21,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:45:21,210 INFO L225 Difference]: With dead ends: 652 [2018-01-29 23:45:21,210 INFO L226 Difference]: Without dead ends: 649 [2018-01-29 23:45:21,211 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1296 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=761, Invalid=4641, Unknown=0, NotChecked=0, Total=5402 [2018-01-29 23:45:21,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2018-01-29 23:45:21,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 481. [2018-01-29 23:45:21,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2018-01-29 23:45:21,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 506 transitions. [2018-01-29 23:45:21,241 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 506 transitions. Word has length 88 [2018-01-29 23:45:21,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:45:21,241 INFO L432 AbstractCegarLoop]: Abstraction has 481 states and 506 transitions. [2018-01-29 23:45:21,241 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-01-29 23:45:21,241 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 506 transitions. [2018-01-29 23:45:21,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-01-29 23:45:21,242 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:45:21,242 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-29 23:45:21,242 INFO L371 AbstractCegarLoop]: === Iteration 44 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:45:21,243 INFO L82 PathProgramCache]: Analyzing trace with hash 2058069805, now seen corresponding path program 1 times [2018-01-29 23:45:21,243 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:45:21,243 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:45:21,243 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:45:21,243 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:45:21,243 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:45:21,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:45:21,258 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:45:22,072 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:45:22,072 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:45:22,072 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:45:22,077 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:45:22,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:45:22,107 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:45:22,227 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-01-29 23:45:22,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-29 23:45:22,228 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:22,230 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:22,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:22,240 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:48 [2018-01-29 23:45:22,325 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:45:22,328 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 54 treesize of output 55 [2018-01-29 23:45:22,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 12 treesize of output 1 [2018-01-29 23:45:22,329 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:22,334 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:22,342 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-01-29 23:45:22,342 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:54 [2018-01-29 23:45:22,367 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:45:22,370 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-01-29 23:45:22,371 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-01-29 23:45:22,371 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:22,377 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:22,385 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-01-29 23:45:22,385 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:70, output treesize:60 [2018-01-29 23:45:22,599 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:45:22,600 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 88 treesize of output 89 [2018-01-29 23:45:22,602 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-01-29 23:45:22,602 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:22,620 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 30 [2018-01-29 23:45:22,620 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-29 23:45:22,639 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-29 23:45:22,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 56 [2018-01-29 23:45:22,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-01-29 23:45:22,691 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:22,700 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:22,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2018-01-29 23:45:22,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-01-29 23:45:22,703 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:22,711 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:22,758 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:45:22,759 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 88 treesize of output 87 [2018-01-29 23:45:22,761 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-01-29 23:45:22,761 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:22,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 34 [2018-01-29 23:45:22,780 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-29 23:45:22,801 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-29 23:45:22,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2018-01-29 23:45:22,861 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-01-29 23:45:22,861 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:22,869 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:22,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2018-01-29 23:45:22,872 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-01-29 23:45:22,872 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:22,882 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:22,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-01-29 23:45:22,933 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 8 variables, input treesize:177, output treesize:143 [2018-01-29 23:45:23,159 WARN L1033 $PredicateComparison]: unable to prove that (or (and (not (= c_main_~t~7.base 0)) (exists ((v_prenex_131 Int)) (let ((.cse0 (store |c_old(#valid)| v_prenex_131 1))) (and (not (= 0 v_prenex_131)) (= 0 (select .cse0 c_main_~t~7.base)) (= (select |c_old(#valid)| v_prenex_131) 0) (= |c_#valid| (store (store .cse0 c_main_~t~7.base 1) v_prenex_131 0)))))) (and (not (= c_main_~t~7.offset 0)) (exists ((main_~p~7.base Int)) (let ((.cse1 (store |c_old(#valid)| main_~p~7.base 1))) (and (= (select |c_old(#valid)| main_~p~7.base) 0) (= 0 (select .cse1 c_main_~t~7.base)) (= |c_#valid| (store (store .cse1 c_main_~t~7.base 1) main_~p~7.base 0)) (not (= 0 main_~p~7.base))))))) is different from true [2018-01-29 23:45:23,228 WARN L1033 $PredicateComparison]: unable to prove that (exists ((v_prenex_131 Int) (main_~p~7.base Int)) (let ((.cse0 (store |c_old(#valid)| v_prenex_131 1))) (and (= 0 (select .cse0 main_~p~7.base)) (= |c_#valid| (store (store (store .cse0 main_~p~7.base 1) v_prenex_131 0) main_~p~7.base 0)) (not (= 0 v_prenex_131)) (not (= 0 main_~p~7.base)) (= (select |c_old(#valid)| v_prenex_131) 0)))) is different from true [2018-01-29 23:45:23,282 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-29 23:45:23,301 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:45:23,302 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 40 [2018-01-29 23:45:23,302 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-01-29 23:45:23,302 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-01-29 23:45:23,302 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1341, Unknown=25, NotChecked=150, Total=1640 [2018-01-29 23:45:23,303 INFO L87 Difference]: Start difference. First operand 481 states and 506 transitions. Second operand 41 states. [2018-01-29 23:45:26,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:45:26,426 INFO L93 Difference]: Finished difference Result 527 states and 553 transitions. [2018-01-29 23:45:26,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-01-29 23:45:26,426 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 91 [2018-01-29 23:45:26,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:45:26,428 INFO L225 Difference]: With dead ends: 527 [2018-01-29 23:45:26,428 INFO L226 Difference]: Without dead ends: 522 [2018-01-29 23:45:26,428 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1071 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=380, Invalid=3232, Unknown=56, NotChecked=238, Total=3906 [2018-01-29 23:45:26,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2018-01-29 23:45:26,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 501. [2018-01-29 23:45:26,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2018-01-29 23:45:26,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 526 transitions. [2018-01-29 23:45:26,464 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 526 transitions. Word has length 91 [2018-01-29 23:45:26,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:45:26,464 INFO L432 AbstractCegarLoop]: Abstraction has 501 states and 526 transitions. [2018-01-29 23:45:26,464 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-01-29 23:45:26,464 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 526 transitions. [2018-01-29 23:45:26,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-01-29 23:45:26,465 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:45:26,465 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 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-01-29 23:45:26,465 INFO L371 AbstractCegarLoop]: === Iteration 45 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:45:26,465 INFO L82 PathProgramCache]: Analyzing trace with hash -685318733, now seen corresponding path program 2 times [2018-01-29 23:45:26,465 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:45:26,465 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:45:26,466 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:45:26,466 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:45:26,466 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:45:26,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:45:26,479 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:45:26,827 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:45:26,827 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:45:26,827 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:45:26,834 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:45:26,851 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:45:26,861 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:45:26,864 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:45:26,867 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:45:26,870 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-01-29 23:45:26,870 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:26,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:26,892 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 23:45:27,157 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:45:27,170 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:45:27,171 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-01-29 23:45:27,171 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:27,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:27,213 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-01-29 23:45:27,583 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-01-29 23:45:27,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-01-29 23:45:27,585 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:27,599 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:27,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:27,665 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:32 [2018-01-29 23:45:27,798 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:45:27,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 40 [2018-01-29 23:45:27,802 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 1 [2018-01-29 23:45:27,802 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:27,806 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:27,810 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:27,810 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:29 [2018-01-29 23:45:27,812 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:45:27,812 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:45:27,813 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-29 23:45:27,813 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:27,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:27,817 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:28 [2018-01-29 23:45:27,861 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:45:27,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 38 [2018-01-29 23:45:27,865 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-01-29 23:45:27,865 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:27,871 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:27,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:27,876 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:34 [2018-01-29 23:45:27,967 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:45:27,979 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 72 [2018-01-29 23:45:27,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 68 treesize of output 56 [2018-01-29 23:45:27,981 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:28,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 39 [2018-01-29 23:45:28,009 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-29 23:45:28,022 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 23:45:28,033 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 2 xjuncts. [2018-01-29 23:45:28,033 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:59, output treesize:69 [2018-01-29 23:45:28,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2018-01-29 23:45:28,076 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-01-29 23:45:28,076 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:28,079 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:28,104 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 66 [2018-01-29 23:45:28,107 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 68 [2018-01-29 23:45:28,107 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:28,126 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:45:28,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 52 [2018-01-29 23:45:28,131 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-01-29 23:45:28,145 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 23:45:28,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-01-29 23:45:28,162 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:103, output treesize:111 [2018-01-29 23:45:28,290 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 39 treesize of output 32 [2018-01-29 23:45:28,292 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-01-29 23:45:28,292 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:28,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 19 [2018-01-29 23:45:28,299 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-29 23:45:28,302 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 23:45:28,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 55 [2018-01-29 23:45:28,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2018-01-29 23:45:28,322 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:28,340 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 35 treesize of output 36 [2018-01-29 23:45:28,341 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-01-29 23:45:28,358 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 27 treesize of output 20 [2018-01-29 23:45:28,358 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:28,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 27 [2018-01-29 23:45:28,379 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-01-29 23:45:28,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2018-01-29 23:45:28,385 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-01-29 23:45:28,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 19 [2018-01-29 23:45:28,411 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-01-29 23:45:28,423 INFO L267 ElimStorePlain]: Start of recursive call 5: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 23:45:28,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-29 23:45:28,431 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 7 variables, input treesize:99, output treesize:11 [2018-01-29 23:45:28,510 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:45:28,542 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:45:28,542 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21] total 36 [2018-01-29 23:45:28,542 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-01-29 23:45:28,542 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-01-29 23:45:28,543 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1159, Unknown=0, NotChecked=0, Total=1260 [2018-01-29 23:45:28,543 INFO L87 Difference]: Start difference. First operand 501 states and 526 transitions. Second operand 36 states. [2018-01-29 23:45:31,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:45:31,681 INFO L93 Difference]: Finished difference Result 709 states and 742 transitions. [2018-01-29 23:45:31,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-01-29 23:45:31,681 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 91 [2018-01-29 23:45:31,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:45:31,683 INFO L225 Difference]: With dead ends: 709 [2018-01-29 23:45:31,683 INFO L226 Difference]: Without dead ends: 675 [2018-01-29 23:45:31,683 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1452 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=876, Invalid=5766, Unknown=0, NotChecked=0, Total=6642 [2018-01-29 23:45:31,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2018-01-29 23:45:31,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 530. [2018-01-29 23:45:31,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2018-01-29 23:45:31,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 560 transitions. [2018-01-29 23:45:31,721 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 560 transitions. Word has length 91 [2018-01-29 23:45:31,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:45:31,721 INFO L432 AbstractCegarLoop]: Abstraction has 530 states and 560 transitions. [2018-01-29 23:45:31,721 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-01-29 23:45:31,721 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 560 transitions. [2018-01-29 23:45:31,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-01-29 23:45:31,721 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:45:31,722 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-29 23:45:31,722 INFO L371 AbstractCegarLoop]: === Iteration 46 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:45:31,722 INFO L82 PathProgramCache]: Analyzing trace with hash -2093846991, now seen corresponding path program 1 times [2018-01-29 23:45:31,722 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:45:31,722 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:45:31,722 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:45:31,722 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:45:31,723 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:45:31,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:45:31,731 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:45:32,600 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:45:32,600 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:45:32,600 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:45:32,605 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:45:32,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:45:32,632 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:45:32,813 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-01-29 23:45:32,815 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-01-29 23:45:32,815 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:32,816 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:32,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:32,826 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:48 [2018-01-29 23:45:32,938 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:45:32,941 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 54 treesize of output 55 [2018-01-29 23:45:32,942 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 1 [2018-01-29 23:45:32,943 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:32,947 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:32,956 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-01-29 23:45:32,956 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:54 [2018-01-29 23:45:32,989 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:45:32,992 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-01-29 23:45:32,994 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-01-29 23:45:32,994 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:32,999 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:33,009 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-01-29 23:45:33,009 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:70, output treesize:60 [2018-01-29 23:45:33,281 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:45:33,282 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 88 treesize of output 89 [2018-01-29 23:45:33,284 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-01-29 23:45:33,284 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:33,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 30 [2018-01-29 23:45:33,303 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-29 23:45:33,320 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-29 23:45:33,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 56 [2018-01-29 23:45:33,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-01-29 23:45:33,371 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:33,380 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:33,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2018-01-29 23:45:33,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-01-29 23:45:33,383 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:33,390 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:33,435 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:45:33,436 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 88 treesize of output 87 [2018-01-29 23:45:33,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 38 [2018-01-29 23:45:33,443 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-29 23:45:33,466 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-01-29 23:45:33,466 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:33,485 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-29 23:45:33,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2018-01-29 23:45:33,544 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-01-29 23:45:33,544 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:33,551 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:33,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2018-01-29 23:45:33,554 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-01-29 23:45:33,554 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:33,564 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:33,619 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-01-29 23:45:33,619 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 8 variables, input treesize:177, output treesize:143 [2018-01-29 23:45:33,925 WARN L1033 $PredicateComparison]: unable to prove that (or (and (not (= c_main_~t~7.base 0)) (exists ((v_prenex_152 Int)) (let ((.cse0 (store |c_old(#valid)| v_prenex_152 1))) (and (not (= 0 v_prenex_152)) (= |c_#valid| (store (store .cse0 c_main_~t~7.base 1) v_prenex_152 0)) (= 0 (select .cse0 c_main_~t~7.base)) (= (select |c_old(#valid)| v_prenex_152) 0))))) (and (not (= c_main_~t~7.offset 0)) (exists ((main_~p~7.base Int)) (let ((.cse1 (store |c_old(#valid)| main_~p~7.base 1))) (and (= (select |c_old(#valid)| main_~p~7.base) 0) (= 0 (select .cse1 c_main_~t~7.base)) (= |c_#valid| (store (store .cse1 c_main_~t~7.base 1) main_~p~7.base 0)) (not (= 0 main_~p~7.base))))))) is different from true [2018-01-29 23:45:34,009 WARN L1033 $PredicateComparison]: unable to prove that (exists ((v_prenex_152 Int) (main_~p~7.base Int)) (let ((.cse0 (store |c_old(#valid)| v_prenex_152 1))) (and (not (= 0 v_prenex_152)) (= 0 (select .cse0 main_~p~7.base)) (not (= 0 main_~p~7.base)) (= |c_#valid| (store (store (store .cse0 main_~p~7.base 1) v_prenex_152 0) main_~p~7.base 0)) (= (select |c_old(#valid)| v_prenex_152) 0)))) is different from true [2018-01-29 23:45:34,052 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-29 23:45:34,072 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:45:34,072 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 40 [2018-01-29 23:45:34,072 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-01-29 23:45:34,072 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-01-29 23:45:34,072 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1360, Unknown=24, NotChecked=150, Total=1640 [2018-01-29 23:45:34,073 INFO L87 Difference]: Start difference. First operand 530 states and 560 transitions. Second operand 41 states. [2018-01-29 23:45:34,912 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 123 DAG size of output 57 [2018-01-29 23:45:36,176 WARN L146 SmtUtils]: Spent 146ms on a formula simplification. DAG size of input: 155 DAG size of output 66 [2018-01-29 23:45:36,334 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 132 DAG size of output 57 [2018-01-29 23:45:37,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:45:37,354 INFO L93 Difference]: Finished difference Result 559 states and 590 transitions. [2018-01-29 23:45:37,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-01-29 23:45:37,384 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 91 [2018-01-29 23:45:37,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:45:37,385 INFO L225 Difference]: With dead ends: 559 [2018-01-29 23:45:37,385 INFO L226 Difference]: Without dead ends: 554 [2018-01-29 23:45:37,385 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 65 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 917 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=388, Invalid=3745, Unknown=35, NotChecked=254, Total=4422 [2018-01-29 23:45:37,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-01-29 23:45:37,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 513. [2018-01-29 23:45:37,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2018-01-29 23:45:37,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 543 transitions. [2018-01-29 23:45:37,419 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 543 transitions. Word has length 91 [2018-01-29 23:45:37,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:45:37,420 INFO L432 AbstractCegarLoop]: Abstraction has 513 states and 543 transitions. [2018-01-29 23:45:37,420 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-01-29 23:45:37,420 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 543 transitions. [2018-01-29 23:45:37,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-01-29 23:45:37,420 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:45:37,420 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:45:37,420 INFO L371 AbstractCegarLoop]: === Iteration 47 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr34EnsuresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-29 23:45:37,421 INFO L82 PathProgramCache]: Analyzing trace with hash -872098980, now seen corresponding path program 4 times [2018-01-29 23:45:37,421 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:45:37,421 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:45:37,421 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:45:37,421 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:45:37,421 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:45:37,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:45:37,430 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:45:38,101 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:45:38,101 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:45:38,102 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:45:38,106 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-29 23:45:38,134 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:45:38,137 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:45:38,138 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-01-29 23:45:38,139 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:38,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:38,141 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 23:45:38,202 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:45:38,203 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:45:38,203 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-01-29 23:45:38,203 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:38,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:38,211 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-01-29 23:45:38,269 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-01-29 23:45:38,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-29 23:45:38,270 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:38,272 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:38,285 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-01-29 23:45:38,286 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-01-29 23:45:38,287 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:38,288 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:38,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:38,298 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:58, output treesize:45 [2018-01-29 23:45:38,395 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:45:38,398 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 35 [2018-01-29 23:45:38,400 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-01-29 23:45:38,400 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:38,404 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:38,417 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:45:38,420 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 40 treesize of output 41 [2018-01-29 23:45:38,421 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 1 [2018-01-29 23:45:38,421 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:38,426 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:38,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:38,435 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:80, output treesize:50 [2018-01-29 23:45:38,446 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:45:38,447 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:45:38,447 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:45:38,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 40 [2018-01-29 23:45:38,448 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:38,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:38,461 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:58 [2018-01-29 23:45:38,534 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:45:38,536 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 46 [2018-01-29 23:45:38,538 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 22 treesize of output 18 [2018-01-29 23:45:38,538 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:38,544 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:38,560 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:45:38,563 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 23 treesize of output 30 [2018-01-29 23:45:38,564 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-01-29 23:45:38,564 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:38,568 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:38,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:38,581 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:84, output treesize:72 [2018-01-29 23:45:38,693 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:45:38,694 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:45:38,695 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:45:38,696 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:45:38,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 103 [2018-01-29 23:45:38,702 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 1 [2018-01-29 23:45:38,702 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:38,711 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:38,726 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 25 treesize of output 36 [2018-01-29 23:45:38,727 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-01-29 23:45:38,727 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:38,730 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:38,739 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:38,740 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:121, output treesize:71 [2018-01-29 23:45:38,771 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:45:38,773 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:45:38,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 108 [2018-01-29 23:45:38,778 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 20 treesize of output 19 [2018-01-29 23:45:38,778 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:38,789 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:38,812 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 43 treesize of output 44 [2018-01-29 23:45:38,814 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 20 treesize of output 19 [2018-01-29 23:45:38,814 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:38,818 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:38,829 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-01-29 23:45:38,830 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:144, output treesize:116 [2018-01-29 23:45:38,977 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 38 treesize of output 36 [2018-01-29 23:45:38,978 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-01-29 23:45:38,978 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:38,983 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:45:38,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-29 23:45:38,984 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:38,986 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:45:38,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-29 23:45:38,998 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:137, output treesize:103 [2018-01-29 23:45:39,137 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:45:39,138 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:45:39,138 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:45:39,139 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:45:39,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 90 [2018-01-29 23:45:39,142 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-01-29 23:45:39,143 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:39,152 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:45:39,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-01-29 23:45:39,153 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:45:39,161 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:45:39,162 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 27 treesize of output 19 [2018-01-29 23:45:39,162 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:45:39,167 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:45:39,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-29 23:45:39,177 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:112, output treesize:28 [2018-01-29 23:45:39,298 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:45:39,317 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:45:39,318 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 24] total 42 [2018-01-29 23:45:39,318 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-01-29 23:45:39,318 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-01-29 23:45:39,318 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1626, Unknown=0, NotChecked=0, Total=1806 [2018-01-29 23:45:39,318 INFO L87 Difference]: Start difference. First operand 513 states and 543 transitions. Second operand 43 states. Received shutdown request... [2018-01-29 23:45:41,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-29 23:45:41,734 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-29 23:45:41,739 WARN L185 ceAbstractionStarter]: Timeout [2018-01-29 23:45:41,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 11:45:41 BoogieIcfgContainer [2018-01-29 23:45:41,739 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-29 23:45:41,740 INFO L168 Benchmark]: Toolchain (without parser) took 118052.18 ms. Allocated memory was 309.3 MB in the beginning and 683.1 MB in the end (delta: 373.8 MB). Free memory was 269.4 MB in the beginning and 505.7 MB in the end (delta: -236.3 MB). Peak memory consumption was 137.5 MB. Max. memory is 5.3 GB. [2018-01-29 23:45:41,741 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 309.3 MB. Free memory is still 275.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-29 23:45:41,741 INFO L168 Benchmark]: CACSL2BoogieTranslator took 216.25 ms. Allocated memory is still 309.3 MB. Free memory was 268.4 MB in the beginning and 257.2 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 5.3 GB. [2018-01-29 23:45:41,741 INFO L168 Benchmark]: Boogie Preprocessor took 41.42 ms. Allocated memory is still 309.3 MB. Free memory was 257.2 MB in the beginning and 255.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-29 23:45:41,741 INFO L168 Benchmark]: RCFGBuilder took 550.81 ms. Allocated memory is still 309.3 MB. Free memory was 255.2 MB in the beginning and 222.4 MB in the end (delta: 32.8 MB). Peak memory consumption was 32.8 MB. Max. memory is 5.3 GB. [2018-01-29 23:45:41,742 INFO L168 Benchmark]: TraceAbstraction took 117236.97 ms. Allocated memory was 309.3 MB in the beginning and 683.1 MB in the end (delta: 373.8 MB). Free memory was 222.4 MB in the beginning and 505.7 MB in the end (delta: -283.3 MB). Peak memory consumption was 90.5 MB. Max. memory is 5.3 GB. [2018-01-29 23:45:41,743 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 309.3 MB. Free memory is still 275.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 216.25 ms. Allocated memory is still 309.3 MB. Free memory was 268.4 MB in the beginning and 257.2 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 41.42 ms. Allocated memory is still 309.3 MB. Free memory was 257.2 MB in the beginning and 255.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 550.81 ms. Allocated memory is still 309.3 MB. Free memory was 255.2 MB in the beginning and 222.4 MB in the end (delta: 32.8 MB). Peak memory consumption was 32.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 117236.97 ms. Allocated memory was 309.3 MB in the beginning and 683.1 MB in the end (delta: 373.8 MB). Free memory was 222.4 MB in the beginning and 505.7 MB in the end (delta: -283.3 MB). Peak memory consumption was 90.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was constructing difference of abstraction (513states) and interpolant automaton (currently 20 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was constructing difference of abstraction (513states) and interpolant automaton (currently 20 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 626]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 626). Cancelled while BasicCegarLoop was constructing difference of abstraction (513states) and interpolant automaton (currently 20 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was constructing difference of abstraction (513states) and interpolant automaton (currently 20 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 670). Cancelled while BasicCegarLoop was constructing difference of abstraction (513states) and interpolant automaton (currently 20 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 665). Cancelled while BasicCegarLoop was constructing difference of abstraction (513states) and interpolant automaton (currently 20 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 656). Cancelled while BasicCegarLoop was constructing difference of abstraction (513states) and interpolant automaton (currently 20 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was constructing difference of abstraction (513states) and interpolant automaton (currently 20 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 635). Cancelled while BasicCegarLoop was constructing difference of abstraction (513states) and interpolant automaton (currently 20 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was constructing difference of abstraction (513states) and interpolant automaton (currently 20 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 667). Cancelled while BasicCegarLoop was constructing difference of abstraction (513states) and interpolant automaton (currently 20 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was constructing difference of abstraction (513states) and interpolant automaton (currently 20 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (513states) and interpolant automaton (currently 20 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was constructing difference of abstraction (513states) and interpolant automaton (currently 20 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 654). Cancelled while BasicCegarLoop was constructing difference of abstraction (513states) and interpolant automaton (currently 20 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 662). Cancelled while BasicCegarLoop was constructing difference of abstraction (513states) and interpolant automaton (currently 20 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (513states) and interpolant automaton (currently 20 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was constructing difference of abstraction (513states) and interpolant automaton (currently 20 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (513states) and interpolant automaton (currently 20 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 656). Cancelled while BasicCegarLoop was constructing difference of abstraction (513states) and interpolant automaton (currently 20 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was constructing difference of abstraction (513states) and interpolant automaton (currently 20 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 670). Cancelled while BasicCegarLoop was constructing difference of abstraction (513states) and interpolant automaton (currently 20 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 665). Cancelled while BasicCegarLoop was constructing difference of abstraction (513states) and interpolant automaton (currently 20 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 635). Cancelled while BasicCegarLoop was constructing difference of abstraction (513states) and interpolant automaton (currently 20 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 654). Cancelled while BasicCegarLoop was constructing difference of abstraction (513states) and interpolant automaton (currently 20 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was constructing difference of abstraction (513states) and interpolant automaton (currently 20 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 667). Cancelled while BasicCegarLoop was constructing difference of abstraction (513states) and interpolant automaton (currently 20 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (513states) and interpolant automaton (currently 20 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was constructing difference of abstraction (513states) and interpolant automaton (currently 20 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (513states) and interpolant automaton (currently 20 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 662). Cancelled while BasicCegarLoop was constructing difference of abstraction (513states) and interpolant automaton (currently 20 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was constructing difference of abstraction (513states) and interpolant automaton (currently 20 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (513states) and interpolant automaton (currently 20 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was constructing difference of abstraction (513states) and interpolant automaton (currently 20 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was constructing difference of abstraction (513states) and interpolant automaton (currently 20 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 146 locations, 35 error locations. TIMEOUT Result, 117.1s OverallTime, 47 OverallIterations, 3 TraceHistogramMax, 73.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6379 SDtfs, 34957 SDslu, 82672 SDs, 0 SdLazy, 43363 SolverSat, 3771 SolverUnsat, 130 SolverUnknown, 0 SolverNotchecked, 24.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4106 GetRequests, 2180 SyntacticMatches, 82 SemanticMatches, 1843 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 26162 ImplicationChecksByTransitivity, 66.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=530occurred in iteration=45, 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.7s AutomataMinimizationTime, 46 MinimizatonAttempts, 5159 StatesRemovedByMinimization, 44 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 39.9s InterpolantComputationTime, 5823 NumberOfCodeBlocks, 5819 NumberOfCodeBlocksAsserted, 92 NumberOfCheckSat, 5743 ConstructedInterpolants, 768 QuantifiedInterpolants, 10156575 SizeOfPredicates, 623 NumberOfNonLiveVariables, 7168 ConjunctsInSsa, 1331 ConjunctsInUnsatCore, 80 InterpolantComputations, 14 PerfectInterpolantSequences, 164/1196 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/list-ext_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-29_23-45-41-751.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/list-ext_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-29_23-45-41-751.csv Completed graceful shutdown