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_RubberTaipan+AI_EQ.epf -i ../../../trunk/examples/svcomp/memsafety/test-0504_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 13:06:19,053 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 13:06:19,055 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 13:06:19,070 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 13:06:19,071 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 13:06:19,072 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 13:06:19,073 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 13:06:19,075 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 13:06:19,077 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 13:06:19,078 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 13:06:19,079 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 13:06:19,079 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 13:06:19,080 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 13:06:19,082 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 13:06:19,083 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 13:06:19,085 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 13:06:19,087 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 13:06:19,089 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 13:06:19,091 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 13:06:19,092 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 13:06:19,094 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 13:06:19,094 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 13:06:19,095 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 13:06:19,096 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 13:06:19,096 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 13:06:19,098 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 13:06:19,098 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 13:06:19,099 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 13:06:19,099 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 13:06:19,099 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 13:06:19,100 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 13:06:19,100 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf [2018-01-24 13:06:19,109 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 13:06:19,109 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 13:06:19,110 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 13:06:19,110 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 13:06:19,110 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 13:06:19,110 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 13:06:19,110 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 13:06:19,111 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 13:06:19,111 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 13:06:19,111 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 13:06:19,111 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 13:06:19,111 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 13:06:19,112 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 13:06:19,112 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 13:06:19,112 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 13:06:19,112 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 13:06:19,112 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 13:06:19,112 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 13:06:19,112 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 13:06:19,113 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 13:06:19,113 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 13:06:19,113 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 13:06:19,113 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 13:06:19,113 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 13:06:19,113 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 13:06:19,114 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 13:06:19,114 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 13:06:19,114 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 13:06:19,114 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-01-24 13:06:19,114 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 13:06:19,114 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 13:06:19,114 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 13:06:19,115 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 13:06:19,115 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 13:06:19,148 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 13:06:19,159 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 13:06:19,162 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 13:06:19,163 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 13:06:19,163 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 13:06:19,164 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0504_true-valid-memsafety.i [2018-01-24 13:06:19,314 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 13:06:19,318 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 13:06:19,318 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 13:06:19,319 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 13:06:19,323 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 13:06:19,324 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 01:06:19" (1/1) ... [2018-01-24 13:06:19,326 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1eaa2765 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:06:19, skipping insertion in model container [2018-01-24 13:06:19,327 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 01:06:19" (1/1) ... [2018-01-24 13:06:19,339 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 13:06:19,383 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 13:06:19,509 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 13:06:19,528 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 13:06:19,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:06:19 WrapperNode [2018-01-24 13:06:19,538 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 13:06:19,539 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 13:06:19,539 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 13:06:19,539 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 13:06:19,556 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:06:19" (1/1) ... [2018-01-24 13:06:19,556 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:06:19" (1/1) ... [2018-01-24 13:06:19,571 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:06:19" (1/1) ... [2018-01-24 13:06:19,571 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:06:19" (1/1) ... [2018-01-24 13:06:19,578 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:06:19" (1/1) ... [2018-01-24 13:06:19,581 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:06:19" (1/1) ... [2018-01-24 13:06:19,583 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:06:19" (1/1) ... [2018-01-24 13:06:19,586 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 13:06:19,586 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 13:06:19,587 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 13:06:19,587 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 13:06:19,588 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:06:19" (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-24 13:06:19,653 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 13:06:19,653 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 13:06:19,653 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 13:06:19,653 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 13:06:19,653 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 13:06:19,653 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 13:06:19,654 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 13:06:19,654 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 13:06:19,654 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 13:06:19,654 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 13:06:19,654 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 13:06:19,654 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 13:06:19,655 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-01-24 13:06:19,655 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 13:06:19,655 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 13:06:19,655 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 13:06:19,655 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 13:06:20,082 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 13:06:20,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 01:06:20 BoogieIcfgContainer [2018-01-24 13:06:20,083 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 13:06:20,083 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 13:06:20,083 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 13:06:20,085 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 13:06:20,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 01:06:19" (1/3) ... [2018-01-24 13:06:20,086 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6037b6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 01:06:20, skipping insertion in model container [2018-01-24 13:06:20,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:06:19" (2/3) ... [2018-01-24 13:06:20,087 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6037b6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 01:06:20, skipping insertion in model container [2018-01-24 13:06:20,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 01:06:20" (3/3) ... [2018-01-24 13:06:20,089 INFO L105 eAbstractionObserver]: Analyzing ICFG test-0504_true-valid-memsafety.i [2018-01-24 13:06:20,098 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 13:06:20,106 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 39 error locations. [2018-01-24 13:06:20,143 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 13:06:20,143 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 13:06:20,144 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 13:06:20,144 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 13:06:20,144 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 13:06:20,144 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 13:06:20,144 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 13:06:20,144 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 13:06:20,145 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 13:06:20,168 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states. [2018-01-24 13:06:20,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-24 13:06:20,176 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:06:20,177 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:06:20,177 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 13:06:20,183 INFO L82 PathProgramCache]: Analyzing trace with hash 23857872, now seen corresponding path program 1 times [2018-01-24 13:06:20,186 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:06:20,245 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:06:20,245 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:06:20,245 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:06:20,245 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:06:20,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:06:20,295 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:06:20,327 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-24 13:06:20,329 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:06:20,330 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 13:06:20,330 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:06:20,332 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-24 13:06:20,343 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-24 13:06:20,344 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-24 13:06:20,346 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 2 states. [2018-01-24 13:06:20,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:06:20,456 INFO L93 Difference]: Finished difference Result 182 states and 202 transitions. [2018-01-24 13:06:20,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-24 13:06:20,457 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-01-24 13:06:20,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:06:20,466 INFO L225 Difference]: With dead ends: 182 [2018-01-24 13:06:20,466 INFO L226 Difference]: Without dead ends: 91 [2018-01-24 13:06:20,469 INFO L525 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-24 13:06:20,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-01-24 13:06:20,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-01-24 13:06:20,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-01-24 13:06:20,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2018-01-24 13:06:20,502 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 10 [2018-01-24 13:06:20,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:06:20,503 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2018-01-24 13:06:20,503 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-24 13:06:20,503 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2018-01-24 13:06:20,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-24 13:06:20,504 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:06:20,504 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:06:20,504 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 13:06:20,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1271008375, now seen corresponding path program 1 times [2018-01-24 13:06:20,504 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:06:20,505 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:06:20,505 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:06:20,505 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:06:20,505 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:06:20,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:06:20,520 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:06:20,575 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-24 13:06:20,575 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:06:20,576 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 13:06:20,576 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:06:20,578 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 13:06:20,578 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 13:06:20,578 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 13:06:20,578 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand 3 states. [2018-01-24 13:06:20,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:06:20,639 INFO L93 Difference]: Finished difference Result 231 states and 243 transitions. [2018-01-24 13:06:20,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 13:06:20,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-01-24 13:06:20,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:06:20,642 INFO L225 Difference]: With dead ends: 231 [2018-01-24 13:06:20,643 INFO L226 Difference]: Without dead ends: 146 [2018-01-24 13:06:20,644 INFO L525 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-24 13:06:20,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-01-24 13:06:20,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 122. [2018-01-24 13:06:20,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-01-24 13:06:20,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 152 transitions. [2018-01-24 13:06:20,658 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 152 transitions. Word has length 12 [2018-01-24 13:06:20,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:06:20,659 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 152 transitions. [2018-01-24 13:06:20,659 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 13:06:20,659 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 152 transitions. [2018-01-24 13:06:20,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 13:06:20,660 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:06:20,660 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:06:20,660 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 13:06:20,660 INFO L82 PathProgramCache]: Analyzing trace with hash -746554717, now seen corresponding path program 1 times [2018-01-24 13:06:20,661 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:06:20,662 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:06:20,662 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:06:20,662 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:06:20,662 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:06:20,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:06:20,673 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:06:20,701 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-24 13:06:20,702 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:06:20,702 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 13:06:20,702 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:06:20,702 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 13:06:20,703 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 13:06:20,703 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 13:06:20,703 INFO L87 Difference]: Start difference. First operand 122 states and 152 transitions. Second operand 3 states. [2018-01-24 13:06:20,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:06:20,810 INFO L93 Difference]: Finished difference Result 125 states and 154 transitions. [2018-01-24 13:06:20,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 13:06:20,811 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-01-24 13:06:20,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:06:20,812 INFO L225 Difference]: With dead ends: 125 [2018-01-24 13:06:20,813 INFO L226 Difference]: Without dead ends: 120 [2018-01-24 13:06:20,813 INFO L525 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-24 13:06:20,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-24 13:06:20,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-01-24 13:06:20,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-01-24 13:06:20,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 149 transitions. [2018-01-24 13:06:20,824 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 149 transitions. Word has length 13 [2018-01-24 13:06:20,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:06:20,825 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 149 transitions. [2018-01-24 13:06:20,825 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 13:06:20,825 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 149 transitions. [2018-01-24 13:06:20,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 13:06:20,825 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:06:20,826 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:06:20,826 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 13:06:20,826 INFO L82 PathProgramCache]: Analyzing trace with hash -747420669, now seen corresponding path program 1 times [2018-01-24 13:06:20,826 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:06:20,827 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:06:20,827 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:06:20,828 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:06:20,828 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:06:20,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:06:20,841 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:06:20,893 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-24 13:06:20,893 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:06:20,894 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 13:06:20,894 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:06:20,894 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 13:06:20,894 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 13:06:20,894 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 13:06:20,894 INFO L87 Difference]: Start difference. First operand 120 states and 149 transitions. Second operand 4 states. [2018-01-24 13:06:21,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:06:21,149 INFO L93 Difference]: Finished difference Result 145 states and 175 transitions. [2018-01-24 13:06:21,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 13:06:21,150 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-24 13:06:21,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:06:21,151 INFO L225 Difference]: With dead ends: 145 [2018-01-24 13:06:21,151 INFO L226 Difference]: Without dead ends: 137 [2018-01-24 13:06:21,152 INFO L525 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-24 13:06:21,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-01-24 13:06:21,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 112. [2018-01-24 13:06:21,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-24 13:06:21,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 134 transitions. [2018-01-24 13:06:21,161 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 134 transitions. Word has length 13 [2018-01-24 13:06:21,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:06:21,162 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 134 transitions. [2018-01-24 13:06:21,162 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 13:06:21,162 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 134 transitions. [2018-01-24 13:06:21,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 13:06:21,162 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:06:21,163 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:06:21,163 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 13:06:21,163 INFO L82 PathProgramCache]: Analyzing trace with hash -747420668, now seen corresponding path program 1 times [2018-01-24 13:06:21,163 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:06:21,164 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:06:21,164 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:06:21,164 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:06:21,164 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:06:21,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:06:21,173 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:06:21,248 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-24 13:06:21,249 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:06:21,249 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 13:06:21,249 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:06:21,249 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 13:06:21,250 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 13:06:21,250 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 13:06:21,250 INFO L87 Difference]: Start difference. First operand 112 states and 134 transitions. Second operand 4 states. [2018-01-24 13:06:21,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:06:21,369 INFO L93 Difference]: Finished difference Result 158 states and 185 transitions. [2018-01-24 13:06:21,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 13:06:21,370 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-24 13:06:21,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:06:21,371 INFO L225 Difference]: With dead ends: 158 [2018-01-24 13:06:21,371 INFO L226 Difference]: Without dead ends: 152 [2018-01-24 13:06:21,372 INFO L525 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-24 13:06:21,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-01-24 13:06:21,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 113. [2018-01-24 13:06:21,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-24 13:06:21,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 134 transitions. [2018-01-24 13:06:21,384 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 134 transitions. Word has length 13 [2018-01-24 13:06:21,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:06:21,384 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 134 transitions. [2018-01-24 13:06:21,384 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 13:06:21,384 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 134 transitions. [2018-01-24 13:06:21,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 13:06:21,385 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:06:21,385 INFO L322 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-24 13:06:21,385 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 13:06:21,385 INFO L82 PathProgramCache]: Analyzing trace with hash 2050240790, now seen corresponding path program 1 times [2018-01-24 13:06:21,385 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:06:21,386 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:06:21,386 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:06:21,387 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:06:21,387 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:06:21,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:06:21,416 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:06:21,533 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-24 13:06:21,534 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:06:21,534 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 13:06:21,534 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:06:21,534 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 13:06:21,535 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 13:06:21,535 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:06:21,535 INFO L87 Difference]: Start difference. First operand 113 states and 134 transitions. Second operand 5 states. [2018-01-24 13:06:21,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:06:21,721 INFO L93 Difference]: Finished difference Result 201 states and 225 transitions. [2018-01-24 13:06:21,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 13:06:21,721 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-01-24 13:06:21,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:06:21,723 INFO L225 Difference]: With dead ends: 201 [2018-01-24 13:06:21,723 INFO L226 Difference]: Without dead ends: 198 [2018-01-24 13:06:21,724 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 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-24 13:06:21,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-01-24 13:06:21,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 104. [2018-01-24 13:06:21,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-01-24 13:06:21,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 119 transitions. [2018-01-24 13:06:21,734 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 119 transitions. Word has length 25 [2018-01-24 13:06:21,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:06:21,735 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 119 transitions. [2018-01-24 13:06:21,735 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 13:06:21,735 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 119 transitions. [2018-01-24 13:06:21,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 13:06:21,736 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:06:21,737 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:06:21,737 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 13:06:21,737 INFO L82 PathProgramCache]: Analyzing trace with hash -867044953, now seen corresponding path program 1 times [2018-01-24 13:06:21,738 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:06:21,739 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:06:21,739 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:06:21,739 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:06:21,739 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:06:21,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:06:21,758 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:06:21,809 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-24 13:06:21,809 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:06:21,809 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 13:06:21,809 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:06:21,810 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 13:06:21,810 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 13:06:21,810 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 13:06:21,811 INFO L87 Difference]: Start difference. First operand 104 states and 119 transitions. Second operand 4 states. [2018-01-24 13:06:22,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:06:22,020 INFO L93 Difference]: Finished difference Result 156 states and 176 transitions. [2018-01-24 13:06:22,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 13:06:22,021 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-01-24 13:06:22,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:06:22,022 INFO L225 Difference]: With dead ends: 156 [2018-01-24 13:06:22,022 INFO L226 Difference]: Without dead ends: 152 [2018-01-24 13:06:22,023 INFO L525 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-24 13:06:22,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-01-24 13:06:22,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 100. [2018-01-24 13:06:22,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-01-24 13:06:22,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 111 transitions. [2018-01-24 13:06:22,031 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 111 transitions. Word has length 26 [2018-01-24 13:06:22,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:06:22,031 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 111 transitions. [2018-01-24 13:06:22,031 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 13:06:22,032 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 111 transitions. [2018-01-24 13:06:22,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 13:06:22,032 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:06:22,033 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:06:22,033 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 13:06:22,033 INFO L82 PathProgramCache]: Analyzing trace with hash -867044952, now seen corresponding path program 1 times [2018-01-24 13:06:22,033 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:06:22,034 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:06:22,034 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:06:22,034 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:06:22,034 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:06:22,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:06:22,051 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:06:22,111 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-24 13:06:22,111 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:06:22,111 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 13:06:22,111 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:06:22,111 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 13:06:22,112 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 13:06:22,112 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 13:06:22,112 INFO L87 Difference]: Start difference. First operand 100 states and 111 transitions. Second operand 4 states. [2018-01-24 13:06:22,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:06:22,198 INFO L93 Difference]: Finished difference Result 144 states and 160 transitions. [2018-01-24 13:06:22,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 13:06:22,198 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-01-24 13:06:22,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:06:22,199 INFO L225 Difference]: With dead ends: 144 [2018-01-24 13:06:22,199 INFO L226 Difference]: Without dead ends: 140 [2018-01-24 13:06:22,200 INFO L525 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-24 13:06:22,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-01-24 13:06:22,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 96. [2018-01-24 13:06:22,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-24 13:06:22,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2018-01-24 13:06:22,206 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 26 [2018-01-24 13:06:22,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:06:22,207 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2018-01-24 13:06:22,207 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 13:06:22,207 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2018-01-24 13:06:22,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 13:06:22,208 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:06:22,208 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:06:22,208 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 13:06:22,208 INFO L82 PathProgramCache]: Analyzing trace with hash -2023715676, now seen corresponding path program 1 times [2018-01-24 13:06:22,209 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:06:22,209 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:06:22,209 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:06:22,209 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:06:22,209 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:06:22,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:06:22,221 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:06:22,264 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:06:22,264 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:06:22,264 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 13:06:22,264 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:06:22,265 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 13:06:22,265 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 13:06:22,265 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 13:06:22,265 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand 4 states. [2018-01-24 13:06:22,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:06:22,400 INFO L93 Difference]: Finished difference Result 123 states and 129 transitions. [2018-01-24 13:06:22,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 13:06:22,400 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-01-24 13:06:22,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:06:22,401 INFO L225 Difference]: With dead ends: 123 [2018-01-24 13:06:22,402 INFO L226 Difference]: Without dead ends: 122 [2018-01-24 13:06:22,402 INFO L525 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-24 13:06:22,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-01-24 13:06:22,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 99. [2018-01-24 13:06:22,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-24 13:06:22,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2018-01-24 13:06:22,409 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 28 [2018-01-24 13:06:22,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:06:22,409 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2018-01-24 13:06:22,409 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 13:06:22,409 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2018-01-24 13:06:22,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 13:06:22,410 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:06:22,410 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:06:22,410 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 13:06:22,410 INFO L82 PathProgramCache]: Analyzing trace with hash -2023715675, now seen corresponding path program 1 times [2018-01-24 13:06:22,410 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:06:22,411 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:06:22,411 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:06:22,411 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:06:22,411 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:06:22,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:06:22,421 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:06:22,516 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:06:22,517 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:06:22,517 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 13:06:22,517 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:06:22,517 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 13:06:22,517 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 13:06:22,517 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:06:22,517 INFO L87 Difference]: Start difference. First operand 99 states and 108 transitions. Second operand 5 states. [2018-01-24 13:06:22,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:06:22,642 INFO L93 Difference]: Finished difference Result 177 states and 196 transitions. [2018-01-24 13:06:22,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 13:06:22,642 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-01-24 13:06:22,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:06:22,645 INFO L225 Difference]: With dead ends: 177 [2018-01-24 13:06:22,645 INFO L226 Difference]: Without dead ends: 176 [2018-01-24 13:06:22,645 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-24 13:06:22,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-01-24 13:06:22,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 129. [2018-01-24 13:06:22,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-01-24 13:06:22,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 147 transitions. [2018-01-24 13:06:22,655 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 147 transitions. Word has length 28 [2018-01-24 13:06:22,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:06:22,655 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 147 transitions. [2018-01-24 13:06:22,655 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 13:06:22,656 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 147 transitions. [2018-01-24 13:06:22,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 13:06:22,657 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:06:22,657 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:06:22,657 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 13:06:22,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1689322728, now seen corresponding path program 1 times [2018-01-24 13:06:22,657 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:06:22,658 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:06:22,659 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:06:22,659 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:06:22,659 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:06:22,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:06:22,670 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:06:22,736 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:06:22,736 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:06:22,737 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 13:06:22,737 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:06:22,737 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 13:06:22,737 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 13:06:22,737 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:06:22,737 INFO L87 Difference]: Start difference. First operand 129 states and 147 transitions. Second operand 5 states. [2018-01-24 13:06:22,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:06:22,807 INFO L93 Difference]: Finished difference Result 223 states and 252 transitions. [2018-01-24 13:06:22,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 13:06:22,807 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-01-24 13:06:22,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:06:22,808 INFO L225 Difference]: With dead ends: 223 [2018-01-24 13:06:22,808 INFO L226 Difference]: Without dead ends: 133 [2018-01-24 13:06:22,809 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-24 13:06:22,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-01-24 13:06:22,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 125. [2018-01-24 13:06:22,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-01-24 13:06:22,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 137 transitions. [2018-01-24 13:06:22,820 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 137 transitions. Word has length 29 [2018-01-24 13:06:22,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:06:22,820 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 137 transitions. [2018-01-24 13:06:22,820 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 13:06:22,820 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 137 transitions. [2018-01-24 13:06:22,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 13:06:22,821 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:06:22,822 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:06:22,822 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 13:06:22,822 INFO L82 PathProgramCache]: Analyzing trace with hash -202845861, now seen corresponding path program 1 times [2018-01-24 13:06:22,822 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:06:22,823 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:06:22,823 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:06:22,823 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:06:22,823 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:06:22,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:06:22,838 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:06:22,926 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-24 13:06:22,926 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:06:22,926 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 13:06:22,926 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:06:22,927 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 13:06:22,927 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 13:06:22,927 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 13:06:22,928 INFO L87 Difference]: Start difference. First operand 125 states and 137 transitions. Second operand 6 states. [2018-01-24 13:06:23,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:06:23,163 INFO L93 Difference]: Finished difference Result 195 states and 213 transitions. [2018-01-24 13:06:23,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 13:06:23,163 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-01-24 13:06:23,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:06:23,164 INFO L225 Difference]: With dead ends: 195 [2018-01-24 13:06:23,164 INFO L226 Difference]: Without dead ends: 194 [2018-01-24 13:06:23,165 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-01-24 13:06:23,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-01-24 13:06:23,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 144. [2018-01-24 13:06:23,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-01-24 13:06:23,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 159 transitions. [2018-01-24 13:06:23,172 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 159 transitions. Word has length 29 [2018-01-24 13:06:23,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:06:23,172 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 159 transitions. [2018-01-24 13:06:23,172 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 13:06:23,172 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 159 transitions. [2018-01-24 13:06:23,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 13:06:23,173 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:06:23,173 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:06:23,173 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 13:06:23,173 INFO L82 PathProgramCache]: Analyzing trace with hash -202845860, now seen corresponding path program 1 times [2018-01-24 13:06:23,173 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:06:23,174 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:06:23,174 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:06:23,174 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:06:23,175 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:06:23,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:06:23,187 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:06:23,556 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-24 13:06:23,556 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:06:23,556 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 13:06:23,556 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:06:23,556 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 13:06:23,557 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 13:06:23,557 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-24 13:06:23,557 INFO L87 Difference]: Start difference. First operand 144 states and 159 transitions. Second operand 10 states. [2018-01-24 13:06:23,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:06:23,887 INFO L93 Difference]: Finished difference Result 222 states and 239 transitions. [2018-01-24 13:06:23,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 13:06:23,920 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2018-01-24 13:06:23,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:06:23,922 INFO L225 Difference]: With dead ends: 222 [2018-01-24 13:06:23,922 INFO L226 Difference]: Without dead ends: 221 [2018-01-24 13:06:23,922 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2018-01-24 13:06:23,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-01-24 13:06:23,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 144. [2018-01-24 13:06:23,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-01-24 13:06:23,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 157 transitions. [2018-01-24 13:06:23,929 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 157 transitions. Word has length 29 [2018-01-24 13:06:23,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:06:23,929 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 157 transitions. [2018-01-24 13:06:23,930 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 13:06:23,930 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 157 transitions. [2018-01-24 13:06:23,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 13:06:23,930 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:06:23,931 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:06:23,931 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 13:06:23,931 INFO L82 PathProgramCache]: Analyzing trace with hash 829423013, now seen corresponding path program 1 times [2018-01-24 13:06:23,931 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:06:23,932 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:06:23,932 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:06:23,932 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:06:23,932 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:06:23,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:06:23,942 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:06:23,957 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 13:06:23,957 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:06:23,957 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 13:06:23,958 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:06:23,958 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 13:06:23,958 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 13:06:23,958 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 13:06:23,958 INFO L87 Difference]: Start difference. First operand 144 states and 157 transitions. Second operand 4 states. [2018-01-24 13:06:24,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:06:24,150 INFO L93 Difference]: Finished difference Result 156 states and 170 transitions. [2018-01-24 13:06:24,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 13:06:24,150 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-01-24 13:06:24,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:06:24,151 INFO L225 Difference]: With dead ends: 156 [2018-01-24 13:06:24,152 INFO L226 Difference]: Without dead ends: 154 [2018-01-24 13:06:24,152 INFO L525 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-24 13:06:24,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-01-24 13:06:24,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 146. [2018-01-24 13:06:24,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-01-24 13:06:24,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 161 transitions. [2018-01-24 13:06:24,165 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 161 transitions. Word has length 30 [2018-01-24 13:06:24,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:06:24,165 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 161 transitions. [2018-01-24 13:06:24,165 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 13:06:24,165 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 161 transitions. [2018-01-24 13:06:24,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 13:06:24,166 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:06:24,166 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:06:24,167 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 13:06:24,167 INFO L82 PathProgramCache]: Analyzing trace with hash 829423014, now seen corresponding path program 1 times [2018-01-24 13:06:24,167 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:06:24,168 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:06:24,168 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:06:24,168 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:06:24,168 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:06:24,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:06:24,179 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:06:24,348 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:06:24,348 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:06:24,349 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 13:06:24,349 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:06:24,349 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 13:06:24,349 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 13:06:24,349 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 13:06:24,350 INFO L87 Difference]: Start difference. First operand 146 states and 161 transitions. Second operand 6 states. [2018-01-24 13:06:24,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:06:24,658 INFO L93 Difference]: Finished difference Result 214 states and 235 transitions. [2018-01-24 13:06:24,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 13:06:24,658 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-01-24 13:06:24,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:06:24,659 INFO L225 Difference]: With dead ends: 214 [2018-01-24 13:06:24,659 INFO L226 Difference]: Without dead ends: 212 [2018-01-24 13:06:24,659 INFO L525 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-24 13:06:24,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-01-24 13:06:24,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 158. [2018-01-24 13:06:24,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-01-24 13:06:24,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 180 transitions. [2018-01-24 13:06:24,669 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 180 transitions. Word has length 30 [2018-01-24 13:06:24,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:06:24,669 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 180 transitions. [2018-01-24 13:06:24,669 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 13:06:24,669 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 180 transitions. [2018-01-24 13:06:24,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 13:06:24,670 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:06:24,670 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:06:24,670 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 13:06:24,670 INFO L82 PathProgramCache]: Analyzing trace with hash -664393622, now seen corresponding path program 1 times [2018-01-24 13:06:24,670 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:06:24,671 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:06:24,671 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:06:24,672 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:06:24,672 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:06:24,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:06:24,682 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:06:24,887 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:06:24,887 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:06:24,888 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 13:06:24,888 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:06:24,888 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 13:06:24,888 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 13:06:24,889 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 13:06:24,889 INFO L87 Difference]: Start difference. First operand 158 states and 180 transitions. Second operand 7 states. [2018-01-24 13:06:25,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:06:25,178 INFO L93 Difference]: Finished difference Result 253 states and 291 transitions. [2018-01-24 13:06:25,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 13:06:25,179 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-01-24 13:06:25,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:06:25,180 INFO L225 Difference]: With dead ends: 253 [2018-01-24 13:06:25,180 INFO L226 Difference]: Without dead ends: 220 [2018-01-24 13:06:25,181 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-01-24 13:06:25,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-01-24 13:06:25,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 169. [2018-01-24 13:06:25,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-01-24 13:06:25,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 192 transitions. [2018-01-24 13:06:25,194 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 192 transitions. Word has length 34 [2018-01-24 13:06:25,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:06:25,195 INFO L432 AbstractCegarLoop]: Abstraction has 169 states and 192 transitions. [2018-01-24 13:06:25,195 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 13:06:25,195 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 192 transitions. [2018-01-24 13:06:25,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-24 13:06:25,196 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:06:25,196 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:06:25,196 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 13:06:25,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1742572463, now seen corresponding path program 1 times [2018-01-24 13:06:25,196 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:06:25,197 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:06:25,197 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:06:25,197 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:06:25,197 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:06:25,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:06:25,209 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:06:25,338 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:06:25,338 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:06:25,339 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-24 13:06:25,347 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:06:25,347 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:06:25,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:06:25,400 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:06:25,518 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-24 13:06:25,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-24 13:06:25,521 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:25,523 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:25,533 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-24 13:06:25,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-24 13:06:25,536 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:25,539 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:25,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:25,544 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2018-01-24 13:06:25,562 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-24 13:06:25,566 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:25,569 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-24 13:06:25,569 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:25,576 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:25,597 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-24 13:06:25,600 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:25,601 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-24 13:06:25,602 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:25,608 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:25,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:25,618 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2018-01-24 13:06:25,682 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-24 13:06:25,686 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:25,687 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:25,688 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:25,692 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-24 13:06:25,692 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:25,704 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:25,723 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-24 13:06:25,726 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:25,727 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:25,728 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:25,729 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:06:25,730 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-24 13:06:25,730 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:25,741 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:25,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:25,756 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:65, output treesize:57 [2018-01-24 13:06:25,793 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-24 13:06:25,797 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:25,800 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:25,808 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:25,810 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:25,811 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:25,812 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:25,820 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-24 13:06:25,821 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:25,836 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:25,857 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-24 13:06:25,861 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:25,861 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:25,862 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:25,863 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:25,863 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:25,869 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:25,870 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:06:25,871 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-24 13:06:25,872 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:25,884 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:25,895 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:25,895 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:83, output treesize:75 [2018-01-24 13:06:25,928 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-24 13:06:25,933 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:25,934 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:25,935 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:25,935 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:25,936 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:25,937 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:25,938 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:25,939 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:25,940 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:25,941 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:25,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-24 13:06:25,953 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:25,972 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:25,992 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-24 13:06:25,995 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:25,996 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:25,997 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:25,998 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:25,999 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:25,999 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:26,000 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:26,001 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:26,002 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:26,003 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:26,003 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:06:26,008 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-24 13:06:26,008 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:26,024 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:26,035 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:26,035 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:75 [2018-01-24 13:06:26,118 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 34 [2018-01-24 13:06:26,123 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:26,126 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:26,127 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:26,128 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:26,129 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:26,130 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:26,131 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:26,132 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:26,151 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 34 treesize of output 81 [2018-01-24 13:06:26,152 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 13:06:26,190 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 13:06:26,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 34 [2018-01-24 13:06:26,221 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:26,224 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:26,225 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:26,226 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:26,226 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:26,227 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:26,227 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:26,228 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:26,232 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:06:26,253 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 34 treesize of output 84 [2018-01-24 13:06:26,254 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-24 13:06:26,282 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 13:06:26,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-24 13:06:26,302 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:99, output treesize:31 [2018-01-24 13:06:26,364 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:06:26,365 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:06:26,655 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-24 13:06:26,670 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:06:26,737 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:26,742 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:26,763 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:26,769 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:26,784 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:06:26,790 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:06:26,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-01-24 13:06:26,803 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:113, output treesize:43 [2018-01-24 13:06:26,967 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-24 13:06:26,967 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:26,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:26,969 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:55, output treesize:1 [2018-01-24 13:06:26,976 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:06:27,005 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:06:27,005 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:06:27,009 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:06:27,009 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:06:39,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2018-01-24 13:06:39,068 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-01-24 13:06:39,068 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 13, 9] total 22 [2018-01-24 13:06:39,069 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:06:39,069 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-24 13:06:39,069 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-24 13:06:39,070 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2018-01-24 13:06:39,070 INFO L87 Difference]: Start difference. First operand 169 states and 192 transitions. Second operand 16 states. [2018-01-24 13:06:43,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:06:43,755 INFO L93 Difference]: Finished difference Result 214 states and 238 transitions. [2018-01-24 13:06:43,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-24 13:06:43,755 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 37 [2018-01-24 13:06:43,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:06:43,756 INFO L225 Difference]: With dead ends: 214 [2018-01-24 13:06:43,756 INFO L226 Difference]: Without dead ends: 187 [2018-01-24 13:06:43,757 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 58 SyntacticMatches, 8 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=346, Invalid=1214, Unknown=0, NotChecked=0, Total=1560 [2018-01-24 13:06:43,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-01-24 13:06:43,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 172. [2018-01-24 13:06:43,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-01-24 13:06:43,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 195 transitions. [2018-01-24 13:06:43,769 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 195 transitions. Word has length 37 [2018-01-24 13:06:43,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:06:43,770 INFO L432 AbstractCegarLoop]: Abstraction has 172 states and 195 transitions. [2018-01-24 13:06:43,770 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-24 13:06:43,770 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 195 transitions. [2018-01-24 13:06:43,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-24 13:06:43,770 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:06:43,770 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:06:43,770 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 13:06:43,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1814827739, now seen corresponding path program 1 times [2018-01-24 13:06:43,771 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:06:43,771 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:06:43,771 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:06:43,771 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:06:43,772 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:06:43,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:06:43,783 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:06:43,884 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:06:43,884 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:06:43,884 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-24 13:06:43,892 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:06:43,892 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:06:43,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:06:43,918 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:06:44,017 WARN L1029 $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-24 13:06:44,025 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-01-24 13:06:44,025 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:06:44,118 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc1.base_3| Int)) (or (= |c_old(#valid)| (store |c_#valid| |v_main_#t~malloc1.base_3| 0)) (= 0 |v_main_#t~malloc1.base_3|) (not (= (select |c_#valid| |v_main_#t~malloc1.base_3|) 0)))) is different from false [2018-01-24 13:06:44,133 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2018-01-24 13:06:44,153 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:06:44,153 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:06:44,156 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:06:44,156 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:06:44,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:06:44,201 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:06:44,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-24 13:06:44,203 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:44,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:44,204 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 13:06:44,344 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:06:44,345 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:06:44,363 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc1.base_4| Int)) (or (= 0 |v_main_#t~malloc1.base_4|) (= |c_old(#valid)| (store |c_#valid| |v_main_#t~malloc1.base_4| 0)) (not (= 0 (select |c_#valid| |v_main_#t~malloc1.base_4|))))) is different from false [2018-01-24 13:06:44,373 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2018-01-24 13:06:44,375 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:06:44,375 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9, 8, 7] total 25 [2018-01-24 13:06:44,375 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:06:44,376 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-24 13:06:44,376 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-24 13:06:44,376 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=428, Unknown=8, NotChecked=132, Total=650 [2018-01-24 13:06:44,377 INFO L87 Difference]: Start difference. First operand 172 states and 195 transitions. Second operand 14 states. [2018-01-24 13:06:44,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:06:44,775 INFO L93 Difference]: Finished difference Result 176 states and 198 transitions. [2018-01-24 13:06:44,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 13:06:44,775 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 38 [2018-01-24 13:06:44,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:06:44,776 INFO L225 Difference]: With dead ends: 176 [2018-01-24 13:06:44,777 INFO L226 Difference]: Without dead ends: 162 [2018-01-24 13:06:44,777 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 128 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=157, Invalid=659, Unknown=8, NotChecked=168, Total=992 [2018-01-24 13:06:44,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-01-24 13:06:44,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2018-01-24 13:06:44,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-01-24 13:06:44,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 183 transitions. [2018-01-24 13:06:44,793 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 183 transitions. Word has length 38 [2018-01-24 13:06:44,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:06:44,793 INFO L432 AbstractCegarLoop]: Abstraction has 161 states and 183 transitions. [2018-01-24 13:06:44,793 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-24 13:06:44,793 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 183 transitions. [2018-01-24 13:06:44,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-24 13:06:44,794 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:06:44,794 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:06:44,794 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 13:06:44,794 INFO L82 PathProgramCache]: Analyzing trace with hash 686838870, now seen corresponding path program 1 times [2018-01-24 13:06:44,794 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:06:44,795 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:06:44,795 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:06:44,795 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:06:44,796 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:06:44,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:06:44,809 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:06:44,931 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:06:44,931 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:06:44,931 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-24 13:06:44,943 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:06:44,944 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:06:44,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:06:44,973 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:06:44,998 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-24 13:06:44,999 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:45,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:45,004 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-24 13:06:45,045 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:06:45,045 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:06:45,115 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:06:45,151 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:06:45,151 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:06:45,162 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:06:45,162 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:06:45,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:06:45,218 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:06:45,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 13:06:45,233 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:45,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:45,250 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 13:06:45,322 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-24 13:06:45,322 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:45,339 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-24 13:06:45,339 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-01-24 13:06:45,370 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:06:45,370 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:06:45,437 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:06:45,438 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:06:45,438 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 4, 4] total 10 [2018-01-24 13:06:45,439 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:06:45,439 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 13:06:45,439 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 13:06:45,439 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-01-24 13:06:45,439 INFO L87 Difference]: Start difference. First operand 161 states and 183 transitions. Second operand 9 states. [2018-01-24 13:06:45,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:06:45,641 INFO L93 Difference]: Finished difference Result 182 states and 206 transitions. [2018-01-24 13:06:45,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 13:06:45,642 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-01-24 13:06:45,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:06:45,643 INFO L225 Difference]: With dead ends: 182 [2018-01-24 13:06:45,643 INFO L226 Difference]: Without dead ends: 181 [2018-01-24 13:06:45,643 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 143 SyntacticMatches, 13 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2018-01-24 13:06:45,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-01-24 13:06:45,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 160. [2018-01-24 13:06:45,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-01-24 13:06:45,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 181 transitions. [2018-01-24 13:06:45,658 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 181 transitions. Word has length 39 [2018-01-24 13:06:45,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:06:45,659 INFO L432 AbstractCegarLoop]: Abstraction has 160 states and 181 transitions. [2018-01-24 13:06:45,659 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 13:06:45,659 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 181 transitions. [2018-01-24 13:06:45,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-24 13:06:45,659 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:06:45,660 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:06:45,660 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 13:06:45,660 INFO L82 PathProgramCache]: Analyzing trace with hash 686838871, now seen corresponding path program 1 times [2018-01-24 13:06:45,660 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:06:45,661 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:06:45,662 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:06:45,662 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:06:45,662 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:06:45,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:06:45,676 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:06:45,793 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:06:45,793 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:06:45,793 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:06:45,807 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:06:45,808 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:06:45,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:06:45,837 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:06:45,891 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:45,893 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-24 13:06:45,894 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:45,903 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:45,904 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:45,907 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-24 13:06:45,908 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:45,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:45,927 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-01-24 13:06:46,016 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:06:46,017 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:06:46,187 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:06:46,209 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:06:46,209 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:06:46,218 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:06:46,218 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:06:46,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:06:46,269 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:06:46,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-24 13:06:46,286 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:46,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-24 13:06:46,354 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:46,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:46,377 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 13:06:46,442 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:46,443 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:46,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 13:06:46,443 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:46,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-24 13:06:46,450 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:46,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:06:46,456 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:18 [2018-01-24 13:06:46,482 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:06:46,482 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:06:46,584 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:06:46,587 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:06:46,587 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4, 5, 5] total 16 [2018-01-24 13:06:46,587 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:06:46,587 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 13:06:46,588 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 13:06:46,588 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2018-01-24 13:06:46,588 INFO L87 Difference]: Start difference. First operand 160 states and 181 transitions. Second operand 11 states. [2018-01-24 13:06:46,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:06:46,960 INFO L93 Difference]: Finished difference Result 236 states and 265 transitions. [2018-01-24 13:06:46,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 13:06:46,960 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 39 [2018-01-24 13:06:46,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:06:46,962 INFO L225 Difference]: With dead ends: 236 [2018-01-24 13:06:46,962 INFO L226 Difference]: Without dead ends: 235 [2018-01-24 13:06:46,963 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 147 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=180, Invalid=470, Unknown=0, NotChecked=0, Total=650 [2018-01-24 13:06:46,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-01-24 13:06:46,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 159. [2018-01-24 13:06:46,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-01-24 13:06:46,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 179 transitions. [2018-01-24 13:06:46,977 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 179 transitions. Word has length 39 [2018-01-24 13:06:46,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:06:46,977 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 179 transitions. [2018-01-24 13:06:46,978 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 13:06:46,978 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 179 transitions. [2018-01-24 13:06:46,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-24 13:06:46,978 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:06:46,979 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:06:46,979 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 13:06:46,979 INFO L82 PathProgramCache]: Analyzing trace with hash -927394694, now seen corresponding path program 1 times [2018-01-24 13:06:46,979 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:06:46,980 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:06:46,980 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:06:46,980 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:06:46,980 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:06:46,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:06:46,998 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:06:47,114 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:06:47,114 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:06:47,114 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:06:47,122 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:06:47,122 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:06:47,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:06:47,148 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:06:47,233 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:47,234 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:47,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-01-24 13:06:47,235 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:47,247 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:47,248 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:47,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, 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-24 13:06:47,249 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:47,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:47,257 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:21 [2018-01-24 13:06:47,319 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:06:47,319 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:06:47,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-01-24 13:06:47,480 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:47,483 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:47,484 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:12 [2018-01-24 13:06:47,504 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:06:47,526 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:06:47,526 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 11 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:06:47,529 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:06:47,529 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:06:47,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:06:47,582 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:06:47,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-24 13:06:47,586 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:47,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-24 13:06:47,592 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:47,596 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:47,596 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 13:06:47,616 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:47,617 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:47,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-01-24 13:06:47,617 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:47,627 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:47,627 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:47,628 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-24 13:06:47,628 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:47,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:06:47,633 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2018-01-24 13:06:47,698 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:06:47,698 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:06:47,812 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:06:47,814 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:06:47,814 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 6, 5, 5] total 22 [2018-01-24 13:06:47,814 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:06:47,814 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-24 13:06:47,814 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-24 13:06:47,815 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2018-01-24 13:06:47,815 INFO L87 Difference]: Start difference. First operand 159 states and 179 transitions. Second operand 14 states. [2018-01-24 13:06:48,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:06:48,295 INFO L93 Difference]: Finished difference Result 265 states and 298 transitions. [2018-01-24 13:06:48,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 13:06:48,295 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2018-01-24 13:06:48,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:06:48,297 INFO L225 Difference]: With dead ends: 265 [2018-01-24 13:06:48,297 INFO L226 Difference]: Without dead ends: 264 [2018-01-24 13:06:48,297 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 162 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=189, Invalid=681, Unknown=0, NotChecked=0, Total=870 [2018-01-24 13:06:48,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-01-24 13:06:48,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 181. [2018-01-24 13:06:48,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-01-24 13:06:48,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 203 transitions. [2018-01-24 13:06:48,314 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 203 transitions. Word has length 44 [2018-01-24 13:06:48,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:06:48,314 INFO L432 AbstractCegarLoop]: Abstraction has 181 states and 203 transitions. [2018-01-24 13:06:48,314 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-24 13:06:48,314 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 203 transitions. [2018-01-24 13:06:48,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-24 13:06:48,315 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:06:48,315 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:06:48,315 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 13:06:48,316 INFO L82 PathProgramCache]: Analyzing trace with hash -576633818, now seen corresponding path program 1 times [2018-01-24 13:06:48,316 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:06:48,316 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:06:48,317 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:06:48,317 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:06:48,317 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:06:48,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:06:48,333 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:06:48,450 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:06:48,451 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:06:48,451 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-24 13:06:48,456 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:06:48,456 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:06:48,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:06:48,477 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:06:48,481 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-24 13:06:48,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-24 13:06:48,483 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:48,484 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:48,487 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-24 13:06:48,487 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-01-24 13:06:48,492 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-24 13:06:48,492 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:48,495 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:48,495 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-01-24 13:06:48,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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-24 13:06:48,540 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-24 13:06:48,541 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:48,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-01-24 13:06:48,554 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:48,560 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:48,565 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-24 13:06:48,565 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-01-24 13:06:48,603 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-24 13:06:48,606 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-24 13:06:48,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:48,616 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-24 13:06:48,617 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:48,620 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:48,623 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-24 13:06:48,623 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:33, output treesize:11 [2018-01-24 13:06:48,631 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:06:48,631 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:06:48,697 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:06:48,729 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:06:48,730 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 13 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:06:48,733 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:06:48,733 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:06:48,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:06:48,792 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:06:48,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-24 13:06:48,794 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:48,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:48,796 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 13:06:48,839 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-24 13:06:48,839 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:48,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:48,842 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-24 13:06:48,883 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-24 13:06:48,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-24 13:06:48,884 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:48,889 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:48,894 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-24 13:06:48,894 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:15 [2018-01-24 13:06:48,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2018-01-24 13:06:48,914 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:48,919 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-24 13:06:48,919 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:20 [2018-01-24 13:06:48,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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-24 13:06:48,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-01-24 13:06:48,976 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:48,988 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:48,993 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-24 13:06:48,993 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-01-24 13:06:49,025 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-24 13:06:49,027 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-24 13:06:49,028 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:49,038 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-24 13:06:49,038 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:49,048 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-24 13:06:49,048 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:49,052 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:49,055 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-24 13:06:49,055 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:33, output treesize:11 [2018-01-24 13:06:49,065 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:06:49,065 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:06:49,114 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:06:49,116 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:06:49,116 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 9, 6] total 24 [2018-01-24 13:06:49,116 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:06:49,117 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 13:06:49,117 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 13:06:49,117 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2018-01-24 13:06:49,117 INFO L87 Difference]: Start difference. First operand 181 states and 203 transitions. Second operand 13 states. [2018-01-24 13:06:49,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:06:49,433 INFO L93 Difference]: Finished difference Result 200 states and 226 transitions. [2018-01-24 13:06:49,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 13:06:49,466 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 45 [2018-01-24 13:06:49,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:06:49,467 INFO L225 Difference]: With dead ends: 200 [2018-01-24 13:06:49,467 INFO L226 Difference]: Without dead ends: 199 [2018-01-24 13:06:49,468 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 152 SyntacticMatches, 11 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=188, Invalid=742, Unknown=0, NotChecked=0, Total=930 [2018-01-24 13:06:49,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-01-24 13:06:49,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 180. [2018-01-24 13:06:49,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-01-24 13:06:49,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 201 transitions. [2018-01-24 13:06:49,482 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 201 transitions. Word has length 45 [2018-01-24 13:06:49,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:06:49,482 INFO L432 AbstractCegarLoop]: Abstraction has 180 states and 201 transitions. [2018-01-24 13:06:49,482 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 13:06:49,483 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 201 transitions. [2018-01-24 13:06:49,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-24 13:06:49,483 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:06:49,483 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:06:49,483 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 13:06:49,484 INFO L82 PathProgramCache]: Analyzing trace with hash -576633817, now seen corresponding path program 1 times [2018-01-24 13:06:49,484 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:06:49,484 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:06:49,484 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:06:49,485 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:06:49,485 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:06:49,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:06:49,507 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:06:49,643 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:06:49,644 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:06:49,644 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-24 13:06:49,649 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:06:49,649 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:06:49,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:06:49,670 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:06:49,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-24 13:06:49,673 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:49,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:49,674 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 13:06:49,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 13:06:49,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 13:06:49,702 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:49,703 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:49,711 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-24 13:06:49,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 13:06:49,713 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:49,714 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:49,720 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-24 13:06:49,720 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:40, output treesize:34 [2018-01-24 13:06:49,734 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-24 13:06:49,734 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:49,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:49,741 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:31 [2018-01-24 13:06:49,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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-24 13:06:49,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2018-01-24 13:06:49,802 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:49,817 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:49,839 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-24 13:06:49,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-01-24 13:06:49,841 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:49,863 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:49,870 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-24 13:06:49,870 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:61, output treesize:53 [2018-01-24 13:06:49,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 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-24 13:06:49,902 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-24 13:06:49,902 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:49,908 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:49,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 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-24 13:06:49,922 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-24 13:06:49,922 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:49,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2018-01-24 13:06:49,933 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:49,944 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-24 13:06:49,944 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:49,950 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:49,955 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-24 13:06:49,955 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:67, output treesize:19 [2018-01-24 13:06:49,983 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:06:49,983 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:06:50,482 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:06:50,502 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:06:50,502 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 15 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:06:50,506 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:06:50,506 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:06:50,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:06:50,566 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:06:50,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-24 13:06:50,569 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:50,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 13:06:50,574 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:50,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:50,577 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 13:06:50,614 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-24 13:06:50,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-24 13:06:50,616 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:50,618 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:50,625 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-24 13:06:50,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-24 13:06:50,627 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:50,628 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:50,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:50,633 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:26 [2018-01-24 13:06:50,655 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:50,656 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:50,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-01-24 13:06:50,657 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:50,664 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-24 13:06:50,664 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:50,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:06:50,670 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2018-01-24 13:06:50,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 41 [2018-01-24 13:06:50,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-01-24 13:06:50,737 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:50,756 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:50,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 33 [2018-01-24 13:06:50,786 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-01-24 13:06:50,786 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:50,802 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:50,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-24 13:06:50,811 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:60, output treesize:52 [2018-01-24 13:06:50,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 34 [2018-01-24 13:06:50,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-01-24 13:06:50,866 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:50,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2018-01-24 13:06:50,890 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:50,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2018-01-24 13:06:50,913 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:50,920 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:50,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2018-01-24 13:06:50,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3 [2018-01-24 13:06:50,936 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:50,942 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:50,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:06:50,947 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:66, output treesize:18 [2018-01-24 13:06:50,975 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:06:50,975 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:06:51,169 WARN L143 SmtUtils]: Spent 160ms on a formula simplification that was a NOOP. DAG size: 33 [2018-01-24 13:06:51,294 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:06:51,296 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:06:51,296 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 9, 8, 8] total 34 [2018-01-24 13:06:51,296 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:06:51,296 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-24 13:06:51,297 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-24 13:06:51,297 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1049, Unknown=1, NotChecked=0, Total=1190 [2018-01-24 13:06:51,297 INFO L87 Difference]: Start difference. First operand 180 states and 201 transitions. Second operand 17 states. [2018-01-24 13:06:51,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:06:51,949 INFO L93 Difference]: Finished difference Result 262 states and 292 transitions. [2018-01-24 13:06:51,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 13:06:51,949 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 45 [2018-01-24 13:06:51,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:06:51,950 INFO L225 Difference]: With dead ends: 262 [2018-01-24 13:06:51,950 INFO L226 Difference]: Without dead ends: 261 [2018-01-24 13:06:51,951 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 153 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=339, Invalid=1552, Unknown=1, NotChecked=0, Total=1892 [2018-01-24 13:06:51,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-01-24 13:06:51,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 160. [2018-01-24 13:06:51,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-01-24 13:06:51,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 179 transitions. [2018-01-24 13:06:51,962 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 179 transitions. Word has length 45 [2018-01-24 13:06:51,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:06:51,962 INFO L432 AbstractCegarLoop]: Abstraction has 160 states and 179 transitions. [2018-01-24 13:06:51,962 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-24 13:06:51,962 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 179 transitions. [2018-01-24 13:06:51,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-24 13:06:51,962 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:06:51,962 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:06:51,962 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 13:06:51,963 INFO L82 PathProgramCache]: Analyzing trace with hash 2126898235, now seen corresponding path program 1 times [2018-01-24 13:06:51,963 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:06:51,963 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:06:51,963 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:06:51,963 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:06:51,963 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:06:51,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:06:51,975 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:06:52,086 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 13:06:52,086 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:06:52,087 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 13:06:52,087 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:06:52,087 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 13:06:52,087 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 13:06:52,087 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-24 13:06:52,087 INFO L87 Difference]: Start difference. First operand 160 states and 179 transitions. Second operand 7 states. [2018-01-24 13:06:52,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:06:52,203 INFO L93 Difference]: Finished difference Result 185 states and 206 transitions. [2018-01-24 13:06:52,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 13:06:52,203 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2018-01-24 13:06:52,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:06:52,204 INFO L225 Difference]: With dead ends: 185 [2018-01-24 13:06:52,204 INFO L226 Difference]: Without dead ends: 183 [2018-01-24 13:06:52,204 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-01-24 13:06:52,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-01-24 13:06:52,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 138. [2018-01-24 13:06:52,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-01-24 13:06:52,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 155 transitions. [2018-01-24 13:06:52,213 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 155 transitions. Word has length 46 [2018-01-24 13:06:52,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:06:52,213 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 155 transitions. [2018-01-24 13:06:52,213 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 13:06:52,213 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 155 transitions. [2018-01-24 13:06:52,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-24 13:06:52,214 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:06:52,214 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:06:52,214 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 13:06:52,214 INFO L82 PathProgramCache]: Analyzing trace with hash 613203071, now seen corresponding path program 1 times [2018-01-24 13:06:52,214 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:06:52,215 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:06:52,215 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:06:52,215 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:06:52,215 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:06:52,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:06:52,225 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:06:52,353 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-24 13:06:52,353 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:06:52,354 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 13:06:52,354 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:06:52,354 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 13:06:52,354 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 13:06:52,354 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-24 13:06:52,354 INFO L87 Difference]: Start difference. First operand 138 states and 155 transitions. Second operand 8 states. [2018-01-24 13:06:52,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:06:52,578 INFO L93 Difference]: Finished difference Result 169 states and 187 transitions. [2018-01-24 13:06:52,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 13:06:52,578 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2018-01-24 13:06:52,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:06:52,579 INFO L225 Difference]: With dead ends: 169 [2018-01-24 13:06:52,579 INFO L226 Difference]: Without dead ends: 168 [2018-01-24 13:06:52,580 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-01-24 13:06:52,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-01-24 13:06:52,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 150. [2018-01-24 13:06:52,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-01-24 13:06:52,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 170 transitions. [2018-01-24 13:06:52,589 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 170 transitions. Word has length 50 [2018-01-24 13:06:52,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:06:52,589 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 170 transitions. [2018-01-24 13:06:52,589 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 13:06:52,590 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 170 transitions. [2018-01-24 13:06:52,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-24 13:06:52,590 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:06:52,590 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:06:52,590 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 13:06:52,590 INFO L82 PathProgramCache]: Analyzing trace with hash 613203072, now seen corresponding path program 1 times [2018-01-24 13:06:52,590 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:06:52,591 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:06:52,591 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:06:52,591 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:06:52,591 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:06:52,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:06:52,601 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:06:52,768 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-24 13:06:52,768 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:06:52,768 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 13:06:52,768 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:06:52,769 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 13:06:52,769 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 13:06:52,769 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-24 13:06:52,769 INFO L87 Difference]: Start difference. First operand 150 states and 170 transitions. Second operand 9 states. [2018-01-24 13:06:53,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:06:53,146 INFO L93 Difference]: Finished difference Result 272 states and 308 transitions. [2018-01-24 13:06:53,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 13:06:53,147 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2018-01-24 13:06:53,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:06:53,148 INFO L225 Difference]: With dead ends: 272 [2018-01-24 13:06:53,149 INFO L226 Difference]: Without dead ends: 271 [2018-01-24 13:06:53,149 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-01-24 13:06:53,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-01-24 13:06:53,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 150. [2018-01-24 13:06:53,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-01-24 13:06:53,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 169 transitions. [2018-01-24 13:06:53,166 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 169 transitions. Word has length 50 [2018-01-24 13:06:53,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:06:53,167 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 169 transitions. [2018-01-24 13:06:53,167 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 13:06:53,167 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 169 transitions. [2018-01-24 13:06:53,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-24 13:06:53,168 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:06:53,168 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:06:53,168 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 13:06:53,168 INFO L82 PathProgramCache]: Analyzing trace with hash 877634816, now seen corresponding path program 1 times [2018-01-24 13:06:53,168 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:06:53,169 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:06:53,169 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:06:53,169 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:06:53,169 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:06:53,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:06:53,182 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:06:53,312 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-24 13:06:53,312 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:06:53,312 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 13:06:53,312 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:06:53,313 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 13:06:53,313 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 13:06:53,313 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-24 13:06:53,313 INFO L87 Difference]: Start difference. First operand 150 states and 169 transitions. Second operand 10 states. [2018-01-24 13:06:53,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:06:53,775 INFO L93 Difference]: Finished difference Result 341 states and 380 transitions. [2018-01-24 13:06:53,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-24 13:06:53,775 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2018-01-24 13:06:53,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:06:53,776 INFO L225 Difference]: With dead ends: 341 [2018-01-24 13:06:53,776 INFO L226 Difference]: Without dead ends: 340 [2018-01-24 13:06:53,777 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2018-01-24 13:06:53,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-01-24 13:06:53,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 152. [2018-01-24 13:06:53,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-01-24 13:06:53,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 172 transitions. [2018-01-24 13:06:53,788 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 172 transitions. Word has length 52 [2018-01-24 13:06:53,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:06:53,788 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 172 transitions. [2018-01-24 13:06:53,788 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 13:06:53,788 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 172 transitions. [2018-01-24 13:06:53,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-24 13:06:53,789 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:06:53,789 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:06:53,789 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 13:06:53,789 INFO L82 PathProgramCache]: Analyzing trace with hash 877634817, now seen corresponding path program 1 times [2018-01-24 13:06:53,789 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:06:53,790 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:06:53,790 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:06:53,790 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:06:53,790 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:06:53,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:06:53,801 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:06:53,866 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 13:06:53,866 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:06:53,866 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 13:06:53,866 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:06:53,867 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 13:06:53,867 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 13:06:53,867 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 13:06:53,867 INFO L87 Difference]: Start difference. First operand 152 states and 172 transitions. Second operand 4 states. [2018-01-24 13:06:53,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:06:53,938 INFO L93 Difference]: Finished difference Result 152 states and 172 transitions. [2018-01-24 13:06:53,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 13:06:53,938 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2018-01-24 13:06:53,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:06:53,940 INFO L225 Difference]: With dead ends: 152 [2018-01-24 13:06:53,940 INFO L226 Difference]: Without dead ends: 151 [2018-01-24 13:06:53,940 INFO L525 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-24 13:06:53,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-01-24 13:06:53,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-01-24 13:06:53,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-01-24 13:06:53,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 169 transitions. [2018-01-24 13:06:53,956 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 169 transitions. Word has length 52 [2018-01-24 13:06:53,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:06:53,956 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 169 transitions. [2018-01-24 13:06:53,956 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 13:06:53,957 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 169 transitions. [2018-01-24 13:06:53,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-01-24 13:06:53,957 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:06:53,957 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:06:53,957 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr38EnsuresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-01-24 13:06:53,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1507118755, now seen corresponding path program 1 times [2018-01-24 13:06:53,958 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:06:53,958 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:06:53,959 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:06:53,959 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:06:53,959 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:06:53,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:06:53,972 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:06:54,416 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:06:54,416 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:06:54,416 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:06:54,421 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:06:54,421 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:06:54,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:06:54,452 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:06:54,523 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-24 13:06:54,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-24 13:06:54,529 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:54,531 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:54,541 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-24 13:06:54,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-24 13:06:54,545 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:54,547 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:54,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:54,555 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-01-24 13:06:54,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2018-01-24 13:06:54,572 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:54,572 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-24 13:06:54,573 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:54,577 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:54,589 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 26 treesize of output 21 [2018-01-24 13:06:54,595 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:54,596 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-24 13:06:54,596 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:54,600 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:54,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:54,620 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:59, output treesize:41 [2018-01-24 13:06:54,648 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-24 13:06:54,650 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:54,651 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:54,652 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:54,654 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-24 13:06:54,654 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:54,660 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:54,671 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-24 13:06:54,673 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:54,674 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:54,674 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:54,676 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-24 13:06:54,676 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:54,681 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:54,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:54,688 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:79, output treesize:41 [2018-01-24 13:06:54,713 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:54,714 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:54,714 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-24 13:06:54,714 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:54,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:54,725 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:52, output treesize:46 [2018-01-24 13:06:54,786 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-24 13:06:54,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-24 13:06:54,788 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:54,794 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:54,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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-24 13:06:54,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-24 13:06:54,814 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:54,820 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:54,833 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:54,833 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:77, output treesize:69 [2018-01-24 13:06:54,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 39 treesize of output 38 [2018-01-24 13:06:54,876 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:54,877 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-24 13:06:54,877 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:54,898 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:54,922 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-24 13:06:54,925 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:54,925 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-24 13:06:54,925 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:54,932 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:54,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:54,949 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:95, output treesize:87 [2018-01-24 13:06:54,997 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-24 13:06:55,000 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:55,001 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:55,002 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:55,002 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:06:55,003 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-24 13:06:55,003 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:55,016 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:55,056 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:55,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 52 [2018-01-24 13:06:55,061 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:55,062 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:55,062 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:55,064 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 32 treesize of output 54 [2018-01-24 13:06:55,065 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:55,076 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:55,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:55,097 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:112, output treesize:104 [2018-01-24 13:06:55,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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-24 13:06:55,156 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:55,157 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:55,158 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:55,159 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:55,159 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:55,160 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:55,160 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:06:55,161 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-24 13:06:55,162 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:55,181 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:55,220 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:55,220 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:55,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 67 [2018-01-24 13:06:55,225 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:55,226 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:55,228 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:55,228 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:55,230 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:55,232 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:55,249 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 47 treesize of output 106 [2018-01-24 13:06:55,250 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-24 13:06:55,279 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:55,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:55,304 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:130, output treesize:122 [2018-01-24 13:06:55,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 63 [2018-01-24 13:06:55,373 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:55,374 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:55,376 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:55,377 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:55,378 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:55,380 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:55,381 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:55,382 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:55,383 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:55,383 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:55,384 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:06:55,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-24 13:06:55,390 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:55,418 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:55,473 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:55,475 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:55,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 86 [2018-01-24 13:06:55,480 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:55,481 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:55,482 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:55,483 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:55,484 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:55,484 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:55,486 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:55,487 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:55,488 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:55,489 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:55,511 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 136 [2018-01-24 13:06:55,512 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-24 13:06:55,550 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:55,579 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:55,579 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:160, output treesize:122 [2018-01-24 13:06:55,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 61 [2018-01-24 13:06:55,594 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:55,597 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:06:55,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 35 [2018-01-24 13:06:55,598 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:55,613 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:55,651 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:55,653 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:55,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 78 [2018-01-24 13:06:55,659 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:55,686 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 8 case distinctions, treesize of input 40 treesize of output 93 [2018-01-24 13:06:55,690 INFO L267 ElimStorePlain]: Start of recursive call 5: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 14 xjuncts. [2018-01-24 13:06:55,760 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-24 13:06:55,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-24 13:06:55,813 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:148, output treesize:417 [2018-01-24 13:06:56,095 WARN L146 SmtUtils]: Spent 243ms on a formula simplification. DAG size of input: 67 DAG size of output 67 [2018-01-24 13:06:56,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 307 treesize of output 266 [2018-01-24 13:06:56,123 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:56,124 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:56,125 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:56,126 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:56,127 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:56,128 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:56,129 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:06:56,135 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 71 treesize of output 209 [2018-01-24 13:06:56,135 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:56,182 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:56,428 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:56,430 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:56,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 275 treesize of output 258 [2018-01-24 13:06:56,439 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:56,439 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:56,440 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:56,441 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:56,441 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:56,442 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:56,451 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:56,465 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 96 treesize of output 278 [2018-01-24 13:06:56,467 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-24 13:06:56,563 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-24 13:06:56,895 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:56,896 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:56,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 287 treesize of output 270 [2018-01-24 13:06:56,904 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:56,905 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:56,906 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:56,909 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:56,911 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:56,912 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:56,913 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:56,917 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:56,938 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 96 treesize of output 268 [2018-01-24 13:06:56,940 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-24 13:06:57,051 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-24 13:06:57,512 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:57,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 274 treesize of output 247 [2018-01-24 13:06:57,517 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:57,517 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:57,518 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:57,519 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:57,519 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:57,520 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:57,520 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:06:57,521 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 87 treesize of output 223 [2018-01-24 13:06:57,521 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:57,557 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:57,559 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:57,561 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:57,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 281 treesize of output 264 [2018-01-24 13:06:57,566 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:57,566 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:57,567 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:57,567 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:57,568 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:57,569 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:57,569 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:06:57,570 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 87 treesize of output 223 [2018-01-24 13:06:57,570 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:57,609 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:57,611 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:57,613 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:57,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 278 treesize of output 261 [2018-01-24 13:06:57,619 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:57,619 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:57,620 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:57,621 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:57,622 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:57,622 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:57,623 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:06:57,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 223 [2018-01-24 13:06:57,624 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:57,673 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:58,008 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:58,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 257 treesize of output 240 [2018-01-24 13:06:58,012 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:58,012 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:58,013 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:58,014 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:58,015 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:58,015 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:58,016 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 13:06:58,016 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 213 [2018-01-24 13:06:58,016 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-01-24 13:06:58,056 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:06:58,335 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:58,336 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:58,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 231 treesize of output 224 [2018-01-24 13:06:58,340 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:58,344 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:58,344 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:58,345 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:58,346 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:58,346 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:58,347 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:58,353 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:06:58,367 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 90 treesize of output 248 [2018-01-24 13:06:58,369 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-24 13:06:58,459 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-01-24 13:06:58,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 6 dim-2 vars, End of recursive call: 9 dim-0 vars, and 9 xjuncts. [2018-01-24 13:06:58,820 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 7 variables, input treesize:852, output treesize:2242 [2018-01-24 13:07:02,101 WARN L146 SmtUtils]: Spent 3176ms on a formula simplification. DAG size of input: 214 DAG size of output 124 [2018-01-24 13:07:02,282 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:02,283 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:02,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 240 treesize of output 200 [2018-01-24 13:07:02,288 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:02,291 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:02,293 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:02,294 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:02,295 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:02,296 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:02,297 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:02,297 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:02,305 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:02,329 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 242 [2018-01-24 13:07:02,329 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-01-24 13:07:02,354 INFO L267 ElimStorePlain]: Start of recursive call 3: 41 dim-0 vars, End of recursive call: 41 dim-0 vars, and 45 xjuncts. [2018-01-24 13:07:02,620 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 107 [2018-01-24 13:07:02,620 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 13:07:02,623 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:02,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 119 [2018-01-24 13:07:02,629 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-24 13:07:02,663 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:07:02,757 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 120 treesize of output 90 [2018-01-24 13:07:02,761 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:02,761 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 78 treesize of output 48 [2018-01-24 13:07:02,761 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 13:07:02,783 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:02,784 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:02,784 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:02,785 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:02,785 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:02,786 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:02,787 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:02,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 52 [2018-01-24 13:07:02,788 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-24 13:07:02,802 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:07:02,893 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:02,894 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:02,894 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 290 treesize of output 245 [2018-01-24 13:07:02,899 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:02,900 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:02,900 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:02,907 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:02,908 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:02,922 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:02,939 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:02,976 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 73 treesize of output 289 [2018-01-24 13:07:02,976 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-01-24 13:07:02,999 INFO L267 ElimStorePlain]: Start of recursive call 10: 39 dim-0 vars, End of recursive call: 39 dim-0 vars, and 43 xjuncts. [2018-01-24 13:07:03,213 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:03,213 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 103 [2018-01-24 13:07:03,214 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:07:03,217 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:03,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 117 treesize of output 125 [2018-01-24 13:07:03,234 INFO L267 ElimStorePlain]: Start of recursive call 12: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-01-24 13:07:03,321 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-01-24 13:07:03,518 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:03,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 262 treesize of output 210 [2018-01-24 13:07:03,522 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:03,523 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:03,523 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:03,524 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:03,524 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:03,525 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:03,526 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:03,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 95 [2018-01-24 13:07:03,527 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-01-24 13:07:03,557 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:03,557 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 106 treesize of output 86 [2018-01-24 13:07:03,557 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-01-24 13:07:03,572 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:07:03,737 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:03,738 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:03,738 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 126 treesize of output 93 [2018-01-24 13:07:03,740 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:03,741 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:03,742 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:03,742 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:03,743 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:03,746 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:03,747 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:03,748 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:03,750 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:03,773 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 146 [2018-01-24 13:07:03,774 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-01-24 13:07:03,801 INFO L267 ElimStorePlain]: Start of recursive call 17: 52 dim-0 vars, End of recursive call: 52 dim-0 vars, and 56 xjuncts. [2018-01-24 13:07:04,024 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:04,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 43 [2018-01-24 13:07:04,030 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-24 13:07:04,031 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 40 treesize of output 31 [2018-01-24 13:07:04,032 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:07:04,061 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-01-24 13:07:04,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 122 [2018-01-24 13:07:04,246 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:04,247 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:04,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 56 [2018-01-24 13:07:04,248 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-01-24 13:07:04,269 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:04,270 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:04,270 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:04,271 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:04,271 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:04,272 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:04,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2018-01-24 13:07:04,274 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-01-24 13:07:04,293 INFO L267 ElimStorePlain]: Start of recursive call 20: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:07:04,296 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 152 treesize of output 116 [2018-01-24 13:07:04,298 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:04,299 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:04,299 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:04,300 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:04,300 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:04,301 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:04,304 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 41 treesize of output 89 [2018-01-24 13:07:04,304 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-01-24 13:07:04,328 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:04,329 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:04,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 36 [2018-01-24 13:07:04,330 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-01-24 13:07:04,341 INFO L267 ElimStorePlain]: Start of recursive call 23: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:07:04,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 124 [2018-01-24 13:07:04,346 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:04,347 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:04,347 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:04,348 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:04,349 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:04,349 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:04,352 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 41 treesize of output 78 [2018-01-24 13:07:04,353 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-01-24 13:07:04,382 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:04,382 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:04,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2018-01-24 13:07:04,383 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-01-24 13:07:04,398 INFO L267 ElimStorePlain]: Start of recursive call 26: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:07:04,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 118 [2018-01-24 13:07:04,404 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:04,405 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:04,406 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:04,407 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:04,407 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:04,408 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:04,411 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 41 treesize of output 78 [2018-01-24 13:07:04,412 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-01-24 13:07:04,441 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:04,442 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:07:04,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2018-01-24 13:07:04,443 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-01-24 13:07:04,456 INFO L267 ElimStorePlain]: Start of recursive call 29: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:07:04,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 6 dim-2 vars, End of recursive call: 7 dim-0 vars, and 8 xjuncts. [2018-01-24 13:07:04,562 INFO L202 ElimStorePlain]: Needed 31 recursive calls to eliminate 10 variables, input treesize:793, output treesize:162 [2018-01-24 13:07:04,788 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:07:04,788 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:07:05,041 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-24 13:07:05,049 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:07:05,083 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-24 13:07:05,088 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-24 13:07:05,110 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:07:05,118 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:07:05,138 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-24 13:07:05,143 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:07:05,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-01-24 13:07:05,159 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:235, output treesize:315 [2018-01-24 13:07:12,374 WARN L143 SmtUtils]: Spent 314ms on a formula simplification that was a NOOP. DAG size: 68 Received shutdown request... [2018-01-24 13:07:16,497 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-24 13:07:16,497 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 13:07:16,502 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 13:07:16,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 01:07:16 BoogieIcfgContainer [2018-01-24 13:07:16,502 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 13:07:16,503 INFO L168 Benchmark]: Toolchain (without parser) took 57188.80 ms. Allocated memory was 297.3 MB in the beginning and 688.9 MB in the end (delta: 391.6 MB). Free memory was 257.3 MB in the beginning and 508.8 MB in the end (delta: -251.5 MB). Peak memory consumption was 140.2 MB. Max. memory is 5.3 GB. [2018-01-24 13:07:16,504 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 297.3 MB. Free memory is still 263.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 13:07:16,504 INFO L168 Benchmark]: CACSL2BoogieTranslator took 220.27 ms. Allocated memory is still 297.3 MB. Free memory was 256.3 MB in the beginning and 245.3 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. [2018-01-24 13:07:16,504 INFO L168 Benchmark]: Boogie Preprocessor took 47.01 ms. Allocated memory is still 297.3 MB. Free memory was 245.3 MB in the beginning and 243.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 13:07:16,505 INFO L168 Benchmark]: RCFGBuilder took 496.20 ms. Allocated memory is still 297.3 MB. Free memory was 243.3 MB in the beginning and 215.7 MB in the end (delta: 27.6 MB). Peak memory consumption was 27.6 MB. Max. memory is 5.3 GB. [2018-01-24 13:07:16,505 INFO L168 Benchmark]: TraceAbstraction took 56418.85 ms. Allocated memory was 297.3 MB in the beginning and 688.9 MB in the end (delta: 391.6 MB). Free memory was 215.7 MB in the beginning and 508.8 MB in the end (delta: -293.1 MB). Peak memory consumption was 98.5 MB. Max. memory is 5.3 GB. [2018-01-24 13:07:16,507 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 297.3 MB. Free memory is still 263.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 220.27 ms. Allocated memory is still 297.3 MB. Free memory was 256.3 MB in the beginning and 245.3 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 47.01 ms. Allocated memory is still 297.3 MB. Free memory was 245.3 MB in the beginning and 243.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 496.20 ms. Allocated memory is still 297.3 MB. Free memory was 243.3 MB in the beginning and 215.7 MB in the end (delta: 27.6 MB). Peak memory consumption was 27.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 56418.85 ms. Allocated memory was 297.3 MB in the beginning and 688.9 MB in the end (delta: 391.6 MB). Free memory was 215.7 MB in the beginning and 508.8 MB in the end (delta: -293.1 MB). Peak memory consumption was 98.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 74. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 74. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 672). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 74. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 665). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 74. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 669). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 74. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 659). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 74. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 74. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 74. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 74. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 74. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 74. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 665). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 74. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 74. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 74. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 74. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 74. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 74. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 74. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 74. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 670). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 74. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 74. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 74. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 669). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 74. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 659). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 74. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 74. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 74. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 74. - TimeoutResultAtElement [Line: 620]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 620). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 74. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 74. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 74. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 74. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 74. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 74. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 74. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 74. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 670). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 74. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 74. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 74. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 672). Cancelled while BasicCegarLoop was analyzing trace of length 54 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 74. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 94 locations, 39 error locations. TIMEOUT Result, 56.3s OverallTime, 29 OverallIterations, 3 TraceHistogramMax, 11.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1800 SDtfs, 4911 SDslu, 5038 SDs, 0 SdLazy, 4361 SolverSat, 387 SolverUnsat, 6 SolverUnknown, 0 SolverNotchecked, 7.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1391 GetRequests, 989 SyntacticMatches, 55 SemanticMatches, 347 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1850 ImplicationChecksByTransitivity, 7.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=181occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 28 MinimizatonAttempts, 1284 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 12.7s SatisfiabilityAnalysisTime, 8.6s InterpolantComputationTime, 1486 NumberOfCodeBlocks, 1486 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 1932 ConstructedInterpolants, 198 QuantifiedInterpolants, 676836 SizeOfPredicates, 120 NumberOfNonLiveVariables, 2407 ConjunctsInSsa, 220 ConjunctsInUnsatCore, 54 InterpolantComputations, 21 PerfectInterpolantSequences, 193/391 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_13-07-16-515.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_13-07-16-515.csv Completed graceful shutdown