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/test-0504_1_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a [2018-01-29 23:48:02,499 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-29 23:48:02,501 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-29 23:48:02,516 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-29 23:48:02,516 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-29 23:48:02,517 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-29 23:48:02,518 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-29 23:48:02,520 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-29 23:48:02,522 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-29 23:48:02,523 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-29 23:48:02,524 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-29 23:48:02,524 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-29 23:48:02,525 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-29 23:48:02,527 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-29 23:48:02,528 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-29 23:48:02,530 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-29 23:48:02,532 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-29 23:48:02,534 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-29 23:48:02,536 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-29 23:48:02,537 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-29 23:48:02,540 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-29 23:48:02,540 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-29 23:48:02,540 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-29 23:48:02,541 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-29 23:48:02,542 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-29 23:48:02,543 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-29 23:48:02,543 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-29 23:48:02,544 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-29 23:48:02,544 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-29 23:48:02,545 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-29 23:48:02,545 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-29 23:48:02,546 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:48:02,554 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-29 23:48:02,554 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-29 23:48:02,555 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-29 23:48:02,555 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-29 23:48:02,555 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-29 23:48:02,556 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-29 23:48:02,556 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-29 23:48:02,556 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-29 23:48:02,556 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-29 23:48:02,557 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-29 23:48:02,557 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-29 23:48:02,557 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-29 23:48:02,557 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-29 23:48:02,557 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-29 23:48:02,557 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-29 23:48:02,557 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-29 23:48:02,557 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-29 23:48:02,558 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-29 23:48:02,558 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-29 23:48:02,558 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-29 23:48:02,558 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-29 23:48:02,558 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-29 23:48:02,558 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-29 23:48:02,559 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-29 23:48:02,559 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-29 23:48:02,559 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-29 23:48:02,559 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-29 23:48:02,559 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-29 23:48:02,560 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-29 23:48:02,560 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-29 23:48:02,560 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-29 23:48:02,560 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-29 23:48:02,561 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-29 23:48:02,561 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-29 23:48:02,592 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-29 23:48:02,602 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-29 23:48:02,605 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-29 23:48:02,606 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-29 23:48:02,606 INFO L276 PluginConnector]: CDTParser initialized [2018-01-29 23:48:02,607 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/test-0504_1_true-valid-memsafety.i [2018-01-29 23:48:02,770 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-29 23:48:02,775 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-29 23:48:02,776 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-29 23:48:02,776 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-29 23:48:02,780 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-29 23:48:02,781 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 11:48:02" (1/1) ... [2018-01-29 23:48:02,784 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fcc512a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:48:02, skipping insertion in model container [2018-01-29 23:48:02,784 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 11:48:02" (1/1) ... [2018-01-29 23:48:02,798 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 23:48:02,838 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 23:48:02,955 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 23:48:02,975 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 23:48:02,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:48:02 WrapperNode [2018-01-29 23:48:02,986 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-29 23:48:02,987 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-29 23:48:02,987 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-29 23:48:02,987 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-29 23:48:03,004 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:48:02" (1/1) ... [2018-01-29 23:48:03,004 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:48:02" (1/1) ... [2018-01-29 23:48:03,016 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:48:02" (1/1) ... [2018-01-29 23:48:03,016 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:48:02" (1/1) ... [2018-01-29 23:48:03,022 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:48:02" (1/1) ... [2018-01-29 23:48:03,026 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:48:02" (1/1) ... [2018-01-29 23:48:03,027 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:48:02" (1/1) ... [2018-01-29 23:48:03,029 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-29 23:48:03,030 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-29 23:48:03,030 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-29 23:48:03,030 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-29 23:48:03,031 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:48:02" (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:48:03,077 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-29 23:48:03,077 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-29 23:48:03,077 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-29 23:48:03,077 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-29 23:48:03,077 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-29 23:48:03,077 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-29 23:48:03,077 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-29 23:48:03,078 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-29 23:48:03,078 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-29 23:48:03,078 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-29 23:48:03,078 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-29 23:48:03,078 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-29 23:48:03,078 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-01-29 23:48:03,079 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-29 23:48:03,079 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-29 23:48:03,079 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-29 23:48:03,079 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-29 23:48:03,571 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-29 23:48:03,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 11:48:03 BoogieIcfgContainer [2018-01-29 23:48:03,572 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-29 23:48:03,573 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-29 23:48:03,573 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-29 23:48:03,576 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-29 23:48:03,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 11:48:02" (1/3) ... [2018-01-29 23:48:03,578 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b02cd64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 11:48:03, skipping insertion in model container [2018-01-29 23:48:03,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:48:02" (2/3) ... [2018-01-29 23:48:03,579 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b02cd64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 11:48:03, skipping insertion in model container [2018-01-29 23:48:03,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 11:48:03" (3/3) ... [2018-01-29 23:48:03,581 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0504_1_true-valid-memsafety.i [2018-01-29 23:48:03,591 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-29 23:48:03,599 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 41 error locations. [2018-01-29 23:48:03,653 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-29 23:48:03,653 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-29 23:48:03,653 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-29 23:48:03,653 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-29 23:48:03,653 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-29 23:48:03,654 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-29 23:48:03,654 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-29 23:48:03,654 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-29 23:48:03,655 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-29 23:48:03,677 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states. [2018-01-29 23:48:03,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-29 23:48:03,684 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:48:03,685 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:48:03,686 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-29 23:48:03,692 INFO L82 PathProgramCache]: Analyzing trace with hash 618424159, now seen corresponding path program 1 times [2018-01-29 23:48:03,693 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:48:03,694 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:48:03,737 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:03,738 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:48:03,738 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:03,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:48:03,794 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:48:03,827 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:48:03,829 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:48:03,830 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-29 23:48:03,831 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-29 23:48:03,841 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-29 23:48:03,842 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-29 23:48:03,844 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 2 states. [2018-01-29 23:48:03,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:48:03,965 INFO L93 Difference]: Finished difference Result 264 states and 290 transitions. [2018-01-29 23:48:03,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-29 23:48:03,966 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-01-29 23:48:03,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:48:03,978 INFO L225 Difference]: With dead ends: 264 [2018-01-29 23:48:03,978 INFO L226 Difference]: Without dead ends: 132 [2018-01-29 23:48:03,983 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:48:03,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-01-29 23:48:04,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-01-29 23:48:04,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-01-29 23:48:04,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 139 transitions. [2018-01-29 23:48:04,020 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 139 transitions. Word has length 14 [2018-01-29 23:48:04,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:48:04,021 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 139 transitions. [2018-01-29 23:48:04,021 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-29 23:48:04,021 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 139 transitions. [2018-01-29 23:48:04,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-29 23:48:04,021 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:48:04,021 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] [2018-01-29 23:48:04,022 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-29 23:48:04,022 INFO L82 PathProgramCache]: Analyzing trace with hash -301198612, now seen corresponding path program 1 times [2018-01-29 23:48:04,022 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:48:04,022 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:48:04,023 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:04,023 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:48:04,023 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:04,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:48:04,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:48:04,080 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:48:04,080 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:48:04,080 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-29 23:48:04,082 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-29 23:48:04,083 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-29 23:48:04,083 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-29 23:48:04,083 INFO L87 Difference]: Start difference. First operand 132 states and 139 transitions. Second operand 3 states. [2018-01-29 23:48:04,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:48:04,214 INFO L93 Difference]: Finished difference Result 185 states and 196 transitions. [2018-01-29 23:48:04,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-29 23:48:04,215 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-01-29 23:48:04,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:48:04,219 INFO L225 Difference]: With dead ends: 185 [2018-01-29 23:48:04,219 INFO L226 Difference]: Without dead ends: 182 [2018-01-29 23:48:04,220 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-29 23:48:04,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-01-29 23:48:04,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 142. [2018-01-29 23:48:04,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-01-29 23:48:04,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 151 transitions. [2018-01-29 23:48:04,232 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 151 transitions. Word has length 20 [2018-01-29 23:48:04,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:48:04,233 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 151 transitions. [2018-01-29 23:48:04,233 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-29 23:48:04,233 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 151 transitions. [2018-01-29 23:48:04,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-29 23:48:04,233 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:48:04,233 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:48:04,234 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-29 23:48:04,234 INFO L82 PathProgramCache]: Analyzing trace with hash -814319768, now seen corresponding path program 1 times [2018-01-29 23:48:04,234 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:48:04,234 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:48:04,235 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:04,235 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:48:04,235 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:04,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:48:04,246 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:48:04,286 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:48:04,286 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:48:04,286 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 23:48:04,286 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-29 23:48:04,286 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-29 23:48:04,286 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-29 23:48:04,287 INFO L87 Difference]: Start difference. First operand 142 states and 151 transitions. Second operand 3 states. [2018-01-29 23:48:04,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:48:04,314 INFO L93 Difference]: Finished difference Result 185 states and 196 transitions. [2018-01-29 23:48:04,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-29 23:48:04,317 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-01-29 23:48:04,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:48:04,318 INFO L225 Difference]: With dead ends: 185 [2018-01-29 23:48:04,319 INFO L226 Difference]: Without dead ends: 142 [2018-01-29 23:48:04,319 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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:48:04,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-01-29 23:48:04,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 138. [2018-01-29 23:48:04,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-01-29 23:48:04,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 146 transitions. [2018-01-29 23:48:04,330 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 146 transitions. Word has length 23 [2018-01-29 23:48:04,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:48:04,330 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 146 transitions. [2018-01-29 23:48:04,330 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-29 23:48:04,330 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 146 transitions. [2018-01-29 23:48:04,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-29 23:48:04,331 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:48:04,331 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:48:04,332 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-29 23:48:04,332 INFO L82 PathProgramCache]: Analyzing trace with hash -724324522, now seen corresponding path program 1 times [2018-01-29 23:48:04,332 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:48:04,332 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:48:04,333 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:04,333 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:48:04,334 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:04,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:48:04,345 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:48:04,372 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:48:04,372 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:48:04,372 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 23:48:04,373 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-29 23:48:04,373 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-29 23:48:04,373 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-29 23:48:04,374 INFO L87 Difference]: Start difference. First operand 138 states and 146 transitions. Second operand 3 states. [2018-01-29 23:48:04,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:48:04,393 INFO L93 Difference]: Finished difference Result 262 states and 278 transitions. [2018-01-29 23:48:04,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-29 23:48:04,394 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-01-29 23:48:04,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:48:04,395 INFO L225 Difference]: With dead ends: 262 [2018-01-29 23:48:04,395 INFO L226 Difference]: Without dead ends: 139 [2018-01-29 23:48:04,396 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:48:04,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-01-29 23:48:04,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-01-29 23:48:04,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-01-29 23:48:04,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 146 transitions. [2018-01-29 23:48:04,406 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 146 transitions. Word has length 23 [2018-01-29 23:48:04,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:48:04,406 INFO L432 AbstractCegarLoop]: Abstraction has 139 states and 146 transitions. [2018-01-29 23:48:04,407 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-29 23:48:04,407 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 146 transitions. [2018-01-29 23:48:04,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-29 23:48:04,407 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:48:04,407 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:48:04,407 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-29 23:48:04,408 INFO L82 PathProgramCache]: Analyzing trace with hash 737120755, now seen corresponding path program 1 times [2018-01-29 23:48:04,408 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:48:04,408 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:48:04,409 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:04,409 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:48:04,409 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:04,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:48:04,423 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:48:04,470 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:48:04,470 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:48:04,470 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 23:48:04,471 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-29 23:48:04,471 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-29 23:48:04,471 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-29 23:48:04,471 INFO L87 Difference]: Start difference. First operand 139 states and 146 transitions. Second operand 4 states. [2018-01-29 23:48:04,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:48:04,619 INFO L93 Difference]: Finished difference Result 185 states and 194 transitions. [2018-01-29 23:48:04,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-29 23:48:04,619 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-01-29 23:48:04,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:48:04,621 INFO L225 Difference]: With dead ends: 185 [2018-01-29 23:48:04,621 INFO L226 Difference]: Without dead ends: 177 [2018-01-29 23:48:04,621 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:48:04,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-01-29 23:48:04,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 131. [2018-01-29 23:48:04,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-01-29 23:48:04,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 138 transitions. [2018-01-29 23:48:04,632 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 138 transitions. Word has length 25 [2018-01-29 23:48:04,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:48:04,632 INFO L432 AbstractCegarLoop]: Abstraction has 131 states and 138 transitions. [2018-01-29 23:48:04,632 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-29 23:48:04,633 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 138 transitions. [2018-01-29 23:48:04,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-29 23:48:04,633 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:48:04,634 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:48:04,634 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-29 23:48:04,634 INFO L82 PathProgramCache]: Analyzing trace with hash 737120756, now seen corresponding path program 1 times [2018-01-29 23:48:04,634 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:48:04,634 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:48:04,635 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:04,635 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:48:04,636 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:04,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:48:04,648 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:48:04,720 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:48:04,720 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:48:04,720 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 23:48:04,721 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-29 23:48:04,721 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-29 23:48:04,721 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-29 23:48:04,722 INFO L87 Difference]: Start difference. First operand 131 states and 138 transitions. Second operand 4 states. [2018-01-29 23:48:04,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:48:04,906 INFO L93 Difference]: Finished difference Result 210 states and 224 transitions. [2018-01-29 23:48:04,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-29 23:48:04,906 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-01-29 23:48:04,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:48:04,907 INFO L225 Difference]: With dead ends: 210 [2018-01-29 23:48:04,908 INFO L226 Difference]: Without dead ends: 204 [2018-01-29 23:48:04,908 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-29 23:48:04,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-01-29 23:48:04,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 138. [2018-01-29 23:48:04,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-01-29 23:48:04,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 150 transitions. [2018-01-29 23:48:04,918 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 150 transitions. Word has length 25 [2018-01-29 23:48:04,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:48:04,918 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 150 transitions. [2018-01-29 23:48:04,918 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-29 23:48:04,918 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 150 transitions. [2018-01-29 23:48:04,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-29 23:48:04,919 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:48:04,920 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] [2018-01-29 23:48:04,920 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-29 23:48:04,920 INFO L82 PathProgramCache]: Analyzing trace with hash 970639538, now seen corresponding path program 1 times [2018-01-29 23:48:04,920 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:48:04,920 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:48:04,921 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:04,921 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:48:04,921 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:04,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:48:04,945 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:48:04,998 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:48:04,998 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:48:04,999 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 23:48:04,999 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-29 23:48:04,999 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-29 23:48:04,999 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-29 23:48:05,000 INFO L87 Difference]: Start difference. First operand 138 states and 150 transitions. Second operand 3 states. [2018-01-29 23:48:05,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:48:05,025 INFO L93 Difference]: Finished difference Result 324 states and 354 transitions. [2018-01-29 23:48:05,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-29 23:48:05,025 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-01-29 23:48:05,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:48:05,027 INFO L225 Difference]: With dead ends: 324 [2018-01-29 23:48:05,027 INFO L226 Difference]: Without dead ends: 202 [2018-01-29 23:48:05,028 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:48:05,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-01-29 23:48:05,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 180. [2018-01-29 23:48:05,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-01-29 23:48:05,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 206 transitions. [2018-01-29 23:48:05,039 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 206 transitions. Word has length 39 [2018-01-29 23:48:05,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:48:05,039 INFO L432 AbstractCegarLoop]: Abstraction has 180 states and 206 transitions. [2018-01-29 23:48:05,039 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-29 23:48:05,040 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 206 transitions. [2018-01-29 23:48:05,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-29 23:48:05,041 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:48:05,041 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] [2018-01-29 23:48:05,041 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-29 23:48:05,042 INFO L82 PathProgramCache]: Analyzing trace with hash 746590347, now seen corresponding path program 1 times [2018-01-29 23:48:05,042 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:48:05,042 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:48:05,043 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:05,043 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:48:05,043 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:05,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:48:05,064 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:48:05,094 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:48:05,094 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:48:05,094 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 23:48:05,095 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-29 23:48:05,095 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-29 23:48:05,095 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-29 23:48:05,096 INFO L87 Difference]: Start difference. First operand 180 states and 206 transitions. Second operand 3 states. [2018-01-29 23:48:05,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:48:05,137 INFO L93 Difference]: Finished difference Result 333 states and 388 transitions. [2018-01-29 23:48:05,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-29 23:48:05,138 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-01-29 23:48:05,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:48:05,139 INFO L225 Difference]: With dead ends: 333 [2018-01-29 23:48:05,140 INFO L226 Difference]: Without dead ends: 183 [2018-01-29 23:48:05,141 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:48:05,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-01-29 23:48:05,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-01-29 23:48:05,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-01-29 23:48:05,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 209 transitions. [2018-01-29 23:48:05,149 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 209 transitions. Word has length 43 [2018-01-29 23:48:05,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:48:05,150 INFO L432 AbstractCegarLoop]: Abstraction has 183 states and 209 transitions. [2018-01-29 23:48:05,150 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-29 23:48:05,150 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 209 transitions. [2018-01-29 23:48:05,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-29 23:48:05,151 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:48:05,152 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] [2018-01-29 23:48:05,152 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-29 23:48:05,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1242070152, now seen corresponding path program 1 times [2018-01-29 23:48:05,152 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:48:05,152 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:48:05,153 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:05,154 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:48:05,154 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:05,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:48:05,179 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:48:05,277 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:48:05,277 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:48:05,277 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-29 23:48:05,277 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-29 23:48:05,279 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-29 23:48:05,279 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-01-29 23:48:05,279 INFO L87 Difference]: Start difference. First operand 183 states and 209 transitions. Second operand 5 states. [2018-01-29 23:48:05,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:48:05,521 INFO L93 Difference]: Finished difference Result 343 states and 377 transitions. [2018-01-29 23:48:05,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-29 23:48:05,521 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-01-29 23:48:05,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:48:05,523 INFO L225 Difference]: With dead ends: 343 [2018-01-29 23:48:05,523 INFO L226 Difference]: Without dead ends: 340 [2018-01-29 23:48:05,524 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-01-29 23:48:05,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-01-29 23:48:05,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 167. [2018-01-29 23:48:05,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-01-29 23:48:05,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 186 transitions. [2018-01-29 23:48:05,535 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 186 transitions. Word has length 45 [2018-01-29 23:48:05,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:48:05,535 INFO L432 AbstractCegarLoop]: Abstraction has 167 states and 186 transitions. [2018-01-29 23:48:05,535 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-29 23:48:05,536 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 186 transitions. [2018-01-29 23:48:05,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-29 23:48:05,536 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:48:05,537 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] [2018-01-29 23:48:05,537 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-29 23:48:05,537 INFO L82 PathProgramCache]: Analyzing trace with hash -150530920, now seen corresponding path program 1 times [2018-01-29 23:48:05,537 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:48:05,537 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:48:05,538 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:05,538 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:48:05,538 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:05,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:48:05,556 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:48:05,601 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:48:05,601 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:48:05,601 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 23:48:05,602 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-29 23:48:05,602 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-29 23:48:05,602 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-29 23:48:05,602 INFO L87 Difference]: Start difference. First operand 167 states and 186 transitions. Second operand 4 states. [2018-01-29 23:48:05,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:48:05,746 INFO L93 Difference]: Finished difference Result 270 states and 298 transitions. [2018-01-29 23:48:05,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-29 23:48:05,746 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-01-29 23:48:05,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:48:05,748 INFO L225 Difference]: With dead ends: 270 [2018-01-29 23:48:05,748 INFO L226 Difference]: Without dead ends: 266 [2018-01-29 23:48:05,748 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-29 23:48:05,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-01-29 23:48:05,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 163. [2018-01-29 23:48:05,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-01-29 23:48:05,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 178 transitions. [2018-01-29 23:48:05,759 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 178 transitions. Word has length 46 [2018-01-29 23:48:05,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:48:05,759 INFO L432 AbstractCegarLoop]: Abstraction has 163 states and 178 transitions. [2018-01-29 23:48:05,759 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-29 23:48:05,760 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 178 transitions. [2018-01-29 23:48:05,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-29 23:48:05,761 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:48:05,761 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] [2018-01-29 23:48:05,761 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-29 23:48:05,761 INFO L82 PathProgramCache]: Analyzing trace with hash -150530919, now seen corresponding path program 1 times [2018-01-29 23:48:05,761 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:48:05,761 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:48:05,762 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:05,763 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:48:05,763 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:05,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:48:05,780 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:48:05,857 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:48:05,867 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:48:05,868 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 23:48:05,868 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-29 23:48:05,868 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-29 23:48:05,868 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-29 23:48:05,868 INFO L87 Difference]: Start difference. First operand 163 states and 178 transitions. Second operand 4 states. [2018-01-29 23:48:05,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:48:05,969 INFO L93 Difference]: Finished difference Result 258 states and 282 transitions. [2018-01-29 23:48:05,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-29 23:48:05,969 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-01-29 23:48:05,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:48:05,970 INFO L225 Difference]: With dead ends: 258 [2018-01-29 23:48:05,970 INFO L226 Difference]: Without dead ends: 254 [2018-01-29 23:48:05,971 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-29 23:48:05,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-01-29 23:48:05,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 159. [2018-01-29 23:48:05,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-01-29 23:48:05,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 170 transitions. [2018-01-29 23:48:05,979 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 170 transitions. Word has length 46 [2018-01-29 23:48:05,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:48:05,980 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 170 transitions. [2018-01-29 23:48:05,980 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-29 23:48:05,980 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 170 transitions. [2018-01-29 23:48:05,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-29 23:48:05,981 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:48:05,981 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] [2018-01-29 23:48:05,981 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-29 23:48:05,982 INFO L82 PathProgramCache]: Analyzing trace with hash -520715123, now seen corresponding path program 1 times [2018-01-29 23:48:05,982 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:48:05,982 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:48:05,983 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:05,983 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:48:05,983 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:06,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:48:06,001 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:48:06,145 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:48:06,146 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:48:06,146 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-29 23:48:06,146 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 23:48:06,146 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 23:48:06,146 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-29 23:48:06,147 INFO L87 Difference]: Start difference. First operand 159 states and 170 transitions. Second operand 6 states. [2018-01-29 23:48:06,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:48:06,410 INFO L93 Difference]: Finished difference Result 281 states and 303 transitions. [2018-01-29 23:48:06,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-29 23:48:06,411 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2018-01-29 23:48:06,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:48:06,412 INFO L225 Difference]: With dead ends: 281 [2018-01-29 23:48:06,413 INFO L226 Difference]: Without dead ends: 280 [2018-01-29 23:48:06,413 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-01-29 23:48:06,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-01-29 23:48:06,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 197. [2018-01-29 23:48:06,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-01-29 23:48:06,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 214 transitions. [2018-01-29 23:48:06,424 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 214 transitions. Word has length 49 [2018-01-29 23:48:06,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:48:06,425 INFO L432 AbstractCegarLoop]: Abstraction has 197 states and 214 transitions. [2018-01-29 23:48:06,425 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 23:48:06,425 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 214 transitions. [2018-01-29 23:48:06,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-29 23:48:06,426 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:48:06,426 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] [2018-01-29 23:48:06,426 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-29 23:48:06,427 INFO L82 PathProgramCache]: Analyzing trace with hash -520715122, now seen corresponding path program 1 times [2018-01-29 23:48:06,427 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:48:06,427 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:48:06,428 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:06,428 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:48:06,428 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:06,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:48:06,448 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:48:06,688 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:48:06,688 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:48:06,688 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-29 23:48:06,688 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-29 23:48:06,688 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-29 23:48:06,689 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-29 23:48:06,689 INFO L87 Difference]: Start difference. First operand 197 states and 214 transitions. Second operand 10 states. [2018-01-29 23:48:07,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:48:07,159 INFO L93 Difference]: Finished difference Result 350 states and 375 transitions. [2018-01-29 23:48:07,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-29 23:48:07,159 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 49 [2018-01-29 23:48:07,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:48:07,161 INFO L225 Difference]: With dead ends: 350 [2018-01-29 23:48:07,161 INFO L226 Difference]: Without dead ends: 349 [2018-01-29 23:48:07,161 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2018-01-29 23:48:07,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-01-29 23:48:07,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 197. [2018-01-29 23:48:07,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-01-29 23:48:07,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 212 transitions. [2018-01-29 23:48:07,169 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 212 transitions. Word has length 49 [2018-01-29 23:48:07,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:48:07,169 INFO L432 AbstractCegarLoop]: Abstraction has 197 states and 212 transitions. [2018-01-29 23:48:07,169 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-29 23:48:07,169 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 212 transitions. [2018-01-29 23:48:07,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-29 23:48:07,170 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:48:07,170 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, 1, 1, 1] [2018-01-29 23:48:07,170 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-29 23:48:07,170 INFO L82 PathProgramCache]: Analyzing trace with hash -623103946, now seen corresponding path program 1 times [2018-01-29 23:48:07,170 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:48:07,170 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:48:07,171 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:07,171 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:48:07,171 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:07,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:48:07,180 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:48:07,259 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:48:07,259 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:48:07,259 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:48:07,272 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:48:07,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:48:07,309 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:48:07,389 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:48:07,422 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-29 23:48:07,423 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2018-01-29 23:48:07,423 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-29 23:48:07,423 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-29 23:48:07,423 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-29 23:48:07,423 INFO L87 Difference]: Start difference. First operand 197 states and 212 transitions. Second operand 7 states. [2018-01-29 23:48:07,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:48:07,686 INFO L93 Difference]: Finished difference Result 346 states and 371 transitions. [2018-01-29 23:48:07,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-29 23:48:07,687 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2018-01-29 23:48:07,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:48:07,688 INFO L225 Difference]: With dead ends: 346 [2018-01-29 23:48:07,688 INFO L226 Difference]: Without dead ends: 222 [2018-01-29 23:48:07,689 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-01-29 23:48:07,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-01-29 23:48:07,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 210. [2018-01-29 23:48:07,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-01-29 23:48:07,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 225 transitions. [2018-01-29 23:48:07,702 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 225 transitions. Word has length 50 [2018-01-29 23:48:07,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:48:07,702 INFO L432 AbstractCegarLoop]: Abstraction has 210 states and 225 transitions. [2018-01-29 23:48:07,702 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-29 23:48:07,702 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 225 transitions. [2018-01-29 23:48:07,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-01-29 23:48:07,703 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:48:07,703 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:48:07,704 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-29 23:48:07,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1908788837, now seen corresponding path program 1 times [2018-01-29 23:48:07,704 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:48:07,704 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:48:07,705 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:07,705 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:48:07,706 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:07,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:48:07,721 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:48:07,786 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:48:07,786 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:48:07,786 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:48:07,799 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:48:07,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:48:07,829 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:48:07,889 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:48:07,923 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:48:07,924 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-01-29 23:48:07,924 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-29 23:48:07,924 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-29 23:48:07,924 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-29 23:48:07,925 INFO L87 Difference]: Start difference. First operand 210 states and 225 transitions. Second operand 8 states. [2018-01-29 23:48:08,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:48:08,057 INFO L93 Difference]: Finished difference Result 261 states and 276 transitions. [2018-01-29 23:48:08,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-29 23:48:08,058 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2018-01-29 23:48:08,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:48:08,059 INFO L225 Difference]: With dead ends: 261 [2018-01-29 23:48:08,059 INFO L226 Difference]: Without dead ends: 217 [2018-01-29 23:48:08,060 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 54 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:48:08,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-01-29 23:48:08,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 209. [2018-01-29 23:48:08,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-01-29 23:48:08,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 223 transitions. [2018-01-29 23:48:08,072 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 223 transitions. Word has length 55 [2018-01-29 23:48:08,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:48:08,072 INFO L432 AbstractCegarLoop]: Abstraction has 209 states and 223 transitions. [2018-01-29 23:48:08,072 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-29 23:48:08,072 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 223 transitions. [2018-01-29 23:48:08,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-01-29 23:48:08,073 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:48:08,073 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] [2018-01-29 23:48:08,073 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-29 23:48:08,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1129337720, now seen corresponding path program 1 times [2018-01-29 23:48:08,074 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:48:08,074 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:48:08,074 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:08,075 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:48:08,075 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:08,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:48:08,087 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:48:08,135 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:48:08,135 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:48:08,135 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 23:48:08,136 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-29 23:48:08,136 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-29 23:48:08,136 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-29 23:48:08,136 INFO L87 Difference]: Start difference. First operand 209 states and 223 transitions. Second operand 4 states. [2018-01-29 23:48:08,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:48:08,285 INFO L93 Difference]: Finished difference Result 250 states and 264 transitions. [2018-01-29 23:48:08,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-29 23:48:08,285 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2018-01-29 23:48:08,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:48:08,287 INFO L225 Difference]: With dead ends: 250 [2018-01-29 23:48:08,287 INFO L226 Difference]: Without dead ends: 249 [2018-01-29 23:48:08,287 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-29 23:48:08,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-01-29 23:48:08,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 216. [2018-01-29 23:48:08,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-01-29 23:48:08,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 232 transitions. [2018-01-29 23:48:08,299 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 232 transitions. Word has length 57 [2018-01-29 23:48:08,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:48:08,299 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 232 transitions. [2018-01-29 23:48:08,299 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-29 23:48:08,299 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 232 transitions. [2018-01-29 23:48:08,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-01-29 23:48:08,300 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:48:08,301 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] [2018-01-29 23:48:08,301 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-29 23:48:08,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1129337721, now seen corresponding path program 1 times [2018-01-29 23:48:08,301 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:48:08,301 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:48:08,302 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:08,302 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:48:08,302 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:08,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:48:08,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:48:08,421 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:48:08,422 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:48:08,422 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-29 23:48:08,422 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-29 23:48:08,422 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-29 23:48:08,422 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-29 23:48:08,423 INFO L87 Difference]: Start difference. First operand 216 states and 232 transitions. Second operand 5 states. [2018-01-29 23:48:08,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:48:08,897 INFO L93 Difference]: Finished difference Result 362 states and 390 transitions. [2018-01-29 23:48:08,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-29 23:48:08,898 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2018-01-29 23:48:08,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:48:08,899 INFO L225 Difference]: With dead ends: 362 [2018-01-29 23:48:08,899 INFO L226 Difference]: Without dead ends: 361 [2018-01-29 23:48:08,899 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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:48:08,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2018-01-29 23:48:08,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 281. [2018-01-29 23:48:08,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-01-29 23:48:08,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 306 transitions. [2018-01-29 23:48:08,910 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 306 transitions. Word has length 57 [2018-01-29 23:48:08,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:48:08,910 INFO L432 AbstractCegarLoop]: Abstraction has 281 states and 306 transitions. [2018-01-29 23:48:08,910 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-29 23:48:08,910 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 306 transitions. [2018-01-29 23:48:08,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-29 23:48:08,910 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:48:08,910 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] [2018-01-29 23:48:08,911 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-29 23:48:08,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1621308131, now seen corresponding path program 1 times [2018-01-29 23:48:08,911 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:48:08,911 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:48:08,912 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:08,912 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:48:08,912 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:08,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:48:08,922 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:48:08,973 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:48:08,973 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:48:08,974 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-29 23:48:08,974 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-29 23:48:08,974 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-29 23:48:08,974 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-29 23:48:08,974 INFO L87 Difference]: Start difference. First operand 281 states and 306 transitions. Second operand 5 states. [2018-01-29 23:48:09,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:48:09,184 INFO L93 Difference]: Finished difference Result 333 states and 359 transitions. [2018-01-29 23:48:09,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-29 23:48:09,184 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2018-01-29 23:48:09,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:48:09,186 INFO L225 Difference]: With dead ends: 333 [2018-01-29 23:48:09,186 INFO L226 Difference]: Without dead ends: 331 [2018-01-29 23:48:09,186 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-29 23:48:09,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-01-29 23:48:09,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 294. [2018-01-29 23:48:09,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-01-29 23:48:09,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 327 transitions. [2018-01-29 23:48:09,204 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 327 transitions. Word has length 60 [2018-01-29 23:48:09,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:48:09,204 INFO L432 AbstractCegarLoop]: Abstraction has 294 states and 327 transitions. [2018-01-29 23:48:09,204 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-29 23:48:09,204 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 327 transitions. [2018-01-29 23:48:09,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-29 23:48:09,205 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:48:09,205 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] [2018-01-29 23:48:09,205 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-29 23:48:09,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1621308132, now seen corresponding path program 1 times [2018-01-29 23:48:09,206 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:48:09,206 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:48:09,206 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:09,207 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:48:09,207 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:09,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:48:09,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:48:09,304 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:48:09,304 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:48:09,304 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-29 23:48:09,304 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 23:48:09,305 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 23:48:09,305 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-29 23:48:09,305 INFO L87 Difference]: Start difference. First operand 294 states and 327 transitions. Second operand 6 states. [2018-01-29 23:48:09,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:48:09,985 INFO L93 Difference]: Finished difference Result 431 states and 484 transitions. [2018-01-29 23:48:09,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-29 23:48:09,986 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2018-01-29 23:48:09,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:48:09,988 INFO L225 Difference]: With dead ends: 431 [2018-01-29 23:48:09,988 INFO L226 Difference]: Without dead ends: 429 [2018-01-29 23:48:09,988 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-01-29 23:48:09,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2018-01-29 23:48:10,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 321. [2018-01-29 23:48:10,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-01-29 23:48:10,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 369 transitions. [2018-01-29 23:48:10,007 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 369 transitions. Word has length 60 [2018-01-29 23:48:10,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:48:10,007 INFO L432 AbstractCegarLoop]: Abstraction has 321 states and 369 transitions. [2018-01-29 23:48:10,007 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 23:48:10,008 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 369 transitions. [2018-01-29 23:48:10,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-01-29 23:48:10,008 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:48:10,008 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] [2018-01-29 23:48:10,009 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-29 23:48:10,009 INFO L82 PathProgramCache]: Analyzing trace with hash -635597717, now seen corresponding path program 1 times [2018-01-29 23:48:10,009 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:48:10,009 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:48:10,010 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:10,010 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:48:10,010 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:10,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:48:10,023 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:48:10,150 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:48:10,150 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:48:10,150 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-29 23:48:10,151 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-29 23:48:10,151 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-29 23:48:10,151 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-29 23:48:10,151 INFO L87 Difference]: Start difference. First operand 321 states and 369 transitions. Second operand 8 states. [2018-01-29 23:48:10,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:48:10,638 INFO L93 Difference]: Finished difference Result 479 states and 552 transitions. [2018-01-29 23:48:10,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-29 23:48:10,639 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2018-01-29 23:48:10,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:48:10,640 INFO L225 Difference]: With dead ends: 479 [2018-01-29 23:48:10,640 INFO L226 Difference]: Without dead ends: 478 [2018-01-29 23:48:10,641 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2018-01-29 23:48:10,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2018-01-29 23:48:10,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 346. [2018-01-29 23:48:10,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2018-01-29 23:48:10,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 399 transitions. [2018-01-29 23:48:10,653 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 399 transitions. Word has length 66 [2018-01-29 23:48:10,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:48:10,653 INFO L432 AbstractCegarLoop]: Abstraction has 346 states and 399 transitions. [2018-01-29 23:48:10,654 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-29 23:48:10,654 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 399 transitions. [2018-01-29 23:48:10,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-01-29 23:48:10,654 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:48:10,654 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] [2018-01-29 23:48:10,654 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-29 23:48:10,654 INFO L82 PathProgramCache]: Analyzing trace with hash -635597716, now seen corresponding path program 1 times [2018-01-29 23:48:10,655 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:48:10,655 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:48:10,655 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:10,655 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:48:10,655 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:10,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:48:10,665 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:48:10,937 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:48:10,937 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:48:10,985 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-29 23:48:10,985 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-29 23:48:10,986 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-29 23:48:10,986 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-29 23:48:10,986 INFO L87 Difference]: Start difference. First operand 346 states and 399 transitions. Second operand 8 states. [2018-01-29 23:48:11,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:48:11,205 INFO L93 Difference]: Finished difference Result 525 states and 613 transitions. [2018-01-29 23:48:11,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-29 23:48:11,205 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2018-01-29 23:48:11,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:48:11,207 INFO L225 Difference]: With dead ends: 525 [2018-01-29 23:48:11,207 INFO L226 Difference]: Without dead ends: 452 [2018-01-29 23:48:11,208 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2018-01-29 23:48:11,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2018-01-29 23:48:11,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 344. [2018-01-29 23:48:11,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2018-01-29 23:48:11,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 395 transitions. [2018-01-29 23:48:11,229 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 395 transitions. Word has length 66 [2018-01-29 23:48:11,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:48:11,230 INFO L432 AbstractCegarLoop]: Abstraction has 344 states and 395 transitions. [2018-01-29 23:48:11,230 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-29 23:48:11,230 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 395 transitions. [2018-01-29 23:48:11,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-29 23:48:11,231 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:48:11,231 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:48:11,231 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-29 23:48:11,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1382363295, now seen corresponding path program 1 times [2018-01-29 23:48:11,232 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:48:11,232 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:48:11,232 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:11,233 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:48:11,233 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:11,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:48:11,248 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:48:11,426 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:48:11,426 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:48:11,426 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:48:11,439 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:48:11,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:48:11,474 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:48:11,631 WARN L1033 $PredicateComparison]: unable to prove that (exists ((main_~x~10.base Int)) (and (= (select |c_old(#valid)| main_~x~10.base) 0) (= |c_#valid| (store |c_old(#valid)| main_~x~10.base 0)) (not (= main_~x~10.base 0)))) is different from true [2018-01-29 23:48:11,662 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-01-29 23:48:11,698 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:48:11,698 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 13 [2018-01-29 23:48:11,699 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-29 23:48:11,699 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-29 23:48:11,699 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=130, Unknown=1, NotChecked=22, Total=182 [2018-01-29 23:48:11,699 INFO L87 Difference]: Start difference. First operand 344 states and 395 transitions. Second operand 14 states. [2018-01-29 23:48:12,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:48:12,171 INFO L93 Difference]: Finished difference Result 401 states and 454 transitions. [2018-01-29 23:48:12,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-29 23:48:12,172 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 69 [2018-01-29 23:48:12,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:48:12,174 INFO L225 Difference]: With dead ends: 401 [2018-01-29 23:48:12,174 INFO L226 Difference]: Without dead ends: 398 [2018-01-29 23:48:12,174 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=289, Unknown=1, NotChecked=36, Total=420 [2018-01-29 23:48:12,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2018-01-29 23:48:12,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 359. [2018-01-29 23:48:12,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-01-29 23:48:12,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 410 transitions. [2018-01-29 23:48:12,194 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 410 transitions. Word has length 69 [2018-01-29 23:48:12,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:48:12,194 INFO L432 AbstractCegarLoop]: Abstraction has 359 states and 410 transitions. [2018-01-29 23:48:12,195 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-29 23:48:12,195 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 410 transitions. [2018-01-29 23:48:12,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-01-29 23:48:12,196 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:48:12,196 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] [2018-01-29 23:48:12,196 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-29 23:48:12,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1845336277, now seen corresponding path program 1 times [2018-01-29 23:48:12,196 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:48:12,196 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:48:12,197 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:12,197 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:48:12,197 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:12,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:48:12,211 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:48:12,299 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:48:12,299 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:48:12,300 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:48:12,315 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:48:12,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:48:12,350 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:48:12,368 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:48:12,405 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:48:12,405 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2018-01-29 23:48:12,406 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-29 23:48:12,406 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-29 23:48:12,406 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-29 23:48:12,406 INFO L87 Difference]: Start difference. First operand 359 states and 410 transitions. Second operand 8 states. [2018-01-29 23:48:12,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:48:12,701 INFO L93 Difference]: Finished difference Result 462 states and 530 transitions. [2018-01-29 23:48:12,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-29 23:48:12,702 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 72 [2018-01-29 23:48:12,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:48:12,703 INFO L225 Difference]: With dead ends: 462 [2018-01-29 23:48:12,703 INFO L226 Difference]: Without dead ends: 394 [2018-01-29 23:48:12,704 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-01-29 23:48:12,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2018-01-29 23:48:12,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 374. [2018-01-29 23:48:12,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-01-29 23:48:12,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 443 transitions. [2018-01-29 23:48:12,718 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 443 transitions. Word has length 72 [2018-01-29 23:48:12,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:48:12,718 INFO L432 AbstractCegarLoop]: Abstraction has 374 states and 443 transitions. [2018-01-29 23:48:12,719 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-29 23:48:12,719 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 443 transitions. [2018-01-29 23:48:12,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-01-29 23:48:12,719 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:48:12,719 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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] [2018-01-29 23:48:12,719 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-29 23:48:12,720 INFO L82 PathProgramCache]: Analyzing trace with hash 96824994, now seen corresponding path program 1 times [2018-01-29 23:48:12,720 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:48:12,720 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:48:12,720 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:12,721 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:48:12,721 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:12,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:48:12,737 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:48:12,966 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:48:12,967 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:48:12,967 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:48:12,976 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:48:13,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:48:13,020 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:48:13,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-29 23:48:13,070 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:13,074 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:13,074 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-29 23:48:13,094 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:48:13,126 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:48:13,126 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2018-01-29 23:48:13,126 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-29 23:48:13,126 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-29 23:48:13,127 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-29 23:48:13,127 INFO L87 Difference]: Start difference. First operand 374 states and 443 transitions. Second operand 8 states. [2018-01-29 23:48:13,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:48:13,280 INFO L93 Difference]: Finished difference Result 427 states and 488 transitions. [2018-01-29 23:48:13,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-29 23:48:13,280 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 73 [2018-01-29 23:48:13,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:48:13,282 INFO L225 Difference]: With dead ends: 427 [2018-01-29 23:48:13,282 INFO L226 Difference]: Without dead ends: 426 [2018-01-29 23:48:13,283 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 69 SyntacticMatches, 7 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-01-29 23:48:13,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2018-01-29 23:48:13,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 373. [2018-01-29 23:48:13,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-01-29 23:48:13,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 441 transitions. [2018-01-29 23:48:13,304 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 441 transitions. Word has length 73 [2018-01-29 23:48:13,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:48:13,305 INFO L432 AbstractCegarLoop]: Abstraction has 373 states and 441 transitions. [2018-01-29 23:48:13,305 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-29 23:48:13,305 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 441 transitions. [2018-01-29 23:48:13,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-01-29 23:48:13,306 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:48:13,306 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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] [2018-01-29 23:48:13,306 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-29 23:48:13,306 INFO L82 PathProgramCache]: Analyzing trace with hash 96824995, now seen corresponding path program 1 times [2018-01-29 23:48:13,306 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:48:13,307 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:48:13,307 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:13,308 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:48:13,308 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:13,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:48:13,326 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:48:13,491 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:48:13,492 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:48:13,492 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:48:13,497 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:48:13,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:48:13,524 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:48:13,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 23:48:13,533 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:13,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:13,535 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-29 23:48:13,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-01-29 23:48:13,587 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:13,593 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:13,593 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:19 [2018-01-29 23:48:13,627 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 13 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:48:13,648 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:48:13,648 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2018-01-29 23:48:13,648 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-29 23:48:13,648 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-29 23:48:13,648 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-01-29 23:48:13,649 INFO L87 Difference]: Start difference. First operand 373 states and 441 transitions. Second operand 12 states. [2018-01-29 23:48:14,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:48:14,066 INFO L93 Difference]: Finished difference Result 508 states and 591 transitions. [2018-01-29 23:48:14,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-29 23:48:14,066 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 73 [2018-01-29 23:48:14,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:48:14,068 INFO L225 Difference]: With dead ends: 508 [2018-01-29 23:48:14,068 INFO L226 Difference]: Without dead ends: 507 [2018-01-29 23:48:14,069 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2018-01-29 23:48:14,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2018-01-29 23:48:14,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 372. [2018-01-29 23:48:14,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2018-01-29 23:48:14,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 439 transitions. [2018-01-29 23:48:14,099 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 439 transitions. Word has length 73 [2018-01-29 23:48:14,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:48:14,099 INFO L432 AbstractCegarLoop]: Abstraction has 372 states and 439 transitions. [2018-01-29 23:48:14,100 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-29 23:48:14,100 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 439 transitions. [2018-01-29 23:48:14,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-01-29 23:48:14,100 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:48:14,101 INFO L350 BasicCegarLoop]: trace histogram [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] [2018-01-29 23:48:14,101 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-29 23:48:14,101 INFO L82 PathProgramCache]: Analyzing trace with hash 33695114, now seen corresponding path program 1 times [2018-01-29 23:48:14,101 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:48:14,101 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:48:14,102 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:14,102 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:48:14,102 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:14,114 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-29 23:48:14,114 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-29 23:48:14,114 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-29 23:48:14,121 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:48:14,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:48:14,161 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:48:14,199 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:48:14,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:48:14,202 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:14,204 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:14,213 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:48:14,214 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-01-29 23:48:14,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-01-29 23:48:14,223 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:14,228 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:14,228 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-01-29 23:48:14,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2018-01-29 23:48:14,319 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 0 case distinctions, treesize of input 21 treesize of output 23 [2018-01-29 23:48:14,320 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:14,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:48:14,352 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:14,361 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:14,375 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:48:14,376 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-01-29 23:48:14,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 28 [2018-01-29 23:48:14,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2018-01-29 23:48:14,431 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:14,442 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 17 treesize of output 10 [2018-01-29 23:48:14,442 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:14,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 5 [2018-01-29 23:48:14,457 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:14,462 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:14,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:48:14,466 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:33, output treesize:11 [2018-01-29 23:48:14,481 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:48:14,502 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-01-29 23:48:14,502 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-01-29 23:48:14,502 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-29 23:48:14,502 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-29 23:48:14,502 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-01-29 23:48:14,503 INFO L87 Difference]: Start difference. First operand 372 states and 439 transitions. Second operand 9 states. [2018-01-29 23:48:14,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:48:14,757 INFO L93 Difference]: Finished difference Result 402 states and 472 transitions. [2018-01-29 23:48:14,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-29 23:48:14,757 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 73 [2018-01-29 23:48:14,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:48:14,758 INFO L225 Difference]: With dead ends: 402 [2018-01-29 23:48:14,758 INFO L226 Difference]: Without dead ends: 401 [2018-01-29 23:48:14,759 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2018-01-29 23:48:14,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2018-01-29 23:48:14,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 371. [2018-01-29 23:48:14,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-01-29 23:48:14,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 437 transitions. [2018-01-29 23:48:14,777 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 437 transitions. Word has length 73 [2018-01-29 23:48:14,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:48:14,778 INFO L432 AbstractCegarLoop]: Abstraction has 371 states and 437 transitions. [2018-01-29 23:48:14,778 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-29 23:48:14,778 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 437 transitions. [2018-01-29 23:48:14,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-01-29 23:48:14,779 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:48:14,779 INFO L350 BasicCegarLoop]: trace histogram [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] [2018-01-29 23:48:14,779 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-29 23:48:14,779 INFO L82 PathProgramCache]: Analyzing trace with hash 33695115, now seen corresponding path program 1 times [2018-01-29 23:48:14,780 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:48:14,780 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:48:14,780 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:14,781 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:48:14,781 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:14,792 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-29 23:48:14,792 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-29 23:48:14,792 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 (exit command is (exit), workingDir is null) [2018-01-29 23:48:14,810 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-29 23:48:14,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:48:14,852 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:48:14,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:48:14,856 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:14,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:14,864 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-29 23:48:14,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-29 23:48:14,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:48:14,917 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:14,923 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:14,935 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:48:14,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:48:14,939 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:14,941 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:14,951 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:48:14,951 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:40, output treesize:34 [2018-01-29 23:48:14,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2018-01-29 23:48:14,974 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:14,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:14,983 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:31 [2018-01-29 23:48:15,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2018-01-29 23:48:15,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2018-01-29 23:48:15,078 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:15,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:48:15,093 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:15,101 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:15,172 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 40 [2018-01-29 23:48:15,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2018-01-29 23:48:15,176 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:15,193 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:15,202 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:48:15,202 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:61, output treesize:53 [2018-01-29 23:48:15,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 28 [2018-01-29 23:48:15,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 5 [2018-01-29 23:48:15,242 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:15,250 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:15,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, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2018-01-29 23:48:15,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-01-29 23:48:15,271 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:15,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2018-01-29 23:48:15,289 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:15,328 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 25 treesize of output 9 [2018-01-29 23:48:15,328 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:15,334 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:15,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:48:15,347 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:67, output treesize:19 [2018-01-29 23:48:15,371 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:48:15,392 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-01-29 23:48:15,392 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-01-29 23:48:15,393 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-29 23:48:15,393 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-29 23:48:15,393 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=82, Unknown=2, NotChecked=0, Total=110 [2018-01-29 23:48:15,393 INFO L87 Difference]: Start difference. First operand 371 states and 437 transitions. Second operand 11 states. [2018-01-29 23:48:15,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:48:15,711 INFO L93 Difference]: Finished difference Result 524 states and 618 transitions. [2018-01-29 23:48:15,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-29 23:48:15,712 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 73 [2018-01-29 23:48:15,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:48:15,715 INFO L225 Difference]: With dead ends: 524 [2018-01-29 23:48:15,715 INFO L226 Difference]: Without dead ends: 523 [2018-01-29 23:48:15,715 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=269, Unknown=4, NotChecked=0, Total=380 [2018-01-29 23:48:15,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2018-01-29 23:48:15,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 344. [2018-01-29 23:48:15,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2018-01-29 23:48:15,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 409 transitions. [2018-01-29 23:48:15,735 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 409 transitions. Word has length 73 [2018-01-29 23:48:15,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:48:15,735 INFO L432 AbstractCegarLoop]: Abstraction has 344 states and 409 transitions. [2018-01-29 23:48:15,735 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-29 23:48:15,735 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 409 transitions. [2018-01-29 23:48:15,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-01-29 23:48:15,736 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:48:15,736 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] [2018-01-29 23:48:15,737 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-29 23:48:15,737 INFO L82 PathProgramCache]: Analyzing trace with hash -806409671, now seen corresponding path program 1 times [2018-01-29 23:48:15,737 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:48:15,737 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:48:15,738 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:15,738 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:48:15,738 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:15,748 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-29 23:48:15,748 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-29 23:48:15,748 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-29 23:48:15,756 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:48:15,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:48:15,791 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:48:15,813 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:48:15,834 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-01-29 23:48:15,834 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-01-29 23:48:15,834 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 23:48:15,834 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 23:48:15,834 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-29 23:48:15,834 INFO L87 Difference]: Start difference. First operand 344 states and 409 transitions. Second operand 6 states. [2018-01-29 23:48:15,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:48:15,881 INFO L93 Difference]: Finished difference Result 678 states and 809 transitions. [2018-01-29 23:48:15,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-29 23:48:15,882 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 79 [2018-01-29 23:48:15,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:48:15,883 INFO L225 Difference]: With dead ends: 678 [2018-01-29 23:48:15,883 INFO L226 Difference]: Without dead ends: 406 [2018-01-29 23:48:15,883 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-01-29 23:48:15,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2018-01-29 23:48:15,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 386. [2018-01-29 23:48:15,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2018-01-29 23:48:15,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 451 transitions. [2018-01-29 23:48:15,895 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 451 transitions. Word has length 79 [2018-01-29 23:48:15,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:48:15,895 INFO L432 AbstractCegarLoop]: Abstraction has 386 states and 451 transitions. [2018-01-29 23:48:15,895 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 23:48:15,896 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 451 transitions. [2018-01-29 23:48:15,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-01-29 23:48:15,896 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:48:15,896 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:15,896 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-29 23:48:15,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1985849206, now seen corresponding path program 1 times [2018-01-29 23:48:15,896 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:48:15,897 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:48:15,897 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:15,897 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:48:15,897 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:15,904 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-29 23:48:15,904 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-29 23:48:15,904 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-29 23:48:15,911 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:48:15,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:48:15,940 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:48:16,029 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:16,030 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:16,032 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:48:16,032 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:16,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-01-29 23:48:16,041 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:16,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:16,045 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-01-29 23:48:16,120 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:48:16,141 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-01-29 23:48:16,141 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-01-29 23:48:16,141 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 23:48:16,141 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 23:48:16,142 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-29 23:48:16,142 INFO L87 Difference]: Start difference. First operand 386 states and 451 transitions. Second operand 6 states. [2018-01-29 23:48:16,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:48:16,323 INFO L93 Difference]: Finished difference Result 546 states and 629 transitions. [2018-01-29 23:48:16,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 23:48:16,323 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2018-01-29 23:48:16,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:48:16,325 INFO L225 Difference]: With dead ends: 546 [2018-01-29 23:48:16,325 INFO L226 Difference]: Without dead ends: 545 [2018-01-29 23:48:16,326 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-29 23:48:16,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2018-01-29 23:48:16,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 402. [2018-01-29 23:48:16,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2018-01-29 23:48:16,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 469 transitions. [2018-01-29 23:48:16,341 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 469 transitions. Word has length 81 [2018-01-29 23:48:16,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:48:16,342 INFO L432 AbstractCegarLoop]: Abstraction has 402 states and 469 transitions. [2018-01-29 23:48:16,342 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 23:48:16,342 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 469 transitions. [2018-01-29 23:48:16,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-01-29 23:48:16,342 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:48:16,342 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:48:16,342 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-29 23:48:16,343 INFO L82 PathProgramCache]: Analyzing trace with hash 248738886, now seen corresponding path program 1 times [2018-01-29 23:48:16,343 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:48:16,343 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:48:16,343 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:16,343 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:48:16,343 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:16,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:48:16,357 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:48:16,414 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 22 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:48:16,415 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:48:16,415 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:48:16,423 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:48:16,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:48:16,458 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:48:16,485 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-01-29 23:48:16,516 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-29 23:48:16,516 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2018-01-29 23:48:16,517 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-29 23:48:16,517 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-29 23:48:16,517 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-29 23:48:16,517 INFO L87 Difference]: Start difference. First operand 402 states and 469 transitions. Second operand 7 states. [2018-01-29 23:48:16,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:48:16,691 INFO L93 Difference]: Finished difference Result 633 states and 739 transitions. [2018-01-29 23:48:16,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-29 23:48:16,692 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 84 [2018-01-29 23:48:16,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:48:16,693 INFO L225 Difference]: With dead ends: 633 [2018-01-29 23:48:16,693 INFO L226 Difference]: Without dead ends: 375 [2018-01-29 23:48:16,694 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-01-29 23:48:16,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-01-29 23:48:16,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 363. [2018-01-29 23:48:16,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-01-29 23:48:16,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 421 transitions. [2018-01-29 23:48:16,705 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 421 transitions. Word has length 84 [2018-01-29 23:48:16,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:48:16,706 INFO L432 AbstractCegarLoop]: Abstraction has 363 states and 421 transitions. [2018-01-29 23:48:16,706 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-29 23:48:16,706 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 421 transitions. [2018-01-29 23:48:16,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-01-29 23:48:16,706 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:48:16,706 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:16,706 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-29 23:48:16,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1554252231, now seen corresponding path program 1 times [2018-01-29 23:48:16,707 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:48:16,707 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:48:16,707 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:16,708 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:48:16,708 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:16,715 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-29 23:48:16,715 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-29 23:48:16,715 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-29 23:48:16,744 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:48:16,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:48:16,781 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:48:16,823 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-29 23:48:16,856 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:48:16,857 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-29 23:48:16,857 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 23:48:16,857 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 23:48:16,857 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-29 23:48:16,858 INFO L87 Difference]: Start difference. First operand 363 states and 421 transitions. Second operand 6 states. [2018-01-29 23:48:17,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:48:17,004 INFO L93 Difference]: Finished difference Result 409 states and 473 transitions. [2018-01-29 23:48:17,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-29 23:48:17,004 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 84 [2018-01-29 23:48:17,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:48:17,006 INFO L225 Difference]: With dead ends: 409 [2018-01-29 23:48:17,006 INFO L226 Difference]: Without dead ends: 408 [2018-01-29 23:48:17,006 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-01-29 23:48:17,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2018-01-29 23:48:17,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 363. [2018-01-29 23:48:17,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-01-29 23:48:17,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 419 transitions. [2018-01-29 23:48:17,025 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 419 transitions. Word has length 84 [2018-01-29 23:48:17,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:48:17,025 INFO L432 AbstractCegarLoop]: Abstraction has 363 states and 419 transitions. [2018-01-29 23:48:17,025 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 23:48:17,025 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 419 transitions. [2018-01-29 23:48:17,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-01-29 23:48:17,026 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:48:17,026 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:48:17,026 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-29 23:48:17,026 INFO L82 PathProgramCache]: Analyzing trace with hash 839281588, now seen corresponding path program 1 times [2018-01-29 23:48:17,026 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:48:17,026 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:48:17,027 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:17,027 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:48:17,027 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:17,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:48:17,041 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:48:17,119 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 26 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:48:17,120 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:48:17,120 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:48:17,125 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:48:17,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:48:17,152 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:48:17,180 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:48:17,202 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-29 23:48:17,202 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2018-01-29 23:48:17,202 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-29 23:48:17,202 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-29 23:48:17,202 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-01-29 23:48:17,202 INFO L87 Difference]: Start difference. First operand 363 states and 419 transitions. Second operand 9 states. [2018-01-29 23:48:17,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:48:17,274 INFO L93 Difference]: Finished difference Result 374 states and 429 transitions. [2018-01-29 23:48:17,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-29 23:48:17,274 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2018-01-29 23:48:17,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:48:17,275 INFO L225 Difference]: With dead ends: 374 [2018-01-29 23:48:17,275 INFO L226 Difference]: Without dead ends: 371 [2018-01-29 23:48:17,276 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-01-29 23:48:17,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-01-29 23:48:17,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 355. [2018-01-29 23:48:17,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2018-01-29 23:48:17,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 409 transitions. [2018-01-29 23:48:17,288 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 409 transitions. Word has length 87 [2018-01-29 23:48:17,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:48:17,288 INFO L432 AbstractCegarLoop]: Abstraction has 355 states and 409 transitions. [2018-01-29 23:48:17,288 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-29 23:48:17,288 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 409 transitions. [2018-01-29 23:48:17,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-01-29 23:48:17,289 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:48:17,289 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:17,289 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-29 23:48:17,289 INFO L82 PathProgramCache]: Analyzing trace with hash -137493737, now seen corresponding path program 1 times [2018-01-29 23:48:17,289 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:48:17,289 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:48:17,290 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:17,290 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:48:17,290 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:17,297 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-29 23:48:17,297 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-29 23:48:17,297 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-29 23:48:17,318 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:48:17,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:48:17,350 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:48:17,390 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-29 23:48:17,412 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:48:17,412 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-29 23:48:17,412 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-29 23:48:17,412 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-29 23:48:17,412 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-29 23:48:17,413 INFO L87 Difference]: Start difference. First operand 355 states and 409 transitions. Second operand 7 states. [2018-01-29 23:48:17,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:48:17,530 INFO L93 Difference]: Finished difference Result 388 states and 450 transitions. [2018-01-29 23:48:17,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-29 23:48:17,530 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 89 [2018-01-29 23:48:17,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:48:17,531 INFO L225 Difference]: With dead ends: 388 [2018-01-29 23:48:17,532 INFO L226 Difference]: Without dead ends: 387 [2018-01-29 23:48:17,532 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-01-29 23:48:17,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-01-29 23:48:17,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 352. [2018-01-29 23:48:17,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2018-01-29 23:48:17,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 404 transitions. [2018-01-29 23:48:17,544 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 404 transitions. Word has length 89 [2018-01-29 23:48:17,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:48:17,544 INFO L432 AbstractCegarLoop]: Abstraction has 352 states and 404 transitions. [2018-01-29 23:48:17,545 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-29 23:48:17,545 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 404 transitions. [2018-01-29 23:48:17,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-01-29 23:48:17,545 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:48:17,545 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:17,545 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-29 23:48:17,545 INFO L82 PathProgramCache]: Analyzing trace with hash 32662798, now seen corresponding path program 1 times [2018-01-29 23:48:17,546 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:48:17,546 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:48:17,546 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:17,546 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:48:17,546 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:17,552 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-29 23:48:17,552 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-29 23:48:17,552 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-29 23:48:17,562 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:48:17,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:48:17,595 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:48:17,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-29 23:48:17,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:48:17,643 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:17,651 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:17,658 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:48:17,658 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-01-29 23:48:17,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-01-29 23:48:17,690 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 13 treesize of output 5 [2018-01-29 23:48:17,690 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:17,691 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:17,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:17,692 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-01-29 23:48:17,707 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:48:17,727 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:48:17,727 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-29 23:48:17,728 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-29 23:48:17,728 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-29 23:48:17,728 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-29 23:48:17,728 INFO L87 Difference]: Start difference. First operand 352 states and 404 transitions. Second operand 8 states. [2018-01-29 23:48:17,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:48:17,954 INFO L93 Difference]: Finished difference Result 394 states and 438 transitions. [2018-01-29 23:48:17,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-29 23:48:17,955 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 90 [2018-01-29 23:48:17,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:48:17,956 INFO L225 Difference]: With dead ends: 394 [2018-01-29 23:48:17,956 INFO L226 Difference]: Without dead ends: 393 [2018-01-29 23:48:17,956 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2018-01-29 23:48:17,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2018-01-29 23:48:17,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 356. [2018-01-29 23:48:17,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-01-29 23:48:17,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 410 transitions. [2018-01-29 23:48:17,969 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 410 transitions. Word has length 90 [2018-01-29 23:48:17,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:48:17,969 INFO L432 AbstractCegarLoop]: Abstraction has 356 states and 410 transitions. [2018-01-29 23:48:17,969 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-29 23:48:17,970 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 410 transitions. [2018-01-29 23:48:17,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-01-29 23:48:17,970 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:48:17,970 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:17,970 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-29 23:48:17,970 INFO L82 PathProgramCache]: Analyzing trace with hash 32662799, now seen corresponding path program 1 times [2018-01-29 23:48:17,971 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:48:17,971 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:48:17,971 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:17,971 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:48:17,971 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:17,978 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-29 23:48:17,978 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-29 23:48:17,978 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-29 23:48:17,991 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:48:18,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:48:18,032 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:48:18,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, 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:48:18,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:48:18,104 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:18,106 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:18,119 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:48:18,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:48:18,121 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:18,123 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:18,132 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:48:18,132 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:42, output treesize:36 [2018-01-29 23:48:18,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-01-29 23:48:18,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 19 treesize of output 11 [2018-01-29 23:48:18,187 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:18,189 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:18,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2018-01-29 23:48:18,200 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2018-01-29 23:48:18,201 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:18,205 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:18,212 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:48:18,212 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:50, output treesize:14 [2018-01-29 23:48:18,254 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:48:18,274 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:48:18,274 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-01-29 23:48:18,275 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-29 23:48:18,275 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-29 23:48:18,275 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-01-29 23:48:18,275 INFO L87 Difference]: Start difference. First operand 356 states and 410 transitions. Second operand 14 states. [2018-01-29 23:48:18,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:48:18,891 INFO L93 Difference]: Finished difference Result 489 states and 560 transitions. [2018-01-29 23:48:18,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-29 23:48:18,891 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 90 [2018-01-29 23:48:18,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:48:18,893 INFO L225 Difference]: With dead ends: 489 [2018-01-29 23:48:18,893 INFO L226 Difference]: Without dead ends: 488 [2018-01-29 23:48:18,893 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=259, Invalid=611, Unknown=0, NotChecked=0, Total=870 [2018-01-29 23:48:18,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2018-01-29 23:48:18,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 356. [2018-01-29 23:48:18,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-01-29 23:48:18,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 409 transitions. [2018-01-29 23:48:18,907 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 409 transitions. Word has length 90 [2018-01-29 23:48:18,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:48:18,907 INFO L432 AbstractCegarLoop]: Abstraction has 356 states and 409 transitions. [2018-01-29 23:48:18,907 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-29 23:48:18,907 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 409 transitions. [2018-01-29 23:48:18,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-01-29 23:48:18,908 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:48:18,908 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, 1, 1, 1, 1, 1] [2018-01-29 23:48:18,908 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-29 23:48:18,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1937018596, now seen corresponding path program 1 times [2018-01-29 23:48:18,908 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:48:18,908 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:48:18,909 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:18,909 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:48:18,909 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:18,915 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-29 23:48:18,915 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-29 23:48:18,915 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-29 23:48:18,925 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:48:18,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:48:18,958 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:48:19,051 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:19,052 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:19,052 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:48:19,053 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:19,057 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:19,057 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-01-29 23:48:19,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-29 23:48:19,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-29 23:48:19,077 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:19,079 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:19,084 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:48:19,084 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:15 [2018-01-29 23:48:19,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-01-29 23:48:19,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 13 [2018-01-29 23:48:19,154 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 23:48:19,157 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 23:48:19,164 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-29 23:48:19,164 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:22 [2018-01-29 23:48:19,210 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:48:19,230 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-01-29 23:48:19,230 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-01-29 23:48:19,231 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-29 23:48:19,231 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-29 23:48:19,231 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-01-29 23:48:19,231 INFO L87 Difference]: Start difference. First operand 356 states and 409 transitions. Second operand 14 states. [2018-01-29 23:48:19,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:48:19,992 INFO L93 Difference]: Finished difference Result 514 states and 571 transitions. [2018-01-29 23:48:19,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-29 23:48:19,993 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 93 [2018-01-29 23:48:19,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:48:19,994 INFO L225 Difference]: With dead ends: 514 [2018-01-29 23:48:19,994 INFO L226 Difference]: Without dead ends: 508 [2018-01-29 23:48:19,995 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=256, Invalid=674, Unknown=0, NotChecked=0, Total=930 [2018-01-29 23:48:19,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2018-01-29 23:48:20,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 356. [2018-01-29 23:48:20,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-01-29 23:48:20,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 408 transitions. [2018-01-29 23:48:20,009 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 408 transitions. Word has length 93 [2018-01-29 23:48:20,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:48:20,009 INFO L432 AbstractCegarLoop]: Abstraction has 356 states and 408 transitions. [2018-01-29 23:48:20,009 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-29 23:48:20,009 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 408 transitions. [2018-01-29 23:48:20,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-01-29 23:48:20,010 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:48:20,010 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:20,010 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-29 23:48:20,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1900018942, now seen corresponding path program 1 times [2018-01-29 23:48:20,010 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:48:20,010 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:48:20,011 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:20,011 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:48:20,011 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:20,017 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-29 23:48:20,017 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-29 23:48:20,017 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-29 23:48:20,028 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:48:20,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:48:20,059 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:48:20,083 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-29 23:48:20,104 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:48:20,104 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 23:48:20,104 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-29 23:48:20,105 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-29 23:48:20,105 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-29 23:48:20,105 INFO L87 Difference]: Start difference. First operand 356 states and 408 transitions. Second operand 4 states. [2018-01-29 23:48:20,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:48:20,188 INFO L93 Difference]: Finished difference Result 378 states and 438 transitions. [2018-01-29 23:48:20,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-29 23:48:20,189 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2018-01-29 23:48:20,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:48:20,191 INFO L225 Difference]: With dead ends: 378 [2018-01-29 23:48:20,191 INFO L226 Difference]: Without dead ends: 376 [2018-01-29 23:48:20,191 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 90 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:48:20,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2018-01-29 23:48:20,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 354. [2018-01-29 23:48:20,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-01-29 23:48:20,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 399 transitions. [2018-01-29 23:48:20,210 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 399 transitions. Word has length 93 [2018-01-29 23:48:20,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:48:20,210 INFO L432 AbstractCegarLoop]: Abstraction has 354 states and 399 transitions. [2018-01-29 23:48:20,210 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-29 23:48:20,210 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 399 transitions. [2018-01-29 23:48:20,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-01-29 23:48:20,211 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:48:20,211 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:20,211 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-29 23:48:20,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1900018941, now seen corresponding path program 1 times [2018-01-29 23:48:20,211 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:48:20,211 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:48:20,212 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:20,212 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:48:20,212 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:20,218 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-29 23:48:20,218 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-29 23:48:20,218 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-29 23:48:20,225 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:48:20,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:48:20,265 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:48:20,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-29 23:48:20,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 8 treesize of output 7 [2018-01-29 23:48:20,287 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:20,289 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:20,302 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:48:20,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:48:20,307 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:20,309 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:20,315 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:48:20,315 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:30, output treesize:15 [2018-01-29 23:48:20,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-01-29 23:48:20,349 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 19 treesize of output 11 [2018-01-29 23:48:20,349 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:20,351 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:20,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-29 23:48:20,361 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-29 23:48:20,361 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:20,365 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:20,366 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:48:20,367 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:30, output treesize:7 [2018-01-29 23:48:20,432 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:48:20,452 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:48:20,453 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-29 23:48:20,453 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-29 23:48:20,453 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-29 23:48:20,453 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-29 23:48:20,453 INFO L87 Difference]: Start difference. First operand 354 states and 399 transitions. Second operand 10 states. [2018-01-29 23:48:20,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:48:20,797 INFO L93 Difference]: Finished difference Result 396 states and 437 transitions. [2018-01-29 23:48:20,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-29 23:48:20,797 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 93 [2018-01-29 23:48:20,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:48:20,799 INFO L225 Difference]: With dead ends: 396 [2018-01-29 23:48:20,799 INFO L226 Difference]: Without dead ends: 395 [2018-01-29 23:48:20,799 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2018-01-29 23:48:20,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-01-29 23:48:20,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 357. [2018-01-29 23:48:20,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2018-01-29 23:48:20,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 402 transitions. [2018-01-29 23:48:20,813 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 402 transitions. Word has length 93 [2018-01-29 23:48:20,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:48:20,814 INFO L432 AbstractCegarLoop]: Abstraction has 357 states and 402 transitions. [2018-01-29 23:48:20,814 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-29 23:48:20,814 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 402 transitions. [2018-01-29 23:48:20,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-01-29 23:48:20,814 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:48:20,815 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:20,815 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-29 23:48:20,815 INFO L82 PathProgramCache]: Analyzing trace with hash -90158155, now seen corresponding path program 1 times [2018-01-29 23:48:20,815 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:48:20,815 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:48:20,815 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:20,816 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:48:20,816 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:20,822 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-29 23:48:20,822 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-29 23:48:20,822 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-29 23:48:20,832 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:48:20,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:48:20,869 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:48:20,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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:48:20,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:48:20,933 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:20,935 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:20,940 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:48:20,940 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2018-01-29 23:48:21,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-01-29 23:48:21,010 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 16 treesize of output 7 [2018-01-29 23:48:21,010 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:21,013 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:21,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:21,019 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:7 [2018-01-29 23:48:21,058 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:48:21,080 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:48:21,080 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-01-29 23:48:21,080 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-29 23:48:21,080 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-29 23:48:21,080 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-01-29 23:48:21,081 INFO L87 Difference]: Start difference. First operand 357 states and 402 transitions. Second operand 14 states. [2018-01-29 23:48:21,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:48:21,920 INFO L93 Difference]: Finished difference Result 706 states and 795 transitions. [2018-01-29 23:48:21,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-01-29 23:48:21,921 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 96 [2018-01-29 23:48:21,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:48:21,923 INFO L225 Difference]: With dead ends: 706 [2018-01-29 23:48:21,923 INFO L226 Difference]: Without dead ends: 705 [2018-01-29 23:48:21,924 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=480, Invalid=1326, Unknown=0, NotChecked=0, Total=1806 [2018-01-29 23:48:21,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2018-01-29 23:48:21,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 418. [2018-01-29 23:48:21,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2018-01-29 23:48:21,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 473 transitions. [2018-01-29 23:48:21,942 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 473 transitions. Word has length 96 [2018-01-29 23:48:21,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:48:21,942 INFO L432 AbstractCegarLoop]: Abstraction has 418 states and 473 transitions. [2018-01-29 23:48:21,942 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-29 23:48:21,942 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 473 transitions. [2018-01-29 23:48:21,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-01-29 23:48:21,942 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:48:21,943 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, 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] [2018-01-29 23:48:21,943 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-29 23:48:21,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1469681024, now seen corresponding path program 1 times [2018-01-29 23:48:21,943 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:48:21,943 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:48:21,944 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:21,944 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:48:21,944 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:21,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:48:21,956 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:48:22,058 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:48:22,058 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:48:22,059 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:48:22,069 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:48:22,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:48:22,111 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:48:22,137 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:48:22,168 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:48:22,168 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-01-29 23:48:22,168 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-29 23:48:22,168 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-29 23:48:22,169 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-01-29 23:48:22,169 INFO L87 Difference]: Start difference. First operand 418 states and 473 transitions. Second operand 10 states. [2018-01-29 23:48:22,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:48:22,293 INFO L93 Difference]: Finished difference Result 692 states and 784 transitions. [2018-01-29 23:48:22,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-29 23:48:22,293 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2018-01-29 23:48:22,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:48:22,295 INFO L225 Difference]: With dead ends: 692 [2018-01-29 23:48:22,295 INFO L226 Difference]: Without dead ends: 573 [2018-01-29 23:48:22,295 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 96 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:48:22,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2018-01-29 23:48:22,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 534. [2018-01-29 23:48:22,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2018-01-29 23:48:22,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 593 transitions. [2018-01-29 23:48:22,317 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 593 transitions. Word has length 97 [2018-01-29 23:48:22,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:48:22,317 INFO L432 AbstractCegarLoop]: Abstraction has 534 states and 593 transitions. [2018-01-29 23:48:22,317 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-29 23:48:22,317 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 593 transitions. [2018-01-29 23:48:22,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-01-29 23:48:22,318 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:48:22,318 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, 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] [2018-01-29 23:48:22,318 INFO L371 AbstractCegarLoop]: === Iteration 41 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-29 23:48:22,318 INFO L82 PathProgramCache]: Analyzing trace with hash 630997827, now seen corresponding path program 1 times [2018-01-29 23:48:22,319 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:48:22,319 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:48:22,319 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:22,320 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:48:22,320 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:22,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:48:22,342 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:48:22,773 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 18 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:48:22,773 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:48:22,773 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:48:22,778 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:48:22,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:48:22,815 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:48:22,878 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:48:22,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-29 23:48:22,879 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:22,881 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:22,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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:48:22,891 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:48:22,891 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:22,892 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:22,898 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:22,898 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-01-29 23:48:22,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-01-29 23:48:22,927 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:22,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-29 23:48:22,928 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:22,933 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:22,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-01-29 23:48:22,968 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:22,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-29 23:48:22,969 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:22,973 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:22,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:22,981 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:52, output treesize:44 [2018-01-29 23:48:23,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-01-29 23:48:23,015 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:23,015 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:23,017 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:23,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-01-29 23:48:23,020 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:23,026 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:23,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-01-29 23:48:23,044 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:23,044 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:23,045 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:23,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-01-29 23:48:23,048 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:23,053 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:23,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:23,062 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:82, output treesize:44 [2018-01-29 23:48:23,129 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:23,129 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:23,130 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:48:23,130 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:23,143 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:23,144 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:49 [2018-01-29 23:48:23,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-01-29 23:48:23,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:48:23,219 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:23,225 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:23,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-01-29 23:48:23,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:48:23,247 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:23,252 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:23,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:23,266 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:75, output treesize:67 [2018-01-29 23:48:23,309 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 38 [2018-01-29 23:48:23,312 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:23,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-01-29 23:48:23,313 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:23,321 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:23,346 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 38 [2018-01-29 23:48:23,349 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:23,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-01-29 23:48:23,350 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:23,357 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:23,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:23,375 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:93, output treesize:85 [2018-01-29 23:48:23,425 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 43 [2018-01-29 23:48:23,432 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:23,436 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:23,437 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:23,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-01-29 23:48:23,440 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:23,452 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:23,482 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 43 [2018-01-29 23:48:23,485 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:23,486 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:23,487 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:23,489 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-01-29 23:48:23,490 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:23,501 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:23,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:23,524 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:107, output treesize:99 [2018-01-29 23:48:23,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 50 [2018-01-29 23:48:23,586 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:23,587 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:23,588 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:23,589 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:23,590 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:23,591 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:23,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 77 [2018-01-29 23:48:23,597 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:23,615 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:23,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 50 [2018-01-29 23:48:23,655 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:23,656 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:23,656 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:23,657 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:23,658 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:23,659 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:23,663 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 77 [2018-01-29 23:48:23,663 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:23,680 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:23,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:23,707 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:125, output treesize:117 [2018-01-29 23:48:23,779 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 70 treesize of output 63 [2018-01-29 23:48:23,783 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:23,784 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:23,785 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:23,786 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:23,786 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:23,787 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:23,788 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:23,789 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:23,790 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:23,791 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:23,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 107 [2018-01-29 23:48:23,800 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:23,825 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:23,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 63 [2018-01-29 23:48:23,877 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:23,878 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:23,879 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:23,880 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:23,880 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:23,881 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:23,882 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:23,883 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:23,884 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:23,884 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:23,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 107 [2018-01-29 23:48:23,894 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:23,917 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:23,955 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:23,955 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:155, output treesize:117 [2018-01-29 23:48:23,975 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 64 treesize of output 61 [2018-01-29 23:48:23,979 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:23,981 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:23,982 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:23,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, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-01-29 23:48:23,983 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:24,005 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:24,046 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 64 treesize of output 85 [2018-01-29 23:48:24,050 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:24,051 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:24,051 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:24,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-01-29 23:48:24,054 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:24,069 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:24,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:24,102 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:143, output treesize:159 [2018-01-29 23:48:24,217 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 277 treesize of output 239 [2018-01-29 23:48:24,226 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:24,227 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:24,228 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:24,228 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:24,229 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:24,230 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:24,233 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:24,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 231 [2018-01-29 23:48:24,240 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:24,275 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:24,312 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:48:24,313 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 236 treesize of output 218 [2018-01-29 23:48:24,318 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:24,319 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:24,320 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:24,321 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:24,322 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:24,323 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:24,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 212 [2018-01-29 23:48:24,331 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:24,359 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:24,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:24,385 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:299, output treesize:237 [2018-01-29 23:48:24,519 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 222 treesize of output 177 [2018-01-29 23:48:24,524 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:24,524 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 144 treesize of output 169 [2018-01-29 23:48:24,525 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:24,554 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:24,555 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:24,568 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:24,569 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:24,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 172 treesize of output 192 [2018-01-29 23:48:24,615 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:48:24,639 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:48:24,664 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 94 treesize of output 72 [2018-01-29 23:48:24,667 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:24,668 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:24,669 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:24,670 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:24,671 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:24,672 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:24,672 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:48:24,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 94 [2018-01-29 23:48:24,678 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:24,695 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:24,695 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 18 treesize of output 10 [2018-01-29 23:48:24,696 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:24,699 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:24,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:24,707 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:251, output treesize:13 [2018-01-29 23:48:24,912 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 18 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:48:24,933 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:48:24,934 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 20] total 34 [2018-01-29 23:48:24,934 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-01-29 23:48:24,934 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-01-29 23:48:24,935 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=978, Unknown=0, NotChecked=0, Total=1122 [2018-01-29 23:48:24,935 INFO L87 Difference]: Start difference. First operand 534 states and 593 transitions. Second operand 34 states. [2018-01-29 23:48:25,882 WARN L146 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 95 DAG size of output 87 [2018-01-29 23:48:26,249 WARN L146 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 111 DAG size of output 82 [2018-01-29 23:48:26,420 WARN L146 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 113 DAG size of output 84 [2018-01-29 23:48:26,804 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 83 DAG size of output 79 [2018-01-29 23:48:27,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:48:27,210 INFO L93 Difference]: Finished difference Result 721 states and 807 transitions. [2018-01-29 23:48:27,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-01-29 23:48:27,210 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 99 [2018-01-29 23:48:27,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:48:27,212 INFO L225 Difference]: With dead ends: 721 [2018-01-29 23:48:27,212 INFO L226 Difference]: Without dead ends: 644 [2018-01-29 23:48:27,213 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 85 SyntacticMatches, 8 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 797 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=656, Invalid=3004, Unknown=0, NotChecked=0, Total=3660 [2018-01-29 23:48:27,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2018-01-29 23:48:27,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 553. [2018-01-29 23:48:27,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553 states. [2018-01-29 23:48:27,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 613 transitions. [2018-01-29 23:48:27,235 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 613 transitions. Word has length 99 [2018-01-29 23:48:27,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:48:27,236 INFO L432 AbstractCegarLoop]: Abstraction has 553 states and 613 transitions. [2018-01-29 23:48:27,236 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-01-29 23:48:27,236 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 613 transitions. [2018-01-29 23:48:27,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-01-29 23:48:27,237 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:48:27,237 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:48:27,237 INFO L371 AbstractCegarLoop]: === Iteration 42 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-29 23:48:27,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1546904374, now seen corresponding path program 1 times [2018-01-29 23:48:27,237 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:48:27,237 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:48:27,238 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:27,238 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:48:27,238 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:27,244 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-29 23:48:27,244 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-29 23:48:27,244 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-29 23:48:27,249 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:48:27,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:48:27,279 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:48:27,324 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:48:27,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-29 23:48:27,325 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:27,326 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:27,331 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:48:27,331 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2018-01-29 23:48:27,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-01-29 23:48:27,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-01-29 23:48:27,360 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:27,361 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:27,365 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:27,365 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:16 [2018-01-29 23:48:27,418 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:27,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, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-01-29 23:48:27,418 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:27,423 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:48:27,423 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:15 [2018-01-29 23:48:27,455 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:48:27,485 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-01-29 23:48:27,485 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-01-29 23:48:27,486 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-29 23:48:27,486 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-29 23:48:27,486 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2018-01-29 23:48:27,486 INFO L87 Difference]: Start difference. First operand 553 states and 613 transitions. Second operand 17 states. [2018-01-29 23:48:28,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:48:28,241 INFO L93 Difference]: Finished difference Result 691 states and 773 transitions. [2018-01-29 23:48:28,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-29 23:48:28,241 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 99 [2018-01-29 23:48:28,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:48:28,243 INFO L225 Difference]: With dead ends: 691 [2018-01-29 23:48:28,244 INFO L226 Difference]: Without dead ends: 690 [2018-01-29 23:48:28,244 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=336, Invalid=1070, Unknown=0, NotChecked=0, Total=1406 [2018-01-29 23:48:28,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2018-01-29 23:48:28,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 553. [2018-01-29 23:48:28,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553 states. [2018-01-29 23:48:28,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 613 transitions. [2018-01-29 23:48:28,267 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 613 transitions. Word has length 99 [2018-01-29 23:48:28,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:48:28,267 INFO L432 AbstractCegarLoop]: Abstraction has 553 states and 613 transitions. [2018-01-29 23:48:28,267 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-29 23:48:28,267 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 613 transitions. [2018-01-29 23:48:28,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-01-29 23:48:28,268 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:48:28,268 INFO L350 BasicCegarLoop]: trace histogram [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, 1, 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:48:28,268 INFO L371 AbstractCegarLoop]: === Iteration 43 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-29 23:48:28,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1370178326, now seen corresponding path program 1 times [2018-01-29 23:48:28,268 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:48:28,268 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:48:28,269 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:28,269 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:48:28,269 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:28,274 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-29 23:48:28,274 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-29 23:48:28,274 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-29 23:48:28,279 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:48:28,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:48:28,309 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:48:28,316 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:48:28,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:48:28,317 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:28,318 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:28,321 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:28,321 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2018-01-29 23:48:28,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-01-29 23:48:28,330 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:28,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-29 23:48:28,331 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:28,334 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:28,338 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:28,338 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-01-29 23:48:28,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-01-29 23:48:28,350 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:28,351 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:28,352 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:28,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-01-29 23:48:28,354 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:28,359 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:28,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:28,364 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:23 [2018-01-29 23:48:28,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 40 [2018-01-29 23:48:28,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2018-01-29 23:48:28,410 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:28,428 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:28,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:28,437 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:45 [2018-01-29 23:48:28,473 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:48:28,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 52 [2018-01-29 23:48:28,500 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:28,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 65 [2018-01-29 23:48:28,514 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-01-29 23:48:28,572 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-29 23:48:28,598 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 3 xjuncts. [2018-01-29 23:48:28,598 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:66, output treesize:149 [2018-01-29 23:48:28,711 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 71 treesize of output 69 [2018-01-29 23:48:28,714 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:28,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 77 [2018-01-29 23:48:28,716 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:28,751 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 23:48:28,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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 60 [2018-01-29 23:48:28,832 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:28,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 64 [2018-01-29 23:48:28,833 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:28,862 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 23:48:28,938 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 60 [2018-01-29 23:48:28,941 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:28,942 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 64 [2018-01-29 23:48:28,942 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:28,974 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 23:48:29,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-01-29 23:48:29,020 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:188, output treesize:176 [2018-01-29 23:48:29,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 86 [2018-01-29 23:48:29,113 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:29,113 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:48:29,114 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:29,115 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:29,116 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:48:29,116 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:29,117 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:48:29,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 103 [2018-01-29 23:48:29,130 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 23:48:29,224 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:29,225 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:29,226 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:29,228 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 75 treesize of output 87 [2018-01-29 23:48:29,228 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:29,270 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 23:48:29,378 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 73 treesize of output 77 [2018-01-29 23:48:29,391 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:29,392 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:29,393 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:29,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 78 [2018-01-29 23:48:29,397 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:29,433 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:29,501 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 73 treesize of output 77 [2018-01-29 23:48:29,504 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:29,505 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:29,505 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:29,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 78 [2018-01-29 23:48:29,508 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:29,543 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:29,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-01-29 23:48:29,580 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:233, output treesize:176 [2018-01-29 23:48:29,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 110 treesize of output 81 [2018-01-29 23:48:29,601 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:29,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 69 [2018-01-29 23:48:29,609 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 23:48:29,636 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 23:48:29,712 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 85 treesize of output 82 [2018-01-29 23:48:29,713 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:48:29,713 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:29,725 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:29,728 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 91 treesize of output 88 [2018-01-29 23:48:29,730 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:48:29,730 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:29,743 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:29,746 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 78 [2018-01-29 23:48:29,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 8 treesize of output 7 [2018-01-29 23:48:29,747 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:29,759 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:29,761 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 89 treesize of output 86 [2018-01-29 23:48:29,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-29 23:48:29,763 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:29,776 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:29,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 74 [2018-01-29 23:48:29,859 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:48:29,893 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:29,894 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:29,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 81 [2018-01-29 23:48:29,895 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:29,923 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-29 23:48:29,999 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 68 [2018-01-29 23:48:30,002 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:30,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 61 [2018-01-29 23:48:30,004 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:30,015 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:30,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-29 23:48:30,048 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 6 variables, input treesize:287, output treesize:155 [2018-01-29 23:48:30,168 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 89 treesize of output 79 [2018-01-29 23:48:30,170 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 48 treesize of output 35 [2018-01-29 23:48:30,170 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:30,181 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:30,209 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 93 treesize of output 81 [2018-01-29 23:48:30,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 48 [2018-01-29 23:48:30,211 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:30,220 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:30,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-29 23:48:30,245 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:183, output treesize:133 [2018-01-29 23:48:30,430 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:30,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 61 [2018-01-29 23:48:30,434 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:30,444 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 34 [2018-01-29 23:48:30,445 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-29 23:48:30,460 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:30,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-01-29 23:48:30,461 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:30,469 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:30,491 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:30,492 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 78 treesize of output 59 [2018-01-29 23:48:30,494 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:30,495 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:30,500 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 45 [2018-01-29 23:48:30,501 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:48:30,519 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 21 treesize of output 14 [2018-01-29 23:48:30,519 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:30,527 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:30,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:30,540 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:157, output treesize:5 [2018-01-29 23:48:30,616 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:48:30,635 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-01-29 23:48:30,636 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-01-29 23:48:30,636 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-29 23:48:30,636 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-29 23:48:30,636 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2018-01-29 23:48:30,636 INFO L87 Difference]: Start difference. First operand 553 states and 613 transitions. Second operand 21 states. [2018-01-29 23:48:31,721 WARN L146 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 87 DAG size of output 75 [2018-01-29 23:48:31,897 WARN L146 SmtUtils]: Spent 150ms on a formula simplification. DAG size of input: 105 DAG size of output 81 [2018-01-29 23:48:32,054 WARN L146 SmtUtils]: Spent 137ms on a formula simplification. DAG size of input: 87 DAG size of output 75 [2018-01-29 23:48:32,315 WARN L146 SmtUtils]: Spent 233ms on a formula simplification. DAG size of input: 132 DAG size of output 105 [2018-01-29 23:48:32,601 WARN L146 SmtUtils]: Spent 242ms on a formula simplification. DAG size of input: 137 DAG size of output 110 [2018-01-29 23:48:33,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:48:33,020 INFO L93 Difference]: Finished difference Result 774 states and 865 transitions. [2018-01-29 23:48:33,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-01-29 23:48:33,020 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 99 [2018-01-29 23:48:33,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:48:33,022 INFO L225 Difference]: With dead ends: 774 [2018-01-29 23:48:33,022 INFO L226 Difference]: Without dead ends: 773 [2018-01-29 23:48:33,023 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 445 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=327, Invalid=1743, Unknown=0, NotChecked=0, Total=2070 [2018-01-29 23:48:33,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2018-01-29 23:48:33,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 595. [2018-01-29 23:48:33,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2018-01-29 23:48:33,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 660 transitions. [2018-01-29 23:48:33,051 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 660 transitions. Word has length 99 [2018-01-29 23:48:33,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:48:33,051 INFO L432 AbstractCegarLoop]: Abstraction has 595 states and 660 transitions. [2018-01-29 23:48:33,051 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-29 23:48:33,051 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 660 transitions. [2018-01-29 23:48:33,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-01-29 23:48:33,052 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:48:33,053 INFO L350 BasicCegarLoop]: trace histogram [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, 1, 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:48:33,053 INFO L371 AbstractCegarLoop]: === Iteration 44 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-29 23:48:33,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1370178325, now seen corresponding path program 1 times [2018-01-29 23:48:33,053 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:48:33,053 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:48:33,054 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:33,054 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:48:33,054 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:33,059 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-29 23:48:33,060 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-29 23:48:33,060 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-29 23:48:33,067 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:48:33,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:48:33,101 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:48:33,111 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:48:33,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:48:33,113 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:33,117 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:33,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, 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:48:33,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 8 treesize of output 7 [2018-01-29 23:48:33,124 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:33,125 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:33,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:33,129 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2018-01-29 23:48:33,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-01-29 23:48:33,140 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:33,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-29 23:48:33,141 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:33,145 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:33,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-01-29 23:48:33,164 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:33,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-29 23:48:33,165 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:33,169 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:33,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:33,176 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-01-29 23:48:33,191 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-01-29 23:48:33,194 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:33,194 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:33,195 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:33,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-01-29 23:48:33,198 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:33,204 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:33,215 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-01-29 23:48:33,217 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:33,218 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:33,218 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:33,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-01-29 23:48:33,221 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:33,225 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:33,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:33,232 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:77, output treesize:39 [2018-01-29 23:48:33,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 40 [2018-01-29 23:48:33,289 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:33,289 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:48:33,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2018-01-29 23:48:33,290 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:33,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2018-01-29 23:48:33,306 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:33,313 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:33,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 40 [2018-01-29 23:48:33,339 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:33,340 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:48:33,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2018-01-29 23:48:33,340 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:33,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2018-01-29 23:48:33,356 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:33,363 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:33,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:33,374 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:75, output treesize:67 [2018-01-29 23:48:33,417 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:48:33,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 70 treesize of output 69 [2018-01-29 23:48:33,435 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:33,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 64 treesize of output 86 [2018-01-29 23:48:33,447 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-01-29 23:48:33,524 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-29 23:48:33,565 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:48:33,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 83 treesize of output 104 [2018-01-29 23:48:33,580 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:33,580 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:48:33,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 146 [2018-01-29 23:48:33,581 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:33,608 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 23:48:33,613 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:48:33,621 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 83 treesize of output 88 [2018-01-29 23:48:33,623 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:33,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 78 [2018-01-29 23:48:33,624 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:33,634 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:33,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 89 treesize of output 117 [2018-01-29 23:48:33,657 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:33,658 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:33,659 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:33,659 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:48:33,660 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 96 treesize of output 174 [2018-01-29 23:48:33,660 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:33,694 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:33,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-01-29 23:48:33,736 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:109, output treesize:306 [2018-01-29 23:48:33,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 113 treesize of output 115 [2018-01-29 23:48:33,836 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:33,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 114 treesize of output 135 [2018-01-29 23:48:33,837 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:33,891 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 23:48:34,033 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 115 treesize of output 107 [2018-01-29 23:48:34,036 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:34,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 121 [2018-01-29 23:48:34,036 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:34,065 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:34,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 157 treesize of output 139 [2018-01-29 23:48:34,182 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:34,182 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:48:34,183 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 150 treesize of output 192 [2018-01-29 23:48:34,183 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:34,225 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:34,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 151 treesize of output 135 [2018-01-29 23:48:34,318 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:34,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 157 [2018-01-29 23:48:34,319 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:34,367 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 23:48:34,453 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 113 treesize of output 107 [2018-01-29 23:48:34,456 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:34,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 119 [2018-01-29 23:48:34,457 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:34,499 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 23:48:34,582 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 109 treesize of output 111 [2018-01-29 23:48:34,585 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:34,586 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 112 treesize of output 129 [2018-01-29 23:48:34,586 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:34,624 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:34,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 6 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-01-29 23:48:34,677 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:384, output treesize:368 [2018-01-29 23:48:34,766 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 185 treesize of output 171 [2018-01-29 23:48:34,775 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:34,776 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:34,777 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:34,779 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 172 treesize of output 190 [2018-01-29 23:48:34,779 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:34,855 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:34,856 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:34,856 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:34,857 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:48:34,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 105 treesize of output 125 [2018-01-29 23:48:34,866 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-29 23:48:34,929 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 23:48:35,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 91 [2018-01-29 23:48:35,108 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:35,109 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:35,109 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:48:35,110 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:35,110 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:48:35,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 80 [2018-01-29 23:48:35,113 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:35,135 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:35,154 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 166 treesize of output 160 [2018-01-29 23:48:35,159 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:35,160 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:48:35,160 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:35,161 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:35,165 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:48:35,165 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:35,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 132 treesize of output 226 [2018-01-29 23:48:35,176 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-01-29 23:48:35,280 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:35,281 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:35,281 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:35,284 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 137 treesize of output 218 [2018-01-29 23:48:35,284 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:35,334 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 23:48:35,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 147 treesize of output 157 [2018-01-29 23:48:35,506 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:35,506 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:48:35,507 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:35,507 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:35,508 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:48:35,508 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:35,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 192 [2018-01-29 23:48:35,512 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:35,577 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:35,578 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:35,579 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:35,582 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 130 treesize of output 167 [2018-01-29 23:48:35,582 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:35,618 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:35,744 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 149 treesize of output 143 [2018-01-29 23:48:35,748 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:35,749 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:48:35,749 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:35,750 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:35,750 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:48:35,751 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:35,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 158 [2018-01-29 23:48:35,756 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:35,811 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:35,811 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:35,812 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:35,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 150 [2018-01-29 23:48:35,815 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:35,846 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:35,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 130 treesize of output 138 [2018-01-29 23:48:35,968 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:35,969 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:35,969 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:35,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 186 [2018-01-29 23:48:35,971 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:36,023 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:36,107 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 128 treesize of output 122 [2018-01-29 23:48:36,111 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:36,111 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:48:36,111 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:36,112 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:36,112 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:48:36,113 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:36,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 148 [2018-01-29 23:48:36,116 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:36,160 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:36,160 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:36,161 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:36,163 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 119 treesize of output 129 [2018-01-29 23:48:36,163 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:36,188 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:36,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 6 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-01-29 23:48:36,243 INFO L202 ElimStorePlain]: Needed 20 recursive calls to eliminate 7 variables, input treesize:482, output treesize:418 [2018-01-29 23:48:36,275 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:48:36,278 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:48:36,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 140 treesize of output 134 [2018-01-29 23:48:36,289 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:36,289 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:48:36,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 94 [2018-01-29 23:48:36,290 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:36,311 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:36,436 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:48:36,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 208 treesize of output 163 [2018-01-29 23:48:36,450 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:36,451 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 127 [2018-01-29 23:48:36,451 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:36,475 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:36,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 160 treesize of output 119 [2018-01-29 23:48:36,581 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:36,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 135 [2018-01-29 23:48:36,584 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:36,601 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:36,686 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:48:36,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 139 treesize of output 134 [2018-01-29 23:48:36,709 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:36,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 165 [2018-01-29 23:48:36,710 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:36,753 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 23:48:36,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 136 treesize of output 105 [2018-01-29 23:48:36,837 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:36,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 96 [2018-01-29 23:48:36,839 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:36,853 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:36,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 201 treesize of output 140 [2018-01-29 23:48:36,929 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:36,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 134 [2018-01-29 23:48:36,937 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-01-29 23:48:36,978 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 23:48:37,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 6 dim-2 vars, End of recursive call: 6 dim-0 vars, and 4 xjuncts. [2018-01-29 23:48:37,049 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 10 variables, input treesize:509, output treesize:539 [2018-01-29 23:48:37,563 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 69 DAG size of output 65 [2018-01-29 23:48:37,570 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:37,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 165 treesize of output 128 [2018-01-29 23:48:37,574 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:37,582 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 89 [2018-01-29 23:48:37,585 INFO L267 ElimStorePlain]: Start of recursive call 3: 7 dim-0 vars, End of recursive call: 7 dim-0 vars, and 4 xjuncts. [2018-01-29 23:48:37,644 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:37,645 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:37,645 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:48:37,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 105 [2018-01-29 23:48:37,656 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-29 23:48:37,659 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:37,660 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:48:37,662 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:37,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 96 treesize of output 107 [2018-01-29 23:48:37,674 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-29 23:48:37,676 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:37,677 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:48:37,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 105 [2018-01-29 23:48:37,687 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-01-29 23:48:37,689 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:37,689 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:48:37,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 79 [2018-01-29 23:48:37,690 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:37,794 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-01-29 23:48:37,872 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:37,873 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 159 treesize of output 122 [2018-01-29 23:48:37,875 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:37,880 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 83 [2018-01-29 23:48:37,882 INFO L267 ElimStorePlain]: Start of recursive call 9: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-01-29 23:48:37,919 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:48:37,919 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:37,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 79 [2018-01-29 23:48:37,920 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:37,923 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:37,924 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:48:37,925 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:37,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 96 treesize of output 107 [2018-01-29 23:48:37,930 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-01-29 23:48:37,977 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-29 23:48:38,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 50 [2018-01-29 23:48:38,067 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:38,067 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:48:38,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 24 [2018-01-29 23:48:38,068 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:38,081 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:38,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2018-01-29 23:48:38,081 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:38,090 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:38,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 54 [2018-01-29 23:48:38,095 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:38,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 22 [2018-01-29 23:48:38,096 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:38,109 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:38,109 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2018-01-29 23:48:38,109 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:38,115 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:38,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 54 [2018-01-29 23:48:38,189 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:38,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 22 [2018-01-29 23:48:38,189 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:38,199 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:38,200 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2018-01-29 23:48:38,200 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:38,205 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:38,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 54 [2018-01-29 23:48:38,210 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:38,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 33 [2018-01-29 23:48:38,211 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:38,223 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:38,224 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 27 treesize of output 13 [2018-01-29 23:48:38,224 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:38,231 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:38,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 50 [2018-01-29 23:48:38,237 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:38,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 33 [2018-01-29 23:48:38,238 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:38,248 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:38,249 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 27 treesize of output 13 [2018-01-29 23:48:38,249 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:38,255 INFO L267 ElimStorePlain]: Start of recursive call 24: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:38,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 50 [2018-01-29 23:48:38,260 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:38,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2018-01-29 23:48:38,261 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:38,270 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:38,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2018-01-29 23:48:38,271 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:38,277 INFO L267 ElimStorePlain]: Start of recursive call 27: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:38,316 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-29 23:48:38,316 INFO L202 ElimStorePlain]: Needed 29 recursive calls to eliminate 6 variables, input treesize:325, output treesize:27 [2018-01-29 23:48:38,453 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:48:38,473 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-01-29 23:48:38,473 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-01-29 23:48:38,474 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-29 23:48:38,474 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-29 23:48:38,474 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2018-01-29 23:48:38,474 INFO L87 Difference]: Start difference. First operand 595 states and 660 transitions. Second operand 21 states. [2018-01-29 23:48:39,652 WARN L146 SmtUtils]: Spent 140ms on a formula simplification. DAG size of input: 121 DAG size of output 119 [2018-01-29 23:48:40,000 WARN L146 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 121 DAG size of output 120 [2018-01-29 23:48:40,143 WARN L146 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 118 DAG size of output 116 [2018-01-29 23:48:40,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:48:40,364 INFO L93 Difference]: Finished difference Result 796 states and 892 transitions. [2018-01-29 23:48:40,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-01-29 23:48:40,364 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 99 [2018-01-29 23:48:40,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:48:40,367 INFO L225 Difference]: With dead ends: 796 [2018-01-29 23:48:40,367 INFO L226 Difference]: Without dead ends: 762 [2018-01-29 23:48:40,367 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=342, Invalid=1638, Unknown=0, NotChecked=0, Total=1980 [2018-01-29 23:48:40,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2018-01-29 23:48:40,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 595. [2018-01-29 23:48:40,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2018-01-29 23:48:40,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 658 transitions. [2018-01-29 23:48:40,402 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 658 transitions. Word has length 99 [2018-01-29 23:48:40,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:48:40,402 INFO L432 AbstractCegarLoop]: Abstraction has 595 states and 658 transitions. [2018-01-29 23:48:40,402 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-29 23:48:40,402 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 658 transitions. [2018-01-29 23:48:40,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-01-29 23:48:40,403 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:48:40,403 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, 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] [2018-01-29 23:48:40,403 INFO L371 AbstractCegarLoop]: === Iteration 45 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-29 23:48:40,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1052448057, now seen corresponding path program 1 times [2018-01-29 23:48:40,404 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:48:40,404 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:48:40,404 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:40,404 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:48:40,404 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:40,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:48:40,416 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:48:40,511 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 26 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:48:40,511 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:48:40,511 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:48:40,519 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:48:40,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:48:40,569 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:48:40,602 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 42 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:48:40,622 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:48:40,622 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-01-29 23:48:40,623 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-29 23:48:40,623 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-29 23:48:40,623 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-01-29 23:48:40,623 INFO L87 Difference]: Start difference. First operand 595 states and 658 transitions. Second operand 10 states. [2018-01-29 23:48:40,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:48:40,729 INFO L93 Difference]: Finished difference Result 606 states and 663 transitions. [2018-01-29 23:48:40,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-29 23:48:40,729 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 102 [2018-01-29 23:48:40,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:48:40,732 INFO L225 Difference]: With dead ends: 606 [2018-01-29 23:48:40,732 INFO L226 Difference]: Without dead ends: 603 [2018-01-29 23:48:40,733 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-01-29 23:48:40,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2018-01-29 23:48:40,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 597. [2018-01-29 23:48:40,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2018-01-29 23:48:40,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 660 transitions. [2018-01-29 23:48:40,763 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 660 transitions. Word has length 102 [2018-01-29 23:48:40,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:48:40,764 INFO L432 AbstractCegarLoop]: Abstraction has 597 states and 660 transitions. [2018-01-29 23:48:40,764 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-29 23:48:40,764 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 660 transitions. [2018-01-29 23:48:40,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-01-29 23:48:40,765 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:48:40,765 INFO L350 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 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:48:40,765 INFO L371 AbstractCegarLoop]: === Iteration 46 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-29 23:48:40,765 INFO L82 PathProgramCache]: Analyzing trace with hash 349813696, now seen corresponding path program 1 times [2018-01-29 23:48:40,765 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:48:40,765 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:48:40,766 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:40,766 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:48:40,766 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:40,774 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-29 23:48:40,775 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-29 23:48:40,775 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-29 23:48:40,794 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:48:40,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:48:40,827 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:48:40,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-01-29 23:48:40,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:48:40,907 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:40,909 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:40,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:48:40,917 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:30 [2018-01-29 23:48:40,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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:48:40,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:48:40,943 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:40,945 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:40,975 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 27 treesize of output 51 [2018-01-29 23:48:40,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2018-01-29 23:48:40,978 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:40,988 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:41,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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:48:41,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:48:41,002 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:41,004 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:41,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-29 23:48:41,015 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:67, output treesize:46 [2018-01-29 23:48:41,347 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 27 treesize of output 23 [2018-01-29 23:48:41,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2018-01-29 23:48:41,353 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-29 23:48:41,359 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-29 23:48:41,377 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 41 treesize of output 33 [2018-01-29 23:48:41,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, 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 22 [2018-01-29 23:48:41,380 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:48:41,385 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:48:41,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-01-29 23:48:41,392 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 29 treesize of output 26 [2018-01-29 23:48:41,392 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:48:41,402 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-29 23:48:41,426 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2018-01-29 23:48:41,426 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:66, output treesize:109 [2018-01-29 23:48:41,715 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 42 treesize of output 46 [2018-01-29 23:48:41,717 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2018-01-29 23:48:41,717 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:41,748 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 42 [2018-01-29 23:48:41,748 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-29 23:48:41,780 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2018-01-29 23:48:41,781 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:41,809 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-29 23:48:41,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2018-01-29 23:48:41,857 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2018-01-29 23:48:41,857 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:41,863 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:41,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-01-29 23:48:41,903 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 12 variables, input treesize:82, output treesize:40 [2018-01-29 23:48:42,005 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:48:42,024 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-01-29 23:48:42,025 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-01-29 23:48:42,025 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-29 23:48:42,025 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-29 23:48:42,025 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=541, Unknown=0, NotChecked=0, Total=600 [2018-01-29 23:48:42,025 INFO L87 Difference]: Start difference. First operand 597 states and 660 transitions. Second operand 25 states. [2018-01-29 23:48:44,712 WARN L146 SmtUtils]: Spent 1034ms on a formula simplification. DAG size of input: 72 DAG size of output 55 [2018-01-29 23:48:44,919 WARN L146 SmtUtils]: Spent 162ms on a formula simplification. DAG size of input: 82 DAG size of output 55 [2018-01-29 23:48:49,172 WARN L146 SmtUtils]: Spent 4039ms on a formula simplification. DAG size of input: 86 DAG size of output 33 [2018-01-29 23:48:49,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:48:49,348 INFO L93 Difference]: Finished difference Result 625 states and 686 transitions. [2018-01-29 23:48:49,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-01-29 23:48:49,349 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 102 [2018-01-29 23:48:49,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:48:49,350 INFO L225 Difference]: With dead ends: 625 [2018-01-29 23:48:49,350 INFO L226 Difference]: Without dead ends: 616 [2018-01-29 23:48:49,351 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=264, Invalid=2186, Unknown=0, NotChecked=0, Total=2450 [2018-01-29 23:48:49,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2018-01-29 23:48:49,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 596. [2018-01-29 23:48:49,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2018-01-29 23:48:49,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 658 transitions. [2018-01-29 23:48:49,379 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 658 transitions. Word has length 102 [2018-01-29 23:48:49,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:48:49,380 INFO L432 AbstractCegarLoop]: Abstraction has 596 states and 658 transitions. [2018-01-29 23:48:49,380 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-29 23:48:49,380 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 658 transitions. [2018-01-29 23:48:49,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-01-29 23:48:49,380 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:48:49,381 INFO L350 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 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:48:49,381 INFO L371 AbstractCegarLoop]: === Iteration 47 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-29 23:48:49,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1939956174, now seen corresponding path program 1 times [2018-01-29 23:48:49,381 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:48:49,381 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:48:49,381 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:49,381 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:48:49,382 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:49,388 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-29 23:48:49,388 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-29 23:48:49,388 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-01-29 23:48:49,395 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:48:49,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:48:49,433 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:48:49,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-29 23:48:49,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-29 23:48:49,566 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:49,567 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:49,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:48:49,577 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:49 [2018-01-29 23:48:49,665 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 41 treesize of output 33 [2018-01-29 23:48:49,672 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 33 treesize of output 30 [2018-01-29 23:48:49,673 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-29 23:48:49,685 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-29 23:48:49,705 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:48:49,705 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:78 [2018-01-29 23:48:50,114 WARN L1033 $PredicateComparison]: unable to prove that (exists ((main_~x~10.base Int) (v_prenex_74 Int)) (let ((.cse0 (store |c_old(#valid)| main_~x~10.base 1))) (and (= (select |c_old(#valid)| main_~x~10.base) 0) (not (= v_prenex_74 0)) (= |c_#valid| (store (store .cse0 v_prenex_74 0) main_~x~10.base 0)) (not (= main_~x~10.base 0)) (= 0 (select .cse0 v_prenex_74))))) is different from true [2018-01-29 23:48:50,166 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-01-29 23:48:50,197 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-01-29 23:48:50,197 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-01-29 23:48:50,198 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-29 23:48:50,198 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-29 23:48:50,198 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=299, Unknown=5, NotChecked=34, Total=380 [2018-01-29 23:48:50,198 INFO L87 Difference]: Start difference. First operand 596 states and 658 transitions. Second operand 20 states. [2018-01-29 23:48:51,626 WARN L146 SmtUtils]: Spent 135ms on a formula simplification. DAG size of input: 101 DAG size of output 68 [2018-01-29 23:48:51,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:48:51,942 INFO L93 Difference]: Finished difference Result 614 states and 675 transitions. [2018-01-29 23:48:51,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-29 23:48:51,942 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 103 [2018-01-29 23:48:51,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:48:51,945 INFO L225 Difference]: With dead ends: 614 [2018-01-29 23:48:51,945 INFO L226 Difference]: Without dead ends: 582 [2018-01-29 23:48:51,945 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=175, Invalid=1149, Unknown=12, NotChecked=70, Total=1406 [2018-01-29 23:48:51,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2018-01-29 23:48:51,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 570. [2018-01-29 23:48:51,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2018-01-29 23:48:51,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 631 transitions. [2018-01-29 23:48:51,981 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 631 transitions. Word has length 103 [2018-01-29 23:48:51,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:48:51,981 INFO L432 AbstractCegarLoop]: Abstraction has 570 states and 631 transitions. [2018-01-29 23:48:51,981 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-29 23:48:51,981 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 631 transitions. [2018-01-29 23:48:51,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-01-29 23:48:51,981 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:48:51,982 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, 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:48:51,982 INFO L371 AbstractCegarLoop]: === Iteration 48 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-29 23:48:51,982 INFO L82 PathProgramCache]: Analyzing trace with hash -211956307, now seen corresponding path program 1 times [2018-01-29 23:48:51,982 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:48:51,982 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:48:51,982 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:51,982 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:48:51,983 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:51,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:48:51,999 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:48:52,598 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:48:52,599 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:48:52,599 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:48:52,606 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:48:52,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:48:52,641 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:48:52,780 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:52,780 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:52,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, 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:48:52,814 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:52,818 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:52,819 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18 [2018-01-29 23:48:52,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-29 23:48:52,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-29 23:48:52,879 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:52,880 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:52,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:52,888 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-01-29 23:48:52,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, 2 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:48:52,920 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 14 treesize of output 13 [2018-01-29 23:48:52,920 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:52,924 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:52,931 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:48:52,931 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:38 [2018-01-29 23:48:53,004 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 40 treesize of output 33 [2018-01-29 23:48:53,017 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:48:53,017 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:53,026 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 21 treesize of output 20 [2018-01-29 23:48:53,027 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:48:53,034 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:48:53,045 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:48:53,045 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:50, output treesize:38 [2018-01-29 23:48:53,122 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:53,122 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 12 treesize of output 21 [2018-01-29 23:48:53,122 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:53,127 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:48:53,127 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:15 [2018-01-29 23:48:53,183 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:48:53,202 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:48:53,203 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 31 [2018-01-29 23:48:53,203 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-01-29 23:48:53,203 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-01-29 23:48:53,203 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=896, Unknown=0, NotChecked=0, Total=992 [2018-01-29 23:48:53,203 INFO L87 Difference]: Start difference. First operand 570 states and 631 transitions. Second operand 32 states. [2018-01-29 23:48:54,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:48:54,662 INFO L93 Difference]: Finished difference Result 687 states and 760 transitions. [2018-01-29 23:48:54,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-29 23:48:54,662 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 105 [2018-01-29 23:48:54,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:48:54,664 INFO L225 Difference]: With dead ends: 687 [2018-01-29 23:48:54,664 INFO L226 Difference]: Without dead ends: 686 [2018-01-29 23:48:54,665 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 92 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=426, Invalid=2124, Unknown=0, NotChecked=0, Total=2550 [2018-01-29 23:48:54,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2018-01-29 23:48:54,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 629. [2018-01-29 23:48:54,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2018-01-29 23:48:54,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 705 transitions. [2018-01-29 23:48:54,694 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 705 transitions. Word has length 105 [2018-01-29 23:48:54,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:48:54,694 INFO L432 AbstractCegarLoop]: Abstraction has 629 states and 705 transitions. [2018-01-29 23:48:54,694 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-01-29 23:48:54,694 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 705 transitions. [2018-01-29 23:48:54,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-01-29 23:48:54,695 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:48:54,695 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, 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:48:54,695 INFO L371 AbstractCegarLoop]: === Iteration 49 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-29 23:48:54,695 INFO L82 PathProgramCache]: Analyzing trace with hash -211956306, now seen corresponding path program 1 times [2018-01-29 23:48:54,695 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:48:54,696 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:48:54,696 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:54,696 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:48:54,696 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:48:54,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:48:54,719 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:48:55,223 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 21 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:48:55,223 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:48:55,223 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:48:55,229 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:48:55,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:48:55,268 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:48:55,286 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:48:55,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:48:55,288 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:55,289 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:55,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:55,293 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-01-29 23:48:55,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-01-29 23:48:55,314 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:55,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 18 treesize of output 27 [2018-01-29 23:48:55,314 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:55,318 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:55,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:55,323 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-01-29 23:48:55,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-01-29 23:48:55,346 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:55,347 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:55,347 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:55,347 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:48:55,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 55 [2018-01-29 23:48:55,348 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:55,354 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:55,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:55,361 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2018-01-29 23:48:55,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2018-01-29 23:48:55,386 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:55,387 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:55,387 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:55,388 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:55,389 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:55,390 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:55,390 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:48:55,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 90 [2018-01-29 23:48:55,391 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:55,403 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:55,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:55,411 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:46 [2018-01-29 23:48:55,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 43 [2018-01-29 23:48:55,439 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:55,439 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:55,440 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:55,441 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:55,441 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:55,442 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:55,443 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:55,443 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:55,444 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:55,445 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:55,445 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:48:55,449 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 120 [2018-01-29 23:48:55,449 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:55,463 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:55,471 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:55,471 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:65, output treesize:46 [2018-01-29 23:48:55,528 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:55,529 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:55,529 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:48:55,530 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:55,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:55,541 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:60, output treesize:54 [2018-01-29 23:48:55,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 49 [2018-01-29 23:48:55,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-29 23:48:55,604 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:55,610 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:55,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:55,623 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:67, output treesize:63 [2018-01-29 23:48:55,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 56 [2018-01-29 23:48:55,662 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:55,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-01-29 23:48:55,662 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:55,671 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:55,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:55,687 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:83, output treesize:79 [2018-01-29 23:48:55,731 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 64 treesize of output 61 [2018-01-29 23:48:55,734 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:55,734 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:55,735 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:55,735 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:48:55,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 55 [2018-01-29 23:48:55,736 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:55,749 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:55,767 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:55,767 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:93, output treesize:89 [2018-01-29 23:48:55,818 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 68 [2018-01-29 23:48:55,821 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:55,821 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:55,822 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:55,823 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:55,823 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:55,824 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:55,824 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:48:55,825 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 90 [2018-01-29 23:48:55,825 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:55,843 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:55,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:55,864 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:107, output treesize:98 [2018-01-29 23:48:55,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 88 treesize of output 81 [2018-01-29 23:48:55,921 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:55,922 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:55,922 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:55,923 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:55,924 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:55,924 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:55,925 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:55,926 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:55,926 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:55,927 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:55,927 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:48:55,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 120 [2018-01-29 23:48:55,932 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:55,954 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:55,974 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:55,974 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:117, output treesize:98 [2018-01-29 23:48:55,982 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:48:55,985 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:48:55,985 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:55,988 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:56,025 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:48:56,027 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 82 treesize of output 106 [2018-01-29 23:48:56,031 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:56,031 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:56,032 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:56,033 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:56,033 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:56,034 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:56,034 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:48:56,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 89 [2018-01-29 23:48:56,035 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:56,075 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:56,101 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:56,102 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:124, output treesize:131 [2018-01-29 23:48:56,172 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:48:56,173 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 231 treesize of output 213 [2018-01-29 23:48:56,177 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:56,178 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:56,179 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:56,179 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:56,180 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:56,181 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:56,182 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:48:56,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 227 [2018-01-29 23:48:56,183 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:56,213 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:56,239 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 155 treesize of output 149 [2018-01-29 23:48:56,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:48:56,241 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:56,251 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:48:56,271 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:48:56,271 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:250, output treesize:200 [2018-01-29 23:48:56,414 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 154 treesize of output 139 [2018-01-29 23:48:56,424 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 119 treesize of output 100 [2018-01-29 23:48:56,426 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-29 23:48:56,474 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 13 treesize of output 1 [2018-01-29 23:48:56,474 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:56,511 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:48:56,571 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 143 treesize of output 107 [2018-01-29 23:48:56,574 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:56,575 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:56,576 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:56,576 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:56,577 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:56,578 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:56,578 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:48:56,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 116 [2018-01-29 23:48:56,579 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:56,600 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:56,601 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:56,602 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:56,603 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:56,604 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:56,605 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:56,605 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:56,606 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:56,609 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:48:56,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 91 [2018-01-29 23:48:56,617 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-01-29 23:48:56,651 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 23:48:56,654 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 151 treesize of output 115 [2018-01-29 23:48:56,657 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:56,658 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:56,659 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:56,660 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:56,660 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:56,661 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:56,662 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:48:56,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 105 [2018-01-29 23:48:56,663 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-29 23:48:56,685 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:56,686 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:56,686 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:56,688 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:56,688 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:56,689 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:56,690 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:56,690 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:56,691 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:48:56,694 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:48:56,697 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 87 [2018-01-29 23:48:56,698 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-01-29 23:48:56,747 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 23:48:56,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 6 xjuncts. [2018-01-29 23:48:56,778 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:221, output treesize:94 [2018-01-29 23:48:56,969 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 21 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:48:56,989 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:48:56,989 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 21] total 32 [2018-01-29 23:48:56,989 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-29 23:48:56,989 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-29 23:48:56,990 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=933, Unknown=0, NotChecked=0, Total=1056 [2018-01-29 23:48:56,990 INFO L87 Difference]: Start difference. First operand 629 states and 705 transitions. Second operand 33 states. [2018-01-29 23:49:01,052 WARN L146 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 134 DAG size of output 87 [2018-01-29 23:49:05,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:49:05,792 INFO L93 Difference]: Finished difference Result 790 states and 871 transitions. [2018-01-29 23:49:05,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-01-29 23:49:05,792 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 105 [2018-01-29 23:49:05,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:49:05,794 INFO L225 Difference]: With dead ends: 790 [2018-01-29 23:49:05,794 INFO L226 Difference]: Without dead ends: 789 [2018-01-29 23:49:05,796 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 92 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1471 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1039, Invalid=5123, Unknown=0, NotChecked=0, Total=6162 [2018-01-29 23:49:05,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2018-01-29 23:49:05,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 650. [2018-01-29 23:49:05,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2018-01-29 23:49:05,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 733 transitions. [2018-01-29 23:49:05,827 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 733 transitions. Word has length 105 [2018-01-29 23:49:05,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:49:05,827 INFO L432 AbstractCegarLoop]: Abstraction has 650 states and 733 transitions. [2018-01-29 23:49:05,827 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-29 23:49:05,827 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 733 transitions. [2018-01-29 23:49:05,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-01-29 23:49:05,828 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:49:05,828 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, 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] [2018-01-29 23:49:05,828 INFO L371 AbstractCegarLoop]: === Iteration 50 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-29 23:49:05,828 INFO L82 PathProgramCache]: Analyzing trace with hash -788295538, now seen corresponding path program 1 times [2018-01-29 23:49:05,828 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:49:05,828 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:49:05,829 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:49:05,829 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:49:05,829 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:49:05,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:49:05,837 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:49:05,873 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-01-29 23:49:05,873 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:49:05,873 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 23:49:05,873 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-29 23:49:05,873 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-29 23:49:05,874 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-29 23:49:05,874 INFO L87 Difference]: Start difference. First operand 650 states and 733 transitions. Second operand 4 states. [2018-01-29 23:49:05,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:49:05,959 INFO L93 Difference]: Finished difference Result 673 states and 760 transitions. [2018-01-29 23:49:05,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-29 23:49:05,959 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2018-01-29 23:49:05,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:49:05,961 INFO L225 Difference]: With dead ends: 673 [2018-01-29 23:49:05,961 INFO L226 Difference]: Without dead ends: 672 [2018-01-29 23:49:05,961 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-29 23:49:05,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2018-01-29 23:49:05,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 649. [2018-01-29 23:49:05,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 649 states. [2018-01-29 23:49:05,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 732 transitions. [2018-01-29 23:49:05,991 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 732 transitions. Word has length 108 [2018-01-29 23:49:05,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:49:05,991 INFO L432 AbstractCegarLoop]: Abstraction has 649 states and 732 transitions. [2018-01-29 23:49:05,992 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-29 23:49:05,992 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 732 transitions. [2018-01-29 23:49:05,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-01-29 23:49:05,992 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:49:05,992 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, 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] [2018-01-29 23:49:05,992 INFO L371 AbstractCegarLoop]: === Iteration 51 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-29 23:49:05,992 INFO L82 PathProgramCache]: Analyzing trace with hash -788295537, now seen corresponding path program 1 times [2018-01-29 23:49:05,993 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:49:05,993 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:49:05,993 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:49:05,993 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:49:05,993 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:49:06,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:49:06,011 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:49:06,341 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 21 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:49:06,342 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:49:06,342 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:49:06,346 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:49:06,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:49:06,377 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:49:06,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 23:49:06,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-29 23:49:06,397 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:49:06,398 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:49:06,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:49:06,401 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-01-29 23:49:06,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-01-29 23:49:06,420 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:06,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-01-29 23:49:06,420 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:49:06,424 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:49:06,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:49:06,429 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-01-29 23:49:06,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-01-29 23:49:06,450 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:06,451 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:06,451 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:06,452 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:49:06,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 55 [2018-01-29 23:49:06,452 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:49:06,459 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:49:06,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:49:06,466 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2018-01-29 23:49:06,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2018-01-29 23:49:06,493 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:06,494 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:06,494 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:06,495 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:06,496 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:06,496 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:06,497 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:49:06,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 90 [2018-01-29 23:49:06,497 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:49:06,510 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:49:06,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:49:06,519 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:46 [2018-01-29 23:49:06,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 43 [2018-01-29 23:49:06,549 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:06,550 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:06,551 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:06,551 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:06,552 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:06,553 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:06,553 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:06,554 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:06,555 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:06,555 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:06,556 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:49:06,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 120 [2018-01-29 23:49:06,561 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:49:06,580 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:49:06,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:49:06,590 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:65, output treesize:46 [2018-01-29 23:49:06,665 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:06,666 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:06,667 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:49:06,667 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:49:06,686 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:49:06,687 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:54 [2018-01-29 23:49:06,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 49 [2018-01-29 23:49:06,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:49:06,755 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:49:06,762 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:49:06,776 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:49:06,776 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:67, output treesize:63 [2018-01-29 23:49:06,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 56 [2018-01-29 23:49:06,819 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:06,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-01-29 23:49:06,819 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:49:06,829 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:49:06,844 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:49:06,845 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:76, output treesize:72 [2018-01-29 23:49:06,889 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 64 treesize of output 61 [2018-01-29 23:49:06,892 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:06,892 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:06,893 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:06,893 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:49:06,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 55 [2018-01-29 23:49:06,894 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:49:06,907 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:49:06,926 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:49:06,926 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:86, output treesize:82 [2018-01-29 23:49:06,976 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 68 [2018-01-29 23:49:06,979 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:06,980 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:06,980 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:06,981 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:06,982 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:06,982 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:06,983 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:49:06,983 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 90 [2018-01-29 23:49:06,984 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:49:07,003 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:49:07,023 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:49:07,023 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:95, output treesize:91 [2018-01-29 23:49:07,078 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 81 [2018-01-29 23:49:07,081 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:07,082 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:07,082 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:07,083 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:07,084 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:07,085 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:07,085 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:07,086 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:07,087 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:07,087 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:07,088 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:49:07,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 120 [2018-01-29 23:49:07,092 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:49:07,116 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:49:07,138 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:49:07,138 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:91 [2018-01-29 23:49:07,152 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 82 treesize of output 75 [2018-01-29 23:49:07,154 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:07,155 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:07,155 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:07,157 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:07,157 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:07,159 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:07,161 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:49:07,161 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:49:07,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 92 [2018-01-29 23:49:07,162 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:49:07,184 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:49:07,205 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:49:07,205 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:101, output treesize:97 [2018-01-29 23:49:07,265 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 172 treesize of output 165 [2018-01-29 23:49:07,268 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:07,269 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:07,269 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:07,270 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:07,271 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:07,271 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:07,272 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:49:07,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 213 [2018-01-29 23:49:07,277 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:49:07,302 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:49:07,322 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:49:07,322 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:185, output treesize:157 [2018-01-29 23:49:07,456 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 153 treesize of output 115 [2018-01-29 23:49:07,459 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:07,461 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:07,462 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:07,463 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:07,464 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:07,465 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:07,466 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:07,468 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:07,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 8 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 111 treesize of output 116 [2018-01-29 23:49:07,484 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 23:49:07,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 3 [2018-01-29 23:49:07,534 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-29 23:49:07,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 25 [2018-01-29 23:49:07,538 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-29 23:49:07,544 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 23:49:07,556 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-29 23:49:07,556 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:169, output treesize:25 [2018-01-29 23:49:07,723 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 21 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:49:07,743 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:49:07,743 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 23] total 35 [2018-01-29 23:49:07,744 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-01-29 23:49:07,744 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-01-29 23:49:07,744 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1122, Unknown=0, NotChecked=0, Total=1260 [2018-01-29 23:49:07,744 INFO L87 Difference]: Start difference. First operand 649 states and 732 transitions. Second operand 36 states. [2018-01-29 23:49:08,423 WARN L146 SmtUtils]: Spent 359ms on a formula simplification. DAG size of input: 41 DAG size of output 36 [2018-01-29 23:49:14,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:49:14,672 INFO L93 Difference]: Finished difference Result 925 states and 1026 transitions. [2018-01-29 23:49:14,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-01-29 23:49:14,672 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 108 [2018-01-29 23:49:14,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:49:14,676 INFO L225 Difference]: With dead ends: 925 [2018-01-29 23:49:14,676 INFO L226 Difference]: Without dead ends: 924 [2018-01-29 23:49:14,677 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 95 SyntacticMatches, 2 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2787 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1762, Invalid=8540, Unknown=0, NotChecked=0, Total=10302 [2018-01-29 23:49:14,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2018-01-29 23:49:14,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 729. [2018-01-29 23:49:14,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 729 states. [2018-01-29 23:49:14,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 830 transitions. [2018-01-29 23:49:14,714 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 830 transitions. Word has length 108 [2018-01-29 23:49:14,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:49:14,714 INFO L432 AbstractCegarLoop]: Abstraction has 729 states and 830 transitions. [2018-01-29 23:49:14,715 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-01-29 23:49:14,715 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 830 transitions. [2018-01-29 23:49:14,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-01-29 23:49:14,715 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:49:14,715 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, 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] [2018-01-29 23:49:14,715 INFO L371 AbstractCegarLoop]: === Iteration 52 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-29 23:49:14,716 INFO L82 PathProgramCache]: Analyzing trace with hash 205549903, now seen corresponding path program 1 times [2018-01-29 23:49:14,716 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:49:14,716 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:49:14,716 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:49:14,716 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:49:14,716 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:49:14,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:49:14,733 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:49:15,093 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 21 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:49:15,094 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:49:15,094 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:49:15,099 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:49:15,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:49:15,138 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:49:15,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-29 23:49:15,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 10 treesize of output 9 [2018-01-29 23:49:15,177 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:49:15,179 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:49:15,182 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:49:15,182 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-01-29 23:49:15,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-01-29 23:49:15,201 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:15,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-01-29 23:49:15,202 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:49:15,205 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:49:15,210 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:49:15,211 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-01-29 23:49:15,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-01-29 23:49:15,232 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:15,233 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:15,234 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:15,234 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:49:15,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 55 [2018-01-29 23:49:15,235 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:49:15,242 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:49:15,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:49:15,249 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2018-01-29 23:49:15,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2018-01-29 23:49:15,277 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:15,277 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:15,278 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:15,279 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:15,279 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:15,280 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:15,281 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:49:15,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 90 [2018-01-29 23:49:15,281 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:49:15,293 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:49:15,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:49:15,301 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:46 [2018-01-29 23:49:15,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 43 [2018-01-29 23:49:15,345 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:15,345 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:15,346 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:15,347 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:15,348 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:15,348 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:15,349 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:15,350 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:15,350 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:15,351 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:15,352 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:49:15,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 120 [2018-01-29 23:49:15,356 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:49:15,372 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:49:15,380 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:49:15,380 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:65, output treesize:46 [2018-01-29 23:49:15,439 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:15,439 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:15,440 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:49:15,440 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:49:15,452 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:49:15,452 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:54 [2018-01-29 23:49:15,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 49 [2018-01-29 23:49:15,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-29 23:49:15,516 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:49:15,523 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:49:15,537 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:49:15,537 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:67, output treesize:63 [2018-01-29 23:49:15,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 56 [2018-01-29 23:49:15,579 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:15,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-01-29 23:49:15,579 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:49:15,588 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:49:15,604 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:49:15,604 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:76, output treesize:72 [2018-01-29 23:49:15,649 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 64 treesize of output 61 [2018-01-29 23:49:15,651 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:15,652 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:15,652 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:15,653 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:49:15,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 55 [2018-01-29 23:49:15,653 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:49:15,666 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:49:15,685 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:49:15,685 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:86, output treesize:82 [2018-01-29 23:49:15,737 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 68 [2018-01-29 23:49:15,740 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:15,740 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:15,741 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:15,742 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:15,743 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:15,743 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:15,744 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:49:15,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 90 [2018-01-29 23:49:15,744 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:49:15,763 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:49:15,784 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:49:15,784 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:95, output treesize:91 [2018-01-29 23:49:15,840 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 81 [2018-01-29 23:49:15,844 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:15,845 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:15,846 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:15,847 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:15,847 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:15,848 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:15,849 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:15,849 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:15,850 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:15,851 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:15,851 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:49:15,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 120 [2018-01-29 23:49:15,856 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:49:15,883 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:49:15,904 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:49:15,905 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:91 [2018-01-29 23:49:15,925 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 82 treesize of output 75 [2018-01-29 23:49:15,928 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:15,929 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:15,930 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:15,931 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:15,932 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:15,934 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:15,936 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:49:15,936 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:49:15,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 92 [2018-01-29 23:49:15,937 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:49:15,963 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:49:15,985 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:49:15,985 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:101, output treesize:97 [2018-01-29 23:49:16,043 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 172 treesize of output 165 [2018-01-29 23:49:16,046 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:16,047 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:16,048 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:16,048 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:16,049 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:16,050 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:16,050 INFO L682 Elim1Store]: detected equality via solver [2018-01-29 23:49:16,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 215 [2018-01-29 23:49:16,057 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:49:16,082 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:49:16,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-29 23:49:16,103 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:185, output treesize:154 [2018-01-29 23:49:16,221 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 150 treesize of output 112 [2018-01-29 23:49:16,224 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:16,225 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:16,225 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:16,226 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:16,226 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:16,227 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:16,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 120 [2018-01-29 23:49:16,231 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:49:16,249 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:16,251 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:16,252 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:16,253 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:16,253 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:16,256 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:16,257 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:16,257 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:49:16,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 8 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 93 [2018-01-29 23:49:16,272 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-29 23:49:16,299 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 23:49:16,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-29 23:49:16,310 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:166, output treesize:25 [2018-01-29 23:49:16,447 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 21 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:49:16,467 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:49:16,467 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 22] total 34 [2018-01-29 23:49:16,468 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-01-29 23:49:16,468 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-01-29 23:49:16,468 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1067, Unknown=0, NotChecked=0, Total=1190 [2018-01-29 23:49:16,468 INFO L87 Difference]: Start difference. First operand 729 states and 830 transitions. Second operand 35 states. [2018-01-29 23:49:17,133 WARN L146 SmtUtils]: Spent 359ms on a formula simplification. DAG size of input: 41 DAG size of output 36 [2018-01-29 23:49:26,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:49:26,254 INFO L93 Difference]: Finished difference Result 912 states and 1013 transitions. [2018-01-29 23:49:26,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-01-29 23:49:26,254 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 113 [2018-01-29 23:49:26,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:49:26,256 INFO L225 Difference]: With dead ends: 912 [2018-01-29 23:49:26,257 INFO L226 Difference]: Without dead ends: 911 [2018-01-29 23:49:26,257 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 100 SyntacticMatches, 4 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2123 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1441, Invalid=6569, Unknown=0, NotChecked=0, Total=8010 [2018-01-29 23:49:26,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2018-01-29 23:49:26,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 753. [2018-01-29 23:49:26,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 753 states. [2018-01-29 23:49:26,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 866 transitions. [2018-01-29 23:49:26,295 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 866 transitions. Word has length 113 [2018-01-29 23:49:26,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:49:26,296 INFO L432 AbstractCegarLoop]: Abstraction has 753 states and 866 transitions. [2018-01-29 23:49:26,296 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-01-29 23:49:26,296 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 866 transitions. [2018-01-29 23:49:26,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-01-29 23:49:26,296 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:49:26,296 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, 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] [2018-01-29 23:49:26,296 INFO L371 AbstractCegarLoop]: === Iteration 53 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr40EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-29 23:49:26,297 INFO L82 PathProgramCache]: Analyzing trace with hash 2077081046, now seen corresponding path program 1 times [2018-01-29 23:49:26,297 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:49:26,297 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:49:26,297 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:49:26,297 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:49:26,297 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:49:26,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:49:26,312 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:49:26,613 ERROR L119 erpolLogProxyWrapper]: Could not assert interpolant [2018-01-29 23:49:26,614 ERROR L119 erpolLogProxyWrapper]: Interpolant 72 not inductive: (Check returned sat) [2018-01-29 23:49:26,646 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Asserted terms must be closed at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.assertTerm(SMTInterpol.java:654) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:956) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackTraceAbstractionRefinementStrategy.getTraceCheck(MultiTrackTraceAbstractionRefinementStrategy.java:218) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:396) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-01-29 23:49:26,649 INFO L168 Benchmark]: Toolchain (without parser) took 83878.94 ms. Allocated memory was 307.2 MB in the beginning and 896.0 MB in the end (delta: 588.8 MB). Free memory was 266.1 MB in the beginning and 580.7 MB in the end (delta: -314.6 MB). Peak memory consumption was 577.4 MB. Max. memory is 5.3 GB. [2018-01-29 23:49:26,650 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 307.2 MB. Free memory is still 272.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-29 23:49:26,650 INFO L168 Benchmark]: CACSL2BoogieTranslator took 210.77 ms. Allocated memory is still 307.2 MB. Free memory was 266.1 MB in the beginning and 254.1 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-01-29 23:49:26,651 INFO L168 Benchmark]: Boogie Preprocessor took 42.62 ms. Allocated memory is still 307.2 MB. Free memory was 254.1 MB in the beginning and 252.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:49:26,651 INFO L168 Benchmark]: RCFGBuilder took 541.71 ms. Allocated memory is still 307.2 MB. Free memory was 252.2 MB in the beginning and 219.2 MB in the end (delta: 33.0 MB). Peak memory consumption was 33.0 MB. Max. memory is 5.3 GB. [2018-01-29 23:49:26,652 INFO L168 Benchmark]: TraceAbstraction took 83075.89 ms. Allocated memory was 307.2 MB in the beginning and 896.0 MB in the end (delta: 588.8 MB). Free memory was 219.2 MB in the beginning and 580.7 MB in the end (delta: -361.6 MB). Peak memory consumption was 530.5 MB. Max. memory is 5.3 GB. [2018-01-29 23:49:26,654 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 307.2 MB. Free memory is still 272.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 210.77 ms. Allocated memory is still 307.2 MB. Free memory was 266.1 MB in the beginning and 254.1 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 42.62 ms. Allocated memory is still 307.2 MB. Free memory was 254.1 MB in the beginning and 252.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 541.71 ms. Allocated memory is still 307.2 MB. Free memory was 252.2 MB in the beginning and 219.2 MB in the end (delta: 33.0 MB). Peak memory consumption was 33.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 83075.89 ms. Allocated memory was 307.2 MB in the beginning and 896.0 MB in the end (delta: 588.8 MB). Free memory was 219.2 MB in the beginning and 580.7 MB in the end (delta: -361.6 MB). Peak memory consumption was 530.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Asserted terms must be closed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Asserted terms must be closed: de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.assertTerm(SMTInterpol.java:654) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-29_23-49-26-662.csv Received shutdown request...