java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf -i ../../../trunk/examples/svcomp/loops/insertion_sort_false-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 20:26:51,480 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 20:26:51,482 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 20:26:51,498 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 20:26:51,498 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 20:26:51,500 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 20:26:51,501 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 20:26:51,504 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 20:26:51,506 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 20:26:51,508 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 20:26:51,509 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 20:26:51,509 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 20:26:51,511 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 20:26:51,512 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 20:26:51,514 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 20:26:51,514 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 20:26:51,518 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 20:26:51,520 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 20:26:51,530 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 20:26:51,533 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 20:26:51,534 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 20:26:51,535 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 20:26:51,538 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 20:26:51,538 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 20:26:51,539 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 20:26:51,540 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 20:26:51,541 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 20:26:51,541 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 20:26:51,544 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 20:26:51,545 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 20:26:51,545 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 20:26:51,548 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 20:26:51,548 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 20:26:51,548 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 20:26:51,551 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 20:26:51,551 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 20:26:51,552 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-12 20:26:51,579 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 20:26:51,579 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 20:26:51,580 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 20:26:51,580 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 20:26:51,580 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 20:26:51,580 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 20:26:51,580 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 20:26:51,581 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 20:26:51,581 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 20:26:51,581 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 20:26:51,581 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 20:26:51,581 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 20:26:51,582 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 20:26:51,582 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 20:26:51,582 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 20:26:51,582 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 20:26:51,583 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 20:26:51,583 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 20:26:51,583 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 20:26:51,583 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 20:26:51,583 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 20:26:51,584 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 20:26:51,584 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 20:26:51,584 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 20:26:51,584 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 20:26:51,584 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 20:26:51,585 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 20:26:51,585 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 20:26:51,585 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 20:26:51,585 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 20:26:51,585 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 20:26:51,586 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 20:26:51,586 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 20:26:51,586 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 20:26:51,586 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 20:26:51,641 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 20:26:51,652 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 20:26:51,655 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 20:26:51,657 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 20:26:51,657 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 20:26:51,658 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/insertion_sort_false-unreach-call_true-termination.i [2018-11-12 20:26:51,705 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0339138a0/2c5ac1fd35274d53ac5111013b10ce19/FLAG2b5bc4cff [2018-11-12 20:26:52,113 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 20:26:52,113 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/insertion_sort_false-unreach-call_true-termination.i [2018-11-12 20:26:52,120 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0339138a0/2c5ac1fd35274d53ac5111013b10ce19/FLAG2b5bc4cff [2018-11-12 20:26:52,136 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0339138a0/2c5ac1fd35274d53ac5111013b10ce19 [2018-11-12 20:26:52,147 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 20:26:52,148 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 20:26:52,149 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 20:26:52,150 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 20:26:52,153 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 20:26:52,154 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:26:52" (1/1) ... [2018-11-12 20:26:52,157 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3aefa37d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:26:52, skipping insertion in model container [2018-11-12 20:26:52,157 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:26:52" (1/1) ... [2018-11-12 20:26:52,167 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 20:26:52,190 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 20:26:52,386 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 20:26:52,390 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 20:26:52,415 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 20:26:52,442 INFO L193 MainTranslator]: Completed translation [2018-11-12 20:26:52,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:26:52 WrapperNode [2018-11-12 20:26:52,442 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 20:26:52,443 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 20:26:52,445 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 20:26:52,445 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 20:26:52,455 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:26:52" (1/1) ... [2018-11-12 20:26:52,465 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:26:52" (1/1) ... [2018-11-12 20:26:52,474 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 20:26:52,474 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 20:26:52,475 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 20:26:52,475 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 20:26:52,486 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:26:52" (1/1) ... [2018-11-12 20:26:52,486 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:26:52" (1/1) ... [2018-11-12 20:26:52,489 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:26:52" (1/1) ... [2018-11-12 20:26:52,489 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:26:52" (1/1) ... [2018-11-12 20:26:52,511 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:26:52" (1/1) ... [2018-11-12 20:26:52,522 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:26:52" (1/1) ... [2018-11-12 20:26:52,523 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:26:52" (1/1) ... [2018-11-12 20:26:52,526 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 20:26:52,526 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 20:26:52,532 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 20:26:52,532 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 20:26:52,533 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:26:52" (1/1) ... No working directory specified, using /storage/repos/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-11-12 20:26:52,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-12 20:26:52,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 20:26:52,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 20:26:52,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-12 20:26:52,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 20:26:52,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 20:26:52,671 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 20:26:52,671 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 20:26:52,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-12 20:26:52,672 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-12 20:26:52,672 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-12 20:26:52,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-12 20:26:53,107 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 20:26:53,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:26:53 BoogieIcfgContainer [2018-11-12 20:26:53,108 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 20:26:53,109 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 20:26:53,109 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 20:26:53,112 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 20:26:53,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 08:26:52" (1/3) ... [2018-11-12 20:26:53,113 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c99c2ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:26:53, skipping insertion in model container [2018-11-12 20:26:53,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:26:52" (2/3) ... [2018-11-12 20:26:53,114 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c99c2ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:26:53, skipping insertion in model container [2018-11-12 20:26:53,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:26:53" (3/3) ... [2018-11-12 20:26:53,116 INFO L112 eAbstractionObserver]: Analyzing ICFG insertion_sort_false-unreach-call_true-termination.i [2018-11-12 20:26:53,125 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 20:26:53,133 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-12 20:26:53,148 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-12 20:26:53,182 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 20:26:53,182 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 20:26:53,183 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 20:26:53,183 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 20:26:53,183 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 20:26:53,183 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 20:26:53,183 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 20:26:53,183 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 20:26:53,203 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-11-12 20:26:53,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-12 20:26:53,209 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:26:53,210 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:26:53,213 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:26:53,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:26:53,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1403248464, now seen corresponding path program 1 times [2018-11-12 20:26:53,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:26:53,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:26:53,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:26:53,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:26:53,272 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:26:53,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:26:53,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:26:53,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:26:53,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-12 20:26:53,364 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:26:53,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-12 20:26:53,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-12 20:26:53,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-12 20:26:53,383 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 2 states. [2018-11-12 20:26:53,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:26:53,406 INFO L93 Difference]: Finished difference Result 60 states and 77 transitions. [2018-11-12 20:26:53,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-12 20:26:53,407 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-12 20:26:53,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:26:53,415 INFO L225 Difference]: With dead ends: 60 [2018-11-12 20:26:53,416 INFO L226 Difference]: Without dead ends: 28 [2018-11-12 20:26:53,422 INFO L604 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-11-12 20:26:53,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-12 20:26:53,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-12 20:26:53,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-12 20:26:53,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-11-12 20:26:53,470 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 14 [2018-11-12 20:26:53,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:26:53,471 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-11-12 20:26:53,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-12 20:26:53,471 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-12 20:26:53,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-12 20:26:53,474 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:26:53,474 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:26:53,474 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:26:53,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:26:53,475 INFO L82 PathProgramCache]: Analyzing trace with hash 969867983, now seen corresponding path program 1 times [2018-11-12 20:26:53,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:26:53,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:26:53,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:26:53,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:26:53,477 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:26:53,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:26:53,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:26:53,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:26:53,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-12 20:26:53,824 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:26:53,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-12 20:26:53,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-12 20:26:53,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-12 20:26:53,826 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 5 states. [2018-11-12 20:26:53,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:26:53,969 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2018-11-12 20:26:53,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-12 20:26:53,970 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-12 20:26:53,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:26:53,972 INFO L225 Difference]: With dead ends: 52 [2018-11-12 20:26:53,972 INFO L226 Difference]: Without dead ends: 38 [2018-11-12 20:26:53,974 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-12 20:26:53,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-12 20:26:53,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2018-11-12 20:26:53,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-12 20:26:53,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-11-12 20:26:53,988 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 15 [2018-11-12 20:26:53,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:26:53,989 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-11-12 20:26:53,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-12 20:26:53,989 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-12 20:26:53,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-12 20:26:53,990 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:26:53,990 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:26:53,990 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:26:53,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:26:53,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1889876064, now seen corresponding path program 1 times [2018-11-12 20:26:53,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:26:53,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:26:53,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:26:53,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:26:53,994 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:26:54,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:26:54,438 WARN L179 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 11 [2018-11-12 20:26:54,644 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 23 [2018-11-12 20:26:54,872 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 18 [2018-11-12 20:26:55,028 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:26:55,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:26:55,028 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:26:55,029 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-11-12 20:26:55,031 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [18], [20], [23], [29], [42], [44], [48], [52], [57], [67], [70], [72], [78], [79], [80], [82] [2018-11-12 20:26:55,064 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 20:26:55,065 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 20:26:55,187 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 20:26:55,524 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 20:26:55,526 INFO L272 AbstractInterpreter]: Visited 22 different actions 112 times. Merged at 12 different actions 69 times. Widened at 3 different actions 5 times. Performed 669 root evaluator evaluations with a maximum evaluation depth of 3. Performed 669 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 24 variables. [2018-11-12 20:26:55,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:26:55,544 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 20:26:55,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:26:55,544 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/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-11-12 20:26:55,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:26:55,556 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:26:55,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:26:55,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:26:56,248 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 28 treesize of output 23 [2018-11-12 20:26:56,253 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:26:56,256 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 23 treesize of output 37 [2018-11-12 20:26:56,256 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:26:56,286 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:26:56,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-12 20:26:56,299 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2018-11-12 20:26:56,349 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 26 treesize of output 18 [2018-11-12 20:26:56,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-12 20:26:56,357 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:26:56,359 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:26:56,360 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:26:56,360 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-12 20:26:56,391 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:26:56,391 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:26:56,669 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 43 treesize of output 37 [2018-11-12 20:26:56,778 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:26:56,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-11-12 20:26:56,796 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:26:56,815 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:26:56,817 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:26:56,819 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:26:56,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 43 [2018-11-12 20:26:56,857 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-12 20:26:56,861 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:26:56,862 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:26:56,863 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:26:56,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 45 [2018-11-12 20:26:56,878 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-12 20:26:56,929 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-12 20:26:56,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:26:56,938 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:10 [2018-11-12 20:26:57,096 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:26:57,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:26:57,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 26 [2018-11-12 20:26:57,119 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:26:57,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-12 20:26:57,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-12 20:26:57,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=553, Unknown=0, NotChecked=0, Total=650 [2018-11-12 20:26:57,122 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 17 states. [2018-11-12 20:26:57,310 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 12 [2018-11-12 20:26:58,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:26:58,264 INFO L93 Difference]: Finished difference Result 101 states and 124 transitions. [2018-11-12 20:26:58,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-12 20:26:58,265 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 23 [2018-11-12 20:26:58,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:26:58,268 INFO L225 Difference]: With dead ends: 101 [2018-11-12 20:26:58,268 INFO L226 Difference]: Without dead ends: 79 [2018-11-12 20:26:58,270 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=264, Invalid=1142, Unknown=0, NotChecked=0, Total=1406 [2018-11-12 20:26:58,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-12 20:26:58,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 52. [2018-11-12 20:26:58,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-12 20:26:58,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2018-11-12 20:26:58,285 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 23 [2018-11-12 20:26:58,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:26:58,286 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2018-11-12 20:26:58,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-12 20:26:58,286 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2018-11-12 20:26:58,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-12 20:26:58,288 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:26:58,288 INFO L375 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] [2018-11-12 20:26:58,289 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:26:58,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:26:58,289 INFO L82 PathProgramCache]: Analyzing trace with hash -249426572, now seen corresponding path program 1 times [2018-11-12 20:26:58,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:26:58,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:26:58,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:26:58,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:26:58,290 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:26:58,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:26:59,107 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:26:59,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:26:59,108 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:26:59,108 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-11-12 20:26:59,108 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [18], [20], [23], [25], [29], [31], [34], [38], [42], [44], [48], [52], [57], [67], [70], [72], [78], [79], [80], [82] [2018-11-12 20:26:59,110 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 20:26:59,111 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 20:26:59,122 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 20:26:59,400 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 20:26:59,400 INFO L272 AbstractInterpreter]: Visited 26 different actions 157 times. Merged at 16 different actions 94 times. Widened at 4 different actions 7 times. Performed 887 root evaluator evaluations with a maximum evaluation depth of 3. Performed 887 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 19 fixpoints after 8 different actions. Largest state had 25 variables. [2018-11-12 20:26:59,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:26:59,439 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 20:26:59,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:26:59,440 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:26:59,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:26:59,455 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:26:59,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:26:59,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:26:59,778 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 38 treesize of output 31 [2018-11-12 20:26:59,782 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:26:59,783 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 31 treesize of output 47 [2018-11-12 20:26:59,784 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:26:59,791 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:26:59,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:26:59,801 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:40 [2018-11-12 20:27:00,311 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:27:00,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 52 [2018-11-12 20:27:00,338 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:27:00,339 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:27:00,340 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:00,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 72 [2018-11-12 20:27:00,342 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:27:00,363 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:27:00,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-12 20:27:00,378 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:64, output treesize:29 [2018-11-12 20:27:00,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2018-11-12 20:27:00,516 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:00,517 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:27:00,518 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:27:00,518 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:00,519 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:27:00,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2018-11-12 20:27:00,523 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:27:00,535 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:27:00,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:27:00,543 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:5 [2018-11-12 20:27:00,566 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:27:00,567 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:27:01,302 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 77 treesize of output 67 [2018-11-12 20:27:01,306 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:01,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 68 [2018-11-12 20:27:01,422 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-12 20:27:01,423 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-12 20:27:01,450 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:01,463 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:01,477 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:01,513 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:01,526 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:01,539 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:01,634 INFO L303 Elim1Store]: Index analysis took 209 ms [2018-11-12 20:27:01,708 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 86 [2018-11-12 20:27:01,710 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-12 20:27:01,722 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:01,724 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:01,726 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:01,728 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:01,730 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:01,731 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:01,732 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:01,797 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 87 [2018-11-12 20:27:01,801 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-12 20:27:01,804 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:01,806 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:01,806 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:01,808 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:01,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 57 [2018-11-12 20:27:01,810 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-12 20:27:01,814 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:01,815 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:01,816 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:01,817 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:01,818 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:01,819 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:01,832 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 86 [2018-11-12 20:27:01,834 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-12 20:27:01,839 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:01,839 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:01,840 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:01,841 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:01,842 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:01,842 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:01,843 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:01,856 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 87 [2018-11-12 20:27:01,859 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-11-12 20:27:01,876 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-12 20:27:01,876 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-12 20:27:01,949 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:27:01,952 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:27:01,962 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-11-12 20:27:01,963 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:87, output treesize:16 [2018-11-12 20:27:02,007 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:27:02,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:27:02,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 14] total 40 [2018-11-12 20:27:02,028 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:27:02,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-12 20:27:02,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-12 20:27:02,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=1369, Unknown=0, NotChecked=0, Total=1560 [2018-11-12 20:27:02,030 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand 28 states. [2018-11-12 20:27:02,559 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 26 [2018-11-12 20:27:04,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:27:04,048 INFO L93 Difference]: Finished difference Result 154 states and 189 transitions. [2018-11-12 20:27:04,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-12 20:27:04,049 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 29 [2018-11-12 20:27:04,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:27:04,053 INFO L225 Difference]: With dead ends: 154 [2018-11-12 20:27:04,053 INFO L226 Difference]: Without dead ends: 113 [2018-11-12 20:27:04,055 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 883 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=388, Invalid=2582, Unknown=0, NotChecked=0, Total=2970 [2018-11-12 20:27:04,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-11-12 20:27:04,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 69. [2018-11-12 20:27:04,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-12 20:27:04,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 82 transitions. [2018-11-12 20:27:04,067 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 82 transitions. Word has length 29 [2018-11-12 20:27:04,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:27:04,067 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 82 transitions. [2018-11-12 20:27:04,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-12 20:27:04,067 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 82 transitions. [2018-11-12 20:27:04,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-12 20:27:04,069 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:27:04,069 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:27:04,069 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:27:04,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:27:04,070 INFO L82 PathProgramCache]: Analyzing trace with hash -853417747, now seen corresponding path program 1 times [2018-11-12 20:27:04,070 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:27:04,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:27:04,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:27:04,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:27:04,071 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:27:04,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:27:04,253 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:27:04,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:27:04,254 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:27:04,254 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 33 with the following transitions: [2018-11-12 20:27:04,254 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [18], [20], [23], [29], [42], [44], [48], [52], [57], [59], [61], [67], [70], [72], [75], [77], [78], [79], [80], [82], [83] [2018-11-12 20:27:04,256 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 20:27:04,256 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 20:27:04,264 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 20:27:04,437 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 20:27:04,438 INFO L272 AbstractInterpreter]: Visited 27 different actions 197 times. Merged at 15 different actions 104 times. Widened at 4 different actions 9 times. Performed 857 root evaluator evaluations with a maximum evaluation depth of 5. Performed 857 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 8 fixpoints after 3 different actions. Largest state had 25 variables. [2018-11-12 20:27:04,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:27:04,470 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 20:27:04,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:27:04,470 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/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-11-12 20:27:04,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:27:04,488 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:27:04,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:27:04,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:27:04,715 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:27:04,716 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:27:04,871 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:27:04,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:27:04,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2018-11-12 20:27:04,901 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:27:04,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-12 20:27:04,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-12 20:27:04,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-12 20:27:04,903 INFO L87 Difference]: Start difference. First operand 69 states and 82 transitions. Second operand 8 states. [2018-11-12 20:27:05,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:27:05,093 INFO L93 Difference]: Finished difference Result 127 states and 151 transitions. [2018-11-12 20:27:05,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 20:27:05,093 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-11-12 20:27:05,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:27:05,095 INFO L225 Difference]: With dead ends: 127 [2018-11-12 20:27:05,095 INFO L226 Difference]: Without dead ends: 108 [2018-11-12 20:27:05,095 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 56 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-11-12 20:27:05,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-12 20:27:05,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 79. [2018-11-12 20:27:05,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-12 20:27:05,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 91 transitions. [2018-11-12 20:27:05,110 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 91 transitions. Word has length 32 [2018-11-12 20:27:05,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:27:05,110 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 91 transitions. [2018-11-12 20:27:05,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-12 20:27:05,110 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 91 transitions. [2018-11-12 20:27:05,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-12 20:27:05,111 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:27:05,111 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:27:05,112 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:27:05,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:27:05,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1757852431, now seen corresponding path program 2 times [2018-11-12 20:27:05,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:27:05,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:27:05,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:27:05,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:27:05,113 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:27:05,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:27:05,771 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:27:05,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:27:05,772 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:27:05,772 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:27:05,772 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:27:05,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:27:05,773 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:27:05,790 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:27:05,790 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:27:05,814 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-12 20:27:05,814 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:27:05,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:27:06,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-11-12 20:27:06,070 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:27:06,072 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 23 treesize of output 37 [2018-11-12 20:27:06,073 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:27:06,079 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:27:06,089 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:27:06,090 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2018-11-12 20:27:06,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-11-12 20:27:06,341 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:27:06,345 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:27:06,347 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:27:06,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2018-11-12 20:27:06,355 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:27:06,370 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:27:06,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-12 20:27:06,383 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:25 [2018-11-12 20:27:06,420 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 26 treesize of output 18 [2018-11-12 20:27:06,425 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-12 20:27:06,426 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:27:06,427 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:27:06,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:27:06,429 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-12 20:27:06,477 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:27:06,477 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:27:08,662 WARN L832 $PredicateComparison]: unable to prove that (forall ((main_~key~0 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_main_~#v~0.base|) (+ (* 4 c_main_~i~0) |c_main_~#v~0.offset| 4) main_~key~0))) (< (select .cse0 |c_main_~#v~0.offset|) (+ (select .cse0 (+ |c_main_~#v~0.offset| 4)) 1)))) is different from false [2018-11-12 20:27:10,725 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 20 [2018-11-12 20:27:10,965 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-11-12 20:27:13,104 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 59 treesize of output 53 [2018-11-12 20:27:13,107 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:13,109 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 60 [2018-11-12 20:27:13,188 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:13,190 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:13,191 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:13,192 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:13,193 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:13,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 83 [2018-11-12 20:27:13,218 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-11-12 20:27:13,258 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:13,270 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:13,271 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:13,272 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:13,273 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:13,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 83 [2018-11-12 20:27:13,319 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-11-12 20:27:13,322 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:13,326 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:13,326 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:13,330 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:13,330 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:13,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 85 [2018-11-12 20:27:13,352 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-11-12 20:27:13,357 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-12 20:27:13,358 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-12 20:27:13,362 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:13,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 52 [2018-11-12 20:27:13,380 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-11-12 20:27:13,382 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:13,383 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:13,384 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:13,385 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:13,386 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:13,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 85 [2018-11-12 20:27:13,410 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-11-12 20:27:13,411 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-12 20:27:13,411 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-12 20:27:13,474 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-12 20:27:13,493 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-12 20:27:13,517 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-12 20:27:13,517 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:64, output treesize:58 [2018-11-12 20:27:13,657 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-11-12 20:27:13,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:27:13,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 17] total 34 [2018-11-12 20:27:13,680 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:27:13,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-12 20:27:13,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-12 20:27:13,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=921, Unknown=2, NotChecked=62, Total=1122 [2018-11-12 20:27:13,683 INFO L87 Difference]: Start difference. First operand 79 states and 91 transitions. Second operand 20 states. [2018-11-12 20:27:15,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:27:15,149 INFO L93 Difference]: Finished difference Result 161 states and 195 transitions. [2018-11-12 20:27:15,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-12 20:27:15,149 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 31 [2018-11-12 20:27:15,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:27:15,151 INFO L225 Difference]: With dead ends: 161 [2018-11-12 20:27:15,151 INFO L226 Difference]: Without dead ends: 139 [2018-11-12 20:27:15,152 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 37 SyntacticMatches, 7 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=339, Invalid=1919, Unknown=2, NotChecked=92, Total=2352 [2018-11-12 20:27:15,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-11-12 20:27:15,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 92. [2018-11-12 20:27:15,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-12 20:27:15,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 107 transitions. [2018-11-12 20:27:15,164 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 107 transitions. Word has length 31 [2018-11-12 20:27:15,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:27:15,165 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 107 transitions. [2018-11-12 20:27:15,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-12 20:27:15,165 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 107 transitions. [2018-11-12 20:27:15,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-12 20:27:15,166 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:27:15,166 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:27:15,167 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:27:15,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:27:15,167 INFO L82 PathProgramCache]: Analyzing trace with hash -289889213, now seen corresponding path program 1 times [2018-11-12 20:27:15,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:27:15,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:27:15,168 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:27:15,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:27:15,169 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:27:15,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:27:15,556 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:27:15,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:27:15,556 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:27:15,557 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 38 with the following transitions: [2018-11-12 20:27:15,557 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [18], [20], [23], [29], [31], [34], [38], [42], [44], [48], [52], [57], [67], [70], [72], [78], [79], [80], [82] [2018-11-12 20:27:15,559 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 20:27:15,559 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 20:27:15,566 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 20:27:15,661 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 20:27:15,662 INFO L272 AbstractInterpreter]: Visited 25 different actions 117 times. Merged at 15 different actions 68 times. Widened at 3 different actions 4 times. Performed 622 root evaluator evaluations with a maximum evaluation depth of 3. Performed 622 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 6 fixpoints after 3 different actions. Largest state had 25 variables. [2018-11-12 20:27:15,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:27:15,691 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 20:27:15,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:27:15,691 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/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-11-12 20:27:15,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:27:15,702 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:27:15,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:27:15,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:27:16,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-11-12 20:27:16,074 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:27:16,082 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 23 treesize of output 37 [2018-11-12 20:27:16,082 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:27:16,091 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:27:16,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-12 20:27:16,102 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-11-12 20:27:16,131 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 26 treesize of output 18 [2018-11-12 20:27:16,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-12 20:27:16,136 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:27:16,137 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:27:16,139 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:27:16,139 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-12 20:27:16,156 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:27:16,156 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:27:16,267 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 43 treesize of output 37 [2018-11-12 20:27:16,318 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:16,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-11-12 20:27:16,321 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:27:16,324 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:16,326 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:16,327 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:16,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 43 [2018-11-12 20:27:16,339 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-12 20:27:16,342 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:16,343 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:16,344 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:16,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 45 [2018-11-12 20:27:16,356 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-12 20:27:16,387 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-12 20:27:16,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:27:16,394 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:10 [2018-11-12 20:27:16,564 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:27:16,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:27:16,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 28 [2018-11-12 20:27:16,586 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:27:16,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-12 20:27:16,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-12 20:27:16,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=649, Unknown=0, NotChecked=0, Total=756 [2018-11-12 20:27:16,588 INFO L87 Difference]: Start difference. First operand 92 states and 107 transitions. Second operand 17 states. [2018-11-12 20:27:17,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:27:17,860 INFO L93 Difference]: Finished difference Result 248 states and 306 transitions. [2018-11-12 20:27:17,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-12 20:27:17,861 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 37 [2018-11-12 20:27:17,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:27:17,864 INFO L225 Difference]: With dead ends: 248 [2018-11-12 20:27:17,864 INFO L226 Difference]: Without dead ends: 195 [2018-11-12 20:27:17,866 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 55 SyntacticMatches, 6 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 620 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=513, Invalid=2037, Unknown=0, NotChecked=0, Total=2550 [2018-11-12 20:27:17,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-11-12 20:27:17,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 105. [2018-11-12 20:27:17,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-12 20:27:17,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 125 transitions. [2018-11-12 20:27:17,881 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 125 transitions. Word has length 37 [2018-11-12 20:27:17,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:27:17,882 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 125 transitions. [2018-11-12 20:27:17,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-12 20:27:17,882 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 125 transitions. [2018-11-12 20:27:17,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-12 20:27:17,884 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:27:17,884 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:27:17,884 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:27:17,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:27:17,884 INFO L82 PathProgramCache]: Analyzing trace with hash -876695227, now seen corresponding path program 2 times [2018-11-12 20:27:17,885 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:27:17,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:27:17,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:27:17,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:27:17,886 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:27:17,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:27:18,045 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:27:18,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:27:18,046 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:27:18,046 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:27:18,046 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:27:18,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:27:18,046 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:27:18,054 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:27:18,054 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:27:18,077 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-12 20:27:18,077 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:27:18,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:27:18,086 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:27:18,086 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:27:18,105 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:27:18,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:27:18,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2018-11-12 20:27:18,126 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:27:18,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-12 20:27:18,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-12 20:27:18,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-12 20:27:18,129 INFO L87 Difference]: Start difference. First operand 105 states and 125 transitions. Second operand 7 states. [2018-11-12 20:27:18,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:27:18,286 INFO L93 Difference]: Finished difference Result 192 states and 233 transitions. [2018-11-12 20:27:18,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-12 20:27:18,287 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2018-11-12 20:27:18,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:27:18,289 INFO L225 Difference]: With dead ends: 192 [2018-11-12 20:27:18,289 INFO L226 Difference]: Without dead ends: 128 [2018-11-12 20:27:18,290 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2018-11-12 20:27:18,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-12 20:27:18,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 93. [2018-11-12 20:27:18,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-12 20:27:18,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 107 transitions. [2018-11-12 20:27:18,303 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 107 transitions. Word has length 37 [2018-11-12 20:27:18,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:27:18,303 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 107 transitions. [2018-11-12 20:27:18,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-12 20:27:18,304 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 107 transitions. [2018-11-12 20:27:18,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-12 20:27:18,305 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:27:18,305 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:27:18,306 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:27:18,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:27:18,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1634323973, now seen corresponding path program 3 times [2018-11-12 20:27:18,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:27:18,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:27:18,307 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:27:18,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:27:18,307 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:27:18,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:27:18,701 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-11-12 20:27:19,254 WARN L179 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 24 [2018-11-12 20:27:19,859 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:27:19,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:27:19,860 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:27:19,860 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:27:19,860 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:27:19,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:27:19,860 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/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-11-12 20:27:19,869 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:27:19,869 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:27:19,887 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:27:19,888 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:27:19,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:27:20,034 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 38 treesize of output 31 [2018-11-12 20:27:20,038 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:27:20,039 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 31 treesize of output 47 [2018-11-12 20:27:20,040 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:27:20,046 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:27:20,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:27:20,059 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:46 [2018-11-12 20:27:20,278 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:27:20,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 54 [2018-11-12 20:27:20,282 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:27:20,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-11-12 20:27:20,285 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:27:20,294 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:27:20,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-12 20:27:20,311 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:41 [2018-11-12 20:27:20,357 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 29 treesize of output 22 [2018-11-12 20:27:20,359 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:27:20,360 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:27:20,361 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:27:20,362 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:27:20,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 59 [2018-11-12 20:27:20,367 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:27:20,382 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:27:20,389 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:27:20,390 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:19 [2018-11-12 20:27:20,442 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 28 treesize of output 20 [2018-11-12 20:27:20,473 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:27:20,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-12 20:27:20,475 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:27:20,498 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:27:20,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:27:20,523 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-11-12 20:27:20,571 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:27:20,571 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:27:22,688 WARN L832 $PredicateComparison]: unable to prove that (forall ((main_~key~0 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_main_~#v~0.base|) (+ (* 4 c_main_~i~0) |c_main_~#v~0.offset| 4) main_~key~0))) (< (select .cse0 |c_main_~#v~0.offset|) (+ (select .cse0 (+ |c_main_~#v~0.offset| 4)) 1)))) is different from false [2018-11-12 20:27:27,243 WARN L832 $PredicateComparison]: unable to prove that (forall ((main_~key~0 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_main_~#v~0.base|) (+ (* 4 c_main_~j~0) |c_main_~#v~0.offset| 4) main_~key~0))) (< (select .cse0 |c_main_~#v~0.offset|) (+ (select .cse0 (+ |c_main_~#v~0.offset| 4)) 1)))) is different from false [2018-11-12 20:27:29,264 WARN L832 $PredicateComparison]: unable to prove that (forall ((v_subst_2 Int)) (let ((.cse0 (store (store (select |c_#memory_int| |c_main_~#v~0.base|) (+ (* 4 c_main_~i~0) |c_main_~#v~0.offset| 4) c_main_~key~0) (+ (* 4 c_main_~j~0) |c_main_~#v~0.offset| 4) v_subst_2))) (< (select .cse0 |c_main_~#v~0.offset|) (+ (select .cse0 (+ |c_main_~#v~0.offset| 4)) 1)))) is different from false [2018-11-12 20:27:33,461 WARN L179 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 24 [2018-11-12 20:27:39,647 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 29 [2018-11-12 20:27:39,657 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 91 treesize of output 81 [2018-11-12 20:27:39,659 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:39,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 82 [2018-11-12 20:27:39,692 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:39,695 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:39,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 76 [2018-11-12 20:27:39,765 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:39,766 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:39,766 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:39,768 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:39,769 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:39,770 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:39,776 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:39,783 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 84 [2018-11-12 20:27:39,785 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-12 20:27:39,788 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:39,789 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:39,793 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:39,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 58 [2018-11-12 20:27:39,800 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-12 20:27:39,803 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:39,804 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:39,804 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:39,806 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:39,807 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:39,807 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:39,814 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:39,821 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 83 [2018-11-12 20:27:39,823 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-12 20:27:39,828 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:39,832 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:39,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 64 [2018-11-12 20:27:39,847 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 3 xjuncts. [2018-11-12 20:27:39,850 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:39,851 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:39,852 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:39,853 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:39,854 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:39,855 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:39,861 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:39,868 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 85 [2018-11-12 20:27:39,871 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-11-12 20:27:39,874 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:39,874 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:39,875 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:39,876 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:39,877 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:39,878 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:39,885 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:39,894 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 83 [2018-11-12 20:27:39,896 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-11-12 20:27:39,901 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:39,903 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:39,903 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:39,905 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:39,906 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:39,906 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:39,913 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:39,921 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 85 [2018-11-12 20:27:39,926 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-11-12 20:27:39,991 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-12 20:27:40,008 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-12 20:27:40,024 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-12 20:27:40,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-12 20:27:40,044 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:96, output treesize:43 [2018-11-12 20:27:44,620 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 7 refuted. 2 times theorem prover too weak. 0 trivial. 11 not checked. [2018-11-12 20:27:44,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:27:44,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 42 [2018-11-12 20:27:44,655 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:27:44,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-12 20:27:44,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-12 20:27:44,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1282, Unknown=10, NotChecked=228, Total=1722 [2018-11-12 20:27:44,657 INFO L87 Difference]: Start difference. First operand 93 states and 107 transitions. Second operand 27 states. [2018-11-12 20:27:45,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:27:45,787 INFO L93 Difference]: Finished difference Result 134 states and 155 transitions. [2018-11-12 20:27:45,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-12 20:27:45,787 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 37 [2018-11-12 20:27:45,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:27:45,789 INFO L225 Difference]: With dead ends: 134 [2018-11-12 20:27:45,789 INFO L226 Difference]: Without dead ends: 132 [2018-11-12 20:27:45,791 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 45 SyntacticMatches, 8 SemanticMatches, 48 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 762 ImplicationChecksByTransitivity, 25.8s TimeCoverageRelationStatistics Valid=308, Invalid=1856, Unknown=10, NotChecked=276, Total=2450 [2018-11-12 20:27:45,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-11-12 20:27:45,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 93. [2018-11-12 20:27:45,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-12 20:27:45,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 107 transitions. [2018-11-12 20:27:45,802 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 107 transitions. Word has length 37 [2018-11-12 20:27:45,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:27:45,802 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 107 transitions. [2018-11-12 20:27:45,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-12 20:27:45,803 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 107 transitions. [2018-11-12 20:27:45,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-12 20:27:45,807 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:27:45,807 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:27:45,807 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:27:45,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:27:45,808 INFO L82 PathProgramCache]: Analyzing trace with hash -411213956, now seen corresponding path program 2 times [2018-11-12 20:27:45,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:27:45,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:27:45,809 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:27:45,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:27:45,809 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:27:45,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:27:46,566 WARN L179 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 22 [2018-11-12 20:27:46,853 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:27:46,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:27:46,853 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:27:46,853 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:27:46,853 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:27:46,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:27:46,854 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:27:46,865 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:27:46,866 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:27:46,885 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-12 20:27:46,885 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:27:46,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:27:47,013 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-11-12 20:27:47,015 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:27:47,017 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-11-12 20:27:47,018 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:27:47,030 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:27:47,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:27:47,038 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-11-12 20:27:47,423 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 26 treesize of output 18 [2018-11-12 20:27:47,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-12 20:27:47,436 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:27:47,438 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:27:47,441 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:27:47,441 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-12 20:27:47,552 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:27:47,552 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:27:47,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2018-11-12 20:27:47,857 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 27 [2018-11-12 20:27:47,859 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:47,861 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:47,864 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:47,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 53 [2018-11-12 20:27:47,872 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-12 20:27:47,874 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:47,875 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:47,876 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:47,885 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 51 [2018-11-12 20:27:47,887 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-12 20:27:47,915 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:27:47,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-11-12 20:27:47,939 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-12 20:27:48,167 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:27:48,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:27:48,168 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:47, output treesize:11 [2018-11-12 20:27:48,207 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:27:48,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:27:48,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 13] total 33 [2018-11-12 20:27:48,230 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:27:48,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-12 20:27:48,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-12 20:27:48,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=950, Unknown=0, NotChecked=0, Total=1056 [2018-11-12 20:27:48,231 INFO L87 Difference]: Start difference. First operand 93 states and 107 transitions. Second operand 29 states. [2018-11-12 20:27:59,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:27:59,766 INFO L93 Difference]: Finished difference Result 168 states and 193 transitions. [2018-11-12 20:27:59,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-12 20:27:59,767 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 40 [2018-11-12 20:27:59,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:27:59,769 INFO L225 Difference]: With dead ends: 168 [2018-11-12 20:27:59,769 INFO L226 Difference]: Without dead ends: 166 [2018-11-12 20:27:59,770 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 61 SyntacticMatches, 7 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 681 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=317, Invalid=2233, Unknown=0, NotChecked=0, Total=2550 [2018-11-12 20:27:59,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-11-12 20:27:59,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 111. [2018-11-12 20:27:59,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-12 20:27:59,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 127 transitions. [2018-11-12 20:27:59,785 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 127 transitions. Word has length 40 [2018-11-12 20:27:59,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:27:59,786 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 127 transitions. [2018-11-12 20:27:59,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-12 20:27:59,786 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 127 transitions. [2018-11-12 20:27:59,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-12 20:27:59,788 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:27:59,788 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:27:59,788 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:27:59,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:27:59,789 INFO L82 PathProgramCache]: Analyzing trace with hash 2011153175, now seen corresponding path program 4 times [2018-11-12 20:27:59,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:27:59,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:27:59,790 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:27:59,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:27:59,790 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:27:59,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:28:00,191 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-11-12 20:28:00,539 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 14 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:28:00,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:28:00,539 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:28:00,539 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:28:00,539 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:28:00,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:28:00,540 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/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-11-12 20:28:00,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:28:00,548 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:28:00,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:28:00,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:28:00,741 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 38 treesize of output 31 [2018-11-12 20:28:00,746 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:28:00,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 47 [2018-11-12 20:28:00,747 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:28:00,755 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:28:00,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:28:00,764 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:40 [2018-11-12 20:28:01,387 WARN L179 SmtUtils]: Spent 282.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-11-12 20:28:01,860 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:28:01,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 52 [2018-11-12 20:28:01,888 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:01,913 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:28:01,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 58 [2018-11-12 20:28:01,915 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:28:02,035 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:28:02,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-12 20:28:02,050 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:64, output treesize:29 [2018-11-12 20:28:02,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2018-11-12 20:28:02,112 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:28:02,113 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:02,113 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:28:02,114 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:02,115 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:28:02,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 56 [2018-11-12 20:28:02,117 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:28:02,125 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:28:02,131 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:28:02,132 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:5 [2018-11-12 20:28:02,145 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 7 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:28:02,145 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:28:02,439 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 77 treesize of output 67 [2018-11-12 20:28:02,448 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:02,449 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 68 [2018-11-12 20:28:02,514 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-12 20:28:02,514 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-12 20:28:02,517 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:02,517 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:02,537 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:02,553 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:02,586 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:02,593 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:02,594 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:02,607 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 87 [2018-11-12 20:28:02,608 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-12 20:28:02,614 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:02,615 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:02,617 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:02,617 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:02,620 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:02,621 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:02,637 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 86 [2018-11-12 20:28:02,638 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-12 20:28:02,641 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:02,641 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:02,643 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:02,643 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:02,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 57 [2018-11-12 20:28:02,644 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-12 20:28:02,647 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:02,647 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:02,649 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:02,650 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:02,654 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:02,654 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:02,656 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:02,687 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 87 [2018-11-12 20:28:02,689 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-12 20:28:02,694 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-12 20:28:02,694 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-12 20:28:02,698 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:02,699 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:02,700 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:02,700 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:02,704 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:02,704 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:02,719 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 86 [2018-11-12 20:28:02,721 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-11-12 20:28:02,763 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:28:02,765 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:28:02,776 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-11-12 20:28:02,777 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:87, output treesize:16 [2018-11-12 20:28:02,866 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 22 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-12 20:28:02,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:28:02,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 14] total 43 [2018-11-12 20:28:02,886 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:28:02,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-12 20:28:02,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-12 20:28:02,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=1587, Unknown=0, NotChecked=0, Total=1806 [2018-11-12 20:28:02,888 INFO L87 Difference]: Start difference. First operand 111 states and 127 transitions. Second operand 31 states. [2018-11-12 20:28:05,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:28:05,022 INFO L93 Difference]: Finished difference Result 242 states and 285 transitions. [2018-11-12 20:28:05,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-12 20:28:05,022 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 43 [2018-11-12 20:28:05,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:28:05,023 INFO L225 Difference]: With dead ends: 242 [2018-11-12 20:28:05,024 INFO L226 Difference]: Without dead ends: 192 [2018-11-12 20:28:05,025 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 60 SyntacticMatches, 6 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1464 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=756, Invalid=4074, Unknown=0, NotChecked=0, Total=4830 [2018-11-12 20:28:05,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-11-12 20:28:05,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 117. [2018-11-12 20:28:05,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-11-12 20:28:05,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 133 transitions. [2018-11-12 20:28:05,039 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 133 transitions. Word has length 43 [2018-11-12 20:28:05,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:28:05,039 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 133 transitions. [2018-11-12 20:28:05,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-12 20:28:05,040 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 133 transitions. [2018-11-12 20:28:05,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-12 20:28:05,041 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:28:05,041 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:28:05,041 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:28:05,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:28:05,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1389059306, now seen corresponding path program 1 times [2018-11-12 20:28:05,041 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:28:05,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:28:05,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:28:05,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:28:05,042 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:28:05,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:28:05,577 WARN L179 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 11 [2018-11-12 20:28:05,887 WARN L179 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 22 [2018-11-12 20:28:06,283 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:28:06,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:28:06,284 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:28:06,284 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 46 with the following transitions: [2018-11-12 20:28:06,284 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [18], [20], [23], [29], [31], [36], [38], [42], [44], [48], [52], [57], [67], [70], [72], [78], [79], [80], [82] [2018-11-12 20:28:06,286 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 20:28:06,286 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 20:28:06,292 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 20:28:06,390 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 20:28:06,390 INFO L272 AbstractInterpreter]: Visited 25 different actions 140 times. Merged at 15 different actions 87 times. Widened at 4 different actions 6 times. Performed 759 root evaluator evaluations with a maximum evaluation depth of 3. Performed 759 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 8 fixpoints after 3 different actions. Largest state had 24 variables. [2018-11-12 20:28:06,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:28:06,432 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 20:28:06,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:28:06,432 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:28:06,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:28:06,449 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:28:06,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:28:06,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:28:06,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 28 treesize of output 23 [2018-11-12 20:28:06,592 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:28:06,594 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 23 treesize of output 37 [2018-11-12 20:28:06,595 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:28:06,610 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:28:06,619 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:28:06,620 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2018-11-12 20:28:06,646 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 29 treesize of output 22 [2018-11-12 20:28:06,651 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:28:06,652 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:28:06,652 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:28:06,656 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 22 treesize of output 49 [2018-11-12 20:28:06,657 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:28:06,667 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:28:06,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:28:06,675 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:19 [2018-11-12 20:28:06,730 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-11-12 20:28:06,733 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:28:06,733 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:28:06,735 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:28:06,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2018-11-12 20:28:06,740 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:28:06,753 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:28:06,763 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:28:06,763 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2018-11-12 20:28:06,777 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 26 treesize of output 18 [2018-11-12 20:28:06,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-12 20:28:06,788 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:28:06,790 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:28:06,791 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:28:06,791 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-12 20:28:06,906 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 35 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-12 20:28:06,907 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:28:30,064 WARN L832 $PredicateComparison]: unable to prove that (forall ((main_~key~0 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_main_~#v~0.base|) (+ (* 4 c_main_~j~0) |c_main_~#v~0.offset| 4) main_~key~0))) (< (select .cse0 |c_main_~#v~0.offset|) (+ (select .cse0 (+ |c_main_~#v~0.offset| 4)) 1)))) is different from false [2018-11-12 20:28:32,092 WARN L832 $PredicateComparison]: unable to prove that (forall ((v_subst_3 Int)) (let ((.cse0 (store (store (select |c_#memory_int| |c_main_~#v~0.base|) (+ (* 4 c_main_~i~0) |c_main_~#v~0.offset| 4) c_main_~key~0) (+ (* 4 c_main_~j~0) |c_main_~#v~0.offset| 4) v_subst_3))) (< (select .cse0 |c_main_~#v~0.offset|) (+ (select .cse0 (+ |c_main_~#v~0.offset| 4)) 1)))) is different from false [2018-11-12 20:28:32,130 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 59 treesize of output 53 [2018-11-12 20:28:32,133 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:32,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 60 [2018-11-12 20:28:32,201 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:32,204 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:32,204 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:32,206 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:32,207 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:32,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 85 [2018-11-12 20:28:32,228 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-11-12 20:28:32,252 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:32,289 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:32,298 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:32,334 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:32,343 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:32,465 INFO L303 Elim1Store]: Index analysis took 236 ms [2018-11-12 20:28:32,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 83 [2018-11-12 20:28:32,483 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-11-12 20:28:32,487 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:32,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 58 [2018-11-12 20:28:32,505 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-11-12 20:28:32,508 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:32,509 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:32,510 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:32,511 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:32,512 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:32,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 85 [2018-11-12 20:28:32,534 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-11-12 20:28:32,536 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:32,537 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:32,537 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:32,538 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:32,539 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:32,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 84 [2018-11-12 20:28:32,560 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-11-12 20:28:32,564 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:32,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 59 [2018-11-12 20:28:32,582 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-11-12 20:28:32,585 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:32,587 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:32,587 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:32,588 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:32,589 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:32,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 83 [2018-11-12 20:28:32,611 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 4 xjuncts. [2018-11-12 20:28:32,715 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-12 20:28:32,739 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-12 20:28:32,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-12 20:28:32,764 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:57 [2018-11-12 20:28:32,873 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 26 refuted. 0 times theorem prover too weak. 8 trivial. 4 not checked. [2018-11-12 20:28:32,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:28:32,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 16] total 34 [2018-11-12 20:28:32,893 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:28:32,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-12 20:28:32,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-12 20:28:32,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=854, Unknown=6, NotChecked=122, Total=1122 [2018-11-12 20:28:32,894 INFO L87 Difference]: Start difference. First operand 117 states and 133 transitions. Second operand 21 states. [2018-11-12 20:28:34,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:28:34,171 INFO L93 Difference]: Finished difference Result 299 states and 350 transitions. [2018-11-12 20:28:34,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-12 20:28:34,172 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 45 [2018-11-12 20:28:34,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:28:34,175 INFO L225 Difference]: With dead ends: 299 [2018-11-12 20:28:34,175 INFO L226 Difference]: Without dead ends: 243 [2018-11-12 20:28:34,176 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 66 SyntacticMatches, 11 SemanticMatches, 48 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 635 ImplicationChecksByTransitivity, 27.2s TimeCoverageRelationStatistics Valid=330, Invalid=1928, Unknown=6, NotChecked=186, Total=2450 [2018-11-12 20:28:34,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-11-12 20:28:34,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 150. [2018-11-12 20:28:34,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-11-12 20:28:34,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 175 transitions. [2018-11-12 20:28:34,196 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 175 transitions. Word has length 45 [2018-11-12 20:28:34,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:28:34,196 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 175 transitions. [2018-11-12 20:28:34,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-12 20:28:34,196 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 175 transitions. [2018-11-12 20:28:34,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-12 20:28:34,197 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:28:34,197 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:28:34,198 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:28:34,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:28:34,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1009376150, now seen corresponding path program 1 times [2018-11-12 20:28:34,198 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:28:34,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:28:34,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:28:34,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:28:34,199 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:28:34,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:28:34,611 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:28:34,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:28:34,611 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:28:34,611 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 47 with the following transitions: [2018-11-12 20:28:34,612 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [18], [20], [23], [29], [31], [34], [38], [42], [44], [48], [52], [57], [59], [61], [67], [70], [72], [75], [77], [78], [79], [80], [82], [83] [2018-11-12 20:28:34,613 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 20:28:34,613 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 20:28:34,618 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 20:28:34,756 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 20:28:34,756 INFO L272 AbstractInterpreter]: Visited 30 different actions 218 times. Merged at 18 different actions 121 times. Widened at 5 different actions 11 times. Performed 1010 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1010 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 16 fixpoints after 7 different actions. Largest state had 26 variables. [2018-11-12 20:28:34,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:28:34,792 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 20:28:34,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:28:34,792 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/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-11-12 20:28:34,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:28:34,812 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:28:34,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:28:34,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:28:35,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2018-11-12 20:28:35,065 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:28:35,065 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 31 treesize of output 47 [2018-11-12 20:28:35,066 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:28:35,072 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:28:35,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:28:35,081 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:40 [2018-11-12 20:28:35,234 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:28:35,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 45 [2018-11-12 20:28:35,239 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:28:35,240 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:35,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 49 [2018-11-12 20:28:35,241 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:28:35,250 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:28:35,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-12 20:28:35,261 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:30 [2018-11-12 20:28:35,939 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 32 treesize of output 24 [2018-11-12 20:28:35,941 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:28:35,942 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:35,943 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:28:35,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 31 [2018-11-12 20:28:35,945 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:28:35,951 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:28:35,956 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:28:35,957 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:5 [2018-11-12 20:28:36,010 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:28:36,011 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:28:36,520 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 79 treesize of output 69 [2018-11-12 20:28:36,522 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:36,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 70 [2018-11-12 20:28:36,593 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:36,594 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:36,594 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:36,596 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:36,597 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:36,598 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:36,609 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 90 [2018-11-12 20:28:36,611 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-12 20:28:36,613 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:36,614 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:36,614 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:36,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 57 [2018-11-12 20:28:36,617 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-12 20:28:36,620 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:36,620 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:36,621 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:36,621 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:36,621 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:36,622 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:36,622 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:36,627 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:36,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 88 [2018-11-12 20:28:36,630 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-12 20:28:36,637 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:36,637 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:36,638 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:36,638 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:36,638 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:36,639 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:36,639 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:36,645 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 85 [2018-11-12 20:28:36,646 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-12 20:28:36,648 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:36,649 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:36,649 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:36,650 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:36,650 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:36,651 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:36,652 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:36,657 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:36,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 88 [2018-11-12 20:28:36,660 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-12 20:28:36,662 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:36,663 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:36,663 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:36,664 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:36,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 55 [2018-11-12 20:28:36,665 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-12 20:28:36,667 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:36,668 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:36,668 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:36,669 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:36,669 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:36,670 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:36,670 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:36,674 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:36,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 89 [2018-11-12 20:28:36,676 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-12 20:28:36,709 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-12 20:28:36,718 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-12 20:28:36,731 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-12 20:28:36,732 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:87, output treesize:31 [2018-11-12 20:28:36,982 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:28:37,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:28:37,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21, 19] total 52 [2018-11-12 20:28:37,002 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:28:37,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-12 20:28:37,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-12 20:28:37,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=2407, Unknown=0, NotChecked=0, Total=2652 [2018-11-12 20:28:37,004 INFO L87 Difference]: Start difference. First operand 150 states and 175 transitions. Second operand 37 states. [2018-11-12 20:28:38,192 WARN L179 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 24 [2018-11-12 20:28:38,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:28:38,875 INFO L93 Difference]: Finished difference Result 219 states and 252 transitions. [2018-11-12 20:28:38,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-12 20:28:38,876 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 46 [2018-11-12 20:28:38,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:28:38,878 INFO L225 Difference]: With dead ends: 219 [2018-11-12 20:28:38,878 INFO L226 Difference]: Without dead ends: 217 [2018-11-12 20:28:38,880 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 57 SyntacticMatches, 6 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1391 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=455, Invalid=3967, Unknown=0, NotChecked=0, Total=4422 [2018-11-12 20:28:38,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-11-12 20:28:38,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 155. [2018-11-12 20:28:38,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-11-12 20:28:38,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 181 transitions. [2018-11-12 20:28:38,901 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 181 transitions. Word has length 46 [2018-11-12 20:28:38,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:28:38,901 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 181 transitions. [2018-11-12 20:28:38,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-12 20:28:38,901 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 181 transitions. [2018-11-12 20:28:38,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-12 20:28:38,902 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:28:38,902 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:28:38,902 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:28:38,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:28:38,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1700799956, now seen corresponding path program 2 times [2018-11-12 20:28:38,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:28:38,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:28:38,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:28:38,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:28:38,904 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:28:38,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:28:39,088 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-12 20:28:39,623 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 3 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:28:39,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:28:39,623 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:28:39,623 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:28:39,623 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:28:39,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:28:39,624 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:28:39,638 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:28:39,638 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:28:39,660 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-12 20:28:39,661 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:28:39,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:28:39,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-11-12 20:28:39,821 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:28:39,823 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 23 treesize of output 37 [2018-11-12 20:28:39,823 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:28:39,830 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:28:39,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-12 20:28:39,840 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2018-11-12 20:28:39,957 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 41 treesize of output 32 [2018-11-12 20:28:39,961 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:28:39,963 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:28:39,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 65 [2018-11-12 20:28:39,985 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-12 20:28:40,021 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:28:40,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:28:40,028 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:19 [2018-11-12 20:28:40,046 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 26 treesize of output 18 [2018-11-12 20:28:40,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-12 20:28:40,049 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:28:40,050 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:28:40,052 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:28:40,052 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-12 20:28:40,071 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 28 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-12 20:28:40,071 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:28:40,297 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 43 treesize of output 37 [2018-11-12 20:28:40,347 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:40,349 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:40,350 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:40,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 48 [2018-11-12 20:28:40,359 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-12 20:28:40,362 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:40,364 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:40,364 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:40,371 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 50 [2018-11-12 20:28:40,372 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-12 20:28:40,374 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:40,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-11-12 20:28:40,376 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-12 20:28:40,390 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:28:40,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:28:40,394 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:8 [2018-11-12 20:28:40,469 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 29 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-12 20:28:40,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:28:40,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 14] total 37 [2018-11-12 20:28:40,489 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:28:40,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-12 20:28:40,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-12 20:28:40,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1138, Unknown=0, NotChecked=0, Total=1332 [2018-11-12 20:28:40,490 INFO L87 Difference]: Start difference. First operand 155 states and 181 transitions. Second operand 26 states. [2018-11-12 20:28:42,655 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 35 [2018-11-12 20:28:43,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:28:43,301 INFO L93 Difference]: Finished difference Result 279 states and 326 transitions. [2018-11-12 20:28:43,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-12 20:28:43,303 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 45 [2018-11-12 20:28:43,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:28:43,305 INFO L225 Difference]: With dead ends: 279 [2018-11-12 20:28:43,306 INFO L226 Difference]: Without dead ends: 277 [2018-11-12 20:28:43,308 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 67 SyntacticMatches, 4 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1259 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=904, Invalid=4208, Unknown=0, NotChecked=0, Total=5112 [2018-11-12 20:28:43,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-11-12 20:28:43,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 159. [2018-11-12 20:28:43,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-11-12 20:28:43,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 186 transitions. [2018-11-12 20:28:43,332 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 186 transitions. Word has length 45 [2018-11-12 20:28:43,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:28:43,332 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 186 transitions. [2018-11-12 20:28:43,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-12 20:28:43,333 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 186 transitions. [2018-11-12 20:28:43,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-12 20:28:43,333 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:28:43,333 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:28:43,334 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:28:43,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:28:43,334 INFO L82 PathProgramCache]: Analyzing trace with hash -390828650, now seen corresponding path program 5 times [2018-11-12 20:28:43,334 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:28:43,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:28:43,335 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:28:43,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:28:43,335 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:28:43,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:28:44,205 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:28:44,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:28:44,205 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:28:44,206 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:28:44,206 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:28:44,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:28:44,206 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/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-11-12 20:28:44,214 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:28:44,214 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:28:44,240 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-12 20:28:44,241 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:28:44,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:28:44,261 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 38 treesize of output 31 [2018-11-12 20:28:44,266 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:44,268 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:28:44,268 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 31 treesize of output 71 [2018-11-12 20:28:44,269 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:28:44,276 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:28:44,287 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:28:44,287 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:52, output treesize:48 [2018-11-12 20:28:44,415 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:28:44,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 53 [2018-11-12 20:28:44,419 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:28:44,420 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:28:44,421 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:28:44,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 72 [2018-11-12 20:28:44,422 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:28:44,431 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:28:44,441 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:28:44,442 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:60, output treesize:32 [2018-11-12 20:28:44,549 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 33 treesize of output 26 [2018-11-12 20:28:44,552 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:28:44,553 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:28:44,554 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:28:44,555 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:28:44,558 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 26 treesize of output 73 [2018-11-12 20:28:44,559 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:28:44,571 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:28:44,579 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:28:44,580 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:35 [2018-11-12 20:28:45,198 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 34 treesize of output 27 [2018-11-12 20:28:45,200 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:28:45,201 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:28:45,202 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:28:45,203 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:28:45,206 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 27 treesize of output 76 [2018-11-12 20:28:45,207 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:28:45,218 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:28:45,227 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:28:45,228 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:21 [2018-11-12 20:28:45,244 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 28 treesize of output 20 [2018-11-12 20:28:45,246 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:28:45,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-12 20:28:45,247 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:28:45,248 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:28:45,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:28:45,250 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-11-12 20:28:45,292 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:28:45,292 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:28:49,460 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 17 [2018-11-12 20:28:51,558 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 20 [2018-11-12 20:29:10,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 79 [2018-11-12 20:29:10,373 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:29:10,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 80 [2018-11-12 20:29:10,375 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:29:10,376 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:29:10,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 67 [2018-11-12 20:29:10,447 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:29:10,450 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:29:10,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 57 [2018-11-12 20:29:10,462 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 3 xjuncts. [2018-11-12 20:29:10,464 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:29:10,464 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:29:10,465 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:29:10,465 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:29:10,466 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:29:10,467 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:29:10,473 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:29:10,480 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 83 [2018-11-12 20:29:10,481 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-12 20:29:10,482 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-12 20:29:10,482 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-12 20:29:10,484 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-12 20:29:10,484 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-12 20:29:10,486 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:29:10,487 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:29:10,488 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:29:10,488 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:29:10,490 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:29:10,491 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:29:10,497 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:29:10,503 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 83 [2018-11-12 20:29:10,504 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-11-12 20:29:10,507 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:29:10,507 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:29:10,508 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:29:10,508 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:29:10,510 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:29:10,510 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:29:10,517 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:29:10,523 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 83 [2018-11-12 20:29:10,525 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-11-12 20:29:10,527 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:29:10,527 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:29:10,528 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:29:10,528 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:29:10,529 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:29:10,530 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:29:10,536 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:29:10,558 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 83 [2018-11-12 20:29:10,559 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-11-12 20:29:10,596 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-12 20:29:10,607 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-12 20:29:10,615 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-12 20:29:10,629 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-12 20:29:10,630 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:100, output treesize:22 [2018-11-12 20:29:16,119 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-12 20:29:16,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:29:16,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 24] total 50 [2018-11-12 20:29:16,140 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:29:16,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-12 20:29:16,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-12 20:29:16,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=339, Invalid=2101, Unknown=10, NotChecked=0, Total=2450 [2018-11-12 20:29:16,141 INFO L87 Difference]: Start difference. First operand 159 states and 186 transitions. Second operand 29 states. [2018-11-12 20:29:17,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:29:17,431 INFO L93 Difference]: Finished difference Result 305 states and 359 transitions. [2018-11-12 20:29:17,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-12 20:29:17,432 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 45 [2018-11-12 20:29:17,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:29:17,436 INFO L225 Difference]: With dead ends: 305 [2018-11-12 20:29:17,436 INFO L226 Difference]: Without dead ends: 241 [2018-11-12 20:29:17,438 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 54 SyntacticMatches, 10 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1411 ImplicationChecksByTransitivity, 32.7s TimeCoverageRelationStatistics Valid=718, Invalid=3432, Unknown=10, NotChecked=0, Total=4160 [2018-11-12 20:29:17,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-11-12 20:29:17,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 174. [2018-11-12 20:29:17,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-11-12 20:29:17,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 205 transitions. [2018-11-12 20:29:17,494 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 205 transitions. Word has length 45 [2018-11-12 20:29:17,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:29:17,495 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 205 transitions. [2018-11-12 20:29:17,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-12 20:29:17,495 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 205 transitions. [2018-11-12 20:29:17,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-12 20:29:17,496 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:29:17,496 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:29:17,496 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:29:17,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:29:17,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1905129809, now seen corresponding path program 3 times [2018-11-12 20:29:17,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:29:17,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:29:17,498 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:29:17,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:29:17,498 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:29:17,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:29:17,690 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-12 20:29:17,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:29:17,690 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:29:17,690 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:29:17,691 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:29:17,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:29:17,691 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:29:17,699 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:29:17,699 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:29:17,721 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:29:17,721 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:29:17,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:29:17,773 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-12 20:29:17,773 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:29:17,919 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-12 20:29:17,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:29:17,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-11-12 20:29:17,941 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:29:17,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-12 20:29:17,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-12 20:29:17,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2018-11-12 20:29:17,942 INFO L87 Difference]: Start difference. First operand 174 states and 205 transitions. Second operand 11 states. [2018-11-12 20:29:18,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:29:18,144 INFO L93 Difference]: Finished difference Result 264 states and 310 transitions. [2018-11-12 20:29:18,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-12 20:29:18,144 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 49 [2018-11-12 20:29:18,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:29:18,145 INFO L225 Difference]: With dead ends: 264 [2018-11-12 20:29:18,146 INFO L226 Difference]: Without dead ends: 236 [2018-11-12 20:29:18,146 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 88 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2018-11-12 20:29:18,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-11-12 20:29:18,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 183. [2018-11-12 20:29:18,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-11-12 20:29:18,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 213 transitions. [2018-11-12 20:29:18,173 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 213 transitions. Word has length 49 [2018-11-12 20:29:18,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:29:18,173 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 213 transitions. [2018-11-12 20:29:18,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-12 20:29:18,173 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 213 transitions. [2018-11-12 20:29:18,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-12 20:29:18,175 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:29:18,175 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:29:18,176 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:29:18,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:29:18,176 INFO L82 PathProgramCache]: Analyzing trace with hash -139141365, now seen corresponding path program 4 times [2018-11-12 20:29:18,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:29:18,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:29:18,177 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:29:18,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:29:18,177 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:29:18,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:29:18,486 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 14 [2018-11-12 20:29:18,839 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 1 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:29:18,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:29:18,839 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:29:18,840 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:29:18,840 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:29:18,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:29:18,840 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/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-11-12 20:29:18,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:29:18,849 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:29:18,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:29:18,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:29:19,065 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 28 treesize of output 23 [2018-11-12 20:29:19,104 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:29:19,125 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 23 treesize of output 37 [2018-11-12 20:29:19,126 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:29:19,138 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:29:19,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:29:19,145 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-11-12 20:29:19,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-11-12 20:29:19,236 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:29:19,238 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:29:19,239 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:29:19,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2018-11-12 20:29:19,245 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:29:19,252 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:29:19,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:29:19,261 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2018-11-12 20:29:19,552 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 26 treesize of output 18 [2018-11-12 20:29:19,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-12 20:29:19,556 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:29:19,558 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:29:19,592 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:29:19,592 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-12 20:29:19,673 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:29:19,673 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:30:02,357 WARN L179 SmtUtils]: Spent 1.84 s on a formula simplification that was a NOOP. DAG size: 30 [2018-11-12 20:30:02,361 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 63 treesize of output 57 [2018-11-12 20:30:02,364 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:02,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 64 [2018-11-12 20:30:02,433 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:02,434 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:02,435 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:02,436 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:02,440 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:02,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 98 [2018-11-12 20:30:02,457 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-11-12 20:30:02,460 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:02,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 63 [2018-11-12 20:30:02,476 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-11-12 20:30:02,479 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:02,480 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:02,480 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:02,483 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:02,487 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:02,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 99 [2018-11-12 20:30:02,506 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-11-12 20:30:02,508 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:02,509 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:02,510 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:02,511 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:02,514 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:02,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 97 [2018-11-12 20:30:02,532 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-11-12 20:30:02,534 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:02,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 58 [2018-11-12 20:30:02,557 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-11-12 20:30:02,559 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:02,561 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:02,561 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:02,563 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:02,568 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:02,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 97 [2018-11-12 20:30:02,590 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-11-12 20:30:02,592 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:02,593 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:02,593 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:02,595 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:02,597 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:02,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 95 [2018-11-12 20:30:02,617 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 4 xjuncts. [2018-11-12 20:30:02,710 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-12 20:30:02,731 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-12 20:30:02,757 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-12 20:30:02,758 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:66, output treesize:43 [2018-11-12 20:30:02,804 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 28 refuted. 5 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:30:02,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:30:02,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 16] total 41 [2018-11-12 20:30:02,824 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:30:02,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-12 20:30:02,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-12 20:30:02,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1465, Unknown=15, NotChecked=0, Total=1640 [2018-11-12 20:30:02,826 INFO L87 Difference]: Start difference. First operand 183 states and 213 transitions. Second operand 34 states. [2018-11-12 20:30:16,356 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2018-11-12 20:30:16,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:30:16,483 INFO L93 Difference]: Finished difference Result 321 states and 375 transitions. [2018-11-12 20:30:16,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-12 20:30:16,483 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 48 [2018-11-12 20:30:16,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:30:16,485 INFO L225 Difference]: With dead ends: 321 [2018-11-12 20:30:16,485 INFO L226 Difference]: Without dead ends: 257 [2018-11-12 20:30:16,487 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 70 SyntacticMatches, 8 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 915 ImplicationChecksByTransitivity, 44.5s TimeCoverageRelationStatistics Valid=371, Invalid=2806, Unknown=15, NotChecked=0, Total=3192 [2018-11-12 20:30:16,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-11-12 20:30:16,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 218. [2018-11-12 20:30:16,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-11-12 20:30:16,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 252 transitions. [2018-11-12 20:30:16,518 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 252 transitions. Word has length 48 [2018-11-12 20:30:16,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:30:16,519 INFO L480 AbstractCegarLoop]: Abstraction has 218 states and 252 transitions. [2018-11-12 20:30:16,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-12 20:30:16,519 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 252 transitions. [2018-11-12 20:30:16,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-12 20:30:16,520 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:30:16,520 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:30:16,520 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:30:16,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:30:16,521 INFO L82 PathProgramCache]: Analyzing trace with hash 916985770, now seen corresponding path program 1 times [2018-11-12 20:30:16,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:30:16,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:16,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:30:16,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:16,522 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:30:16,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:30:16,857 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 36 proven. 4 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-12 20:30:16,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:16,858 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:30:16,858 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 52 with the following transitions: [2018-11-12 20:30:16,858 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [18], [20], [23], [25], [29], [31], [34], [36], [38], [42], [44], [48], [52], [57], [67], [70], [72], [78], [79], [80], [82] [2018-11-12 20:30:16,860 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 20:30:16,861 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 20:30:16,868 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 20:30:16,975 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 20:30:16,976 INFO L272 AbstractInterpreter]: Visited 27 different actions 156 times. Merged at 17 different actions 89 times. Widened at 4 different actions 7 times. Performed 801 root evaluator evaluations with a maximum evaluation depth of 3. Performed 801 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 20 fixpoints after 9 different actions. Largest state had 25 variables. [2018-11-12 20:30:17,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:30:17,010 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 20:30:17,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:17,010 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:30:17,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:30:17,028 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:30:17,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:30:17,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:30:17,069 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 36 proven. 4 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-12 20:30:17,069 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:30:17,240 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 36 proven. 4 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-12 20:30:17,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:30:17,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2018-11-12 20:30:17,275 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:30:17,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-12 20:30:17,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-12 20:30:17,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-12 20:30:17,277 INFO L87 Difference]: Start difference. First operand 218 states and 252 transitions. Second operand 6 states. [2018-11-12 20:30:17,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:30:17,546 INFO L93 Difference]: Finished difference Result 315 states and 367 transitions. [2018-11-12 20:30:17,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 20:30:17,547 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2018-11-12 20:30:17,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:30:17,548 INFO L225 Difference]: With dead ends: 315 [2018-11-12 20:30:17,548 INFO L226 Difference]: Without dead ends: 251 [2018-11-12 20:30:17,549 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 101 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-12 20:30:17,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-11-12 20:30:17,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 207. [2018-11-12 20:30:17,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-11-12 20:30:17,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 236 transitions. [2018-11-12 20:30:17,593 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 236 transitions. Word has length 51 [2018-11-12 20:30:17,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:30:17,593 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 236 transitions. [2018-11-12 20:30:17,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-12 20:30:17,593 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 236 transitions. [2018-11-12 20:30:17,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-12 20:30:17,594 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:30:17,595 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:30:17,595 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:30:17,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:30:17,595 INFO L82 PathProgramCache]: Analyzing trace with hash -740834584, now seen corresponding path program 1 times [2018-11-12 20:30:17,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:30:17,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:17,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:30:17,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:17,596 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:30:17,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:30:18,006 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2018-11-12 20:30:18,499 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:30:18,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:18,500 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:30:18,500 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 52 with the following transitions: [2018-11-12 20:30:18,500 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [18], [20], [23], [29], [31], [34], [36], [38], [42], [44], [48], [52], [57], [67], [70], [72], [78], [79], [80], [82] [2018-11-12 20:30:18,501 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 20:30:18,501 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 20:30:18,506 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 20:30:18,591 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 20:30:18,592 INFO L272 AbstractInterpreter]: Visited 26 different actions 142 times. Merged at 16 different actions 84 times. Widened at 4 different actions 5 times. Performed 749 root evaluator evaluations with a maximum evaluation depth of 3. Performed 749 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 12 fixpoints after 5 different actions. Largest state had 25 variables. [2018-11-12 20:30:18,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:30:18,631 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 20:30:18,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:18,631 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:30:18,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:30:18,649 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:30:18,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:30:18,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:30:18,960 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 29 treesize of output 24 [2018-11-12 20:30:18,963 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:30:18,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 39 [2018-11-12 20:30:18,966 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:18,973 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:30:18,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:30:18,980 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2018-11-12 20:30:19,080 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 27 treesize of output 20 [2018-11-12 20:30:19,082 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:30:19,083 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:30:19,084 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:30:19,088 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 20 treesize of output 43 [2018-11-12 20:30:19,088 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:19,096 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:30:19,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:30:19,104 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:17 [2018-11-12 20:30:19,132 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 26 treesize of output 18 [2018-11-12 20:30:19,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-12 20:30:19,136 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:19,137 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:30:19,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:30:19,138 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-12 20:30:19,161 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:30:19,162 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:30:31,448 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 17 [2018-11-12 20:30:39,958 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 57 treesize of output 51 [2018-11-12 20:30:39,960 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:39,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 58 [2018-11-12 20:30:40,029 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:40,031 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:40,031 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:40,032 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:40,033 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:40,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 83 [2018-11-12 20:30:40,054 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-11-12 20:30:40,056 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:40,058 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:40,059 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:40,061 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:40,061 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:40,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 83 [2018-11-12 20:30:40,083 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-11-12 20:30:40,092 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-12 20:30:40,092 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:40,093 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-12 20:30:40,094 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:40,095 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-12 20:30:40,095 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:40,097 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:40,098 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:40,099 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:40,101 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:40,101 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:40,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 83 [2018-11-12 20:30:40,122 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-11-12 20:30:40,124 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:40,125 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:40,125 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:40,127 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:40,127 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:40,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 83 [2018-11-12 20:30:40,146 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 4 xjuncts. [2018-11-12 20:30:40,188 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:30:40,190 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:30:40,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:30:40,198 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:65, output treesize:16 [2018-11-12 20:30:40,385 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 11 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:30:40,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:30:40,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 19] total 42 [2018-11-12 20:30:40,411 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:30:40,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-12 20:30:40,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-12 20:30:40,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=1454, Unknown=6, NotChecked=0, Total=1722 [2018-11-12 20:30:40,413 INFO L87 Difference]: Start difference. First operand 207 states and 236 transitions. Second operand 26 states. [2018-11-12 20:30:41,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:30:41,958 INFO L93 Difference]: Finished difference Result 328 states and 377 transitions. [2018-11-12 20:30:41,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-12 20:30:41,959 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 51 [2018-11-12 20:30:41,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:30:41,961 INFO L225 Difference]: With dead ends: 328 [2018-11-12 20:30:41,961 INFO L226 Difference]: Without dead ends: 275 [2018-11-12 20:30:41,963 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 72 SyntacticMatches, 8 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 920 ImplicationChecksByTransitivity, 22.7s TimeCoverageRelationStatistics Valid=526, Invalid=2774, Unknown=6, NotChecked=0, Total=3306 [2018-11-12 20:30:41,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-11-12 20:30:42,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 226. [2018-11-12 20:30:42,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-11-12 20:30:42,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 259 transitions. [2018-11-12 20:30:42,008 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 259 transitions. Word has length 51 [2018-11-12 20:30:42,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:30:42,009 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 259 transitions. [2018-11-12 20:30:42,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-12 20:30:42,009 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 259 transitions. [2018-11-12 20:30:42,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-12 20:30:42,010 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:30:42,010 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:30:42,010 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:30:42,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:30:42,011 INFO L82 PathProgramCache]: Analyzing trace with hash 2124575766, now seen corresponding path program 1 times [2018-11-12 20:30:42,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:30:42,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:42,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:30:42,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:42,012 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:30:42,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:30:42,509 WARN L179 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 11 [2018-11-12 20:30:43,463 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 7 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:30:43,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:43,463 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:30:43,463 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 53 with the following transitions: [2018-11-12 20:30:43,463 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [18], [20], [23], [25], [29], [31], [34], [38], [42], [44], [48], [52], [57], [59], [61], [67], [70], [72], [75], [77], [78], [79], [80], [82], [83] [2018-11-12 20:30:43,465 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 20:30:43,465 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 20:30:43,469 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 20:30:43,604 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 20:30:43,604 INFO L272 AbstractInterpreter]: Visited 31 different actions 244 times. Merged at 19 different actions 130 times. Widened at 5 different actions 11 times. Performed 1098 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1098 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 26 fixpoints after 9 different actions. Largest state had 26 variables. [2018-11-12 20:30:43,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:30:43,633 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 20:30:43,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:43,633 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:30:43,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:30:43,646 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:30:43,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:30:43,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:30:43,809 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 28 treesize of output 23 [2018-11-12 20:30:43,812 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:30:43,813 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 23 treesize of output 37 [2018-11-12 20:30:43,813 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:43,819 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:30:43,829 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:30:43,829 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2018-11-12 20:30:43,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 31 [2018-11-12 20:30:43,880 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:43,881 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:30:43,882 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:30:43,883 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:30:43,887 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 77 [2018-11-12 20:30:43,887 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:43,897 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:30:43,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:30:43,907 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:45 [2018-11-12 20:30:44,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 47 [2018-11-12 20:30:44,122 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:30:44,123 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:30:44,124 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:30:44,125 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:30:44,127 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:30:44,128 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:30:44,129 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:44,129 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:44,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 131 [2018-11-12 20:30:44,140 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:44,160 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:30:44,176 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-11-12 20:30:44,176 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:80, output treesize:54 [2018-11-12 20:30:44,394 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 56 treesize of output 45 [2018-11-12 20:30:44,417 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:30:44,418 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:30:44,419 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:30:44,420 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:30:44,422 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:30:44,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 125 [2018-11-12 20:30:44,441 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-12 20:30:44,489 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-12 20:30:44,522 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-12 20:30:44,523 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:73, output treesize:85 [2018-11-12 20:30:44,741 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 26 treesize of output 18 [2018-11-12 20:30:44,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-12 20:30:44,744 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:44,746 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:30:44,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:30:44,747 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-12 20:30:44,813 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:30:44,814 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:30:52,003 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 189 treesize of output 171 [2018-11-12 20:30:52,033 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:52,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 116 [2018-11-12 20:30:52,067 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:52,068 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:52,068 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:52,069 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:52,069 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:52,070 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:52,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 174 [2018-11-12 20:30:52,208 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2018-11-12 20:30:52,211 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-12 20:30:52,211 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:52,214 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:52,214 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:52,215 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:52,215 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:52,215 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:52,217 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:52,218 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:52,218 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:52,219 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:52,220 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:52,223 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:52,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 141 [2018-11-12 20:30:52,238 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-12 20:30:52,242 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:52,246 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:52,246 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:52,247 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:52,247 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:52,248 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:52,248 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:52,248 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:52,249 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:52,250 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:52,252 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:52,253 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:52,253 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:52,254 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:52,257 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:52,263 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:52,268 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:52,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 193 [2018-11-12 20:30:52,285 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-12 20:30:52,367 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:30:52,370 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:52,371 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:52,371 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:52,372 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:52,373 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:52,373 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:52,385 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 154 [2018-11-12 20:30:52,484 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:52,484 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:52,485 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:52,485 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:52,486 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:52,489 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:52,490 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:52,491 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:52,495 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:52,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 138 [2018-11-12 20:30:52,518 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-11-12 20:30:52,527 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-12 20:30:52,527 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:52,531 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:52,531 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:52,531 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:52,532 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:52,532 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:52,533 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:52,533 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:52,534 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:52,534 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:52,545 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:52,547 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:52,548 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:52,548 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:52,548 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:52,551 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:52,563 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:52,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 185 [2018-11-12 20:30:52,581 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-11-12 20:30:52,648 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:30:52,651 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-12 20:30:52,651 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:52,661 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:30:52,668 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:52,693 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 244 treesize of output 203 [2018-11-12 20:30:52,796 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-12 20:30:52,796 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:52,799 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:52,805 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:52,810 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:52,810 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:52,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 261 treesize of output 316 [2018-11-12 20:30:53,779 WARN L179 SmtUtils]: Spent 860.00 ms on a formula simplification. DAG size of input: 284 DAG size of output: 143 [2018-11-12 20:30:53,779 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-12 20:30:53,780 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-12 20:30:53,781 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-12 20:30:53,784 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-12 20:30:53,784 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:53,787 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:53,793 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:53,794 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:53,795 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:53,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 157 treesize of output 189 [2018-11-12 20:30:53,821 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 3 xjuncts. [2018-11-12 20:30:53,825 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:53,825 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:53,826 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:53,829 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:53,836 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:53,836 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:53,839 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:53,843 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:53,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 177 treesize of output 245 [2018-11-12 20:30:53,876 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 6 xjuncts. [2018-11-12 20:30:54,248 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:54,249 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:54,250 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:54,250 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:54,251 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:54,251 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:54,252 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:54,253 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:54,256 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:54,258 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:54,263 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:54,264 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:54,274 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:54,280 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:54,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 97 treesize of output 219 [2018-11-12 20:30:54,318 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 10 xjuncts. [2018-11-12 20:30:54,333 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:54,334 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:54,336 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:54,339 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:54,340 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:54,343 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:54,344 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:54,344 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:54,348 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:54,349 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:54,358 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:54,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 93 treesize of output 203 [2018-11-12 20:30:54,403 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 8 xjuncts. [2018-11-12 20:30:54,533 INFO L267 ElimStorePlain]: Start of recursive call 15: 6 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:30:54,538 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:54,541 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:54,546 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:54,547 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:54,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 156 treesize of output 255 [2018-11-12 20:30:55,087 WARN L179 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 211 DAG size of output: 131 [2018-11-12 20:30:55,091 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:55,093 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:55,093 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:55,095 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:55,096 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:55,099 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:55,105 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:55,110 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:55,110 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:55,116 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:55,119 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:55,140 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:55,215 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 12 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 153 treesize of output 388 [2018-11-12 20:30:55,215 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2018-11-12 20:30:55,833 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 270 xjuncts. [2018-11-12 20:30:55,847 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-12 20:30:55,847 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:55,867 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:55,876 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:55,884 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:55,890 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:55,898 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:55,914 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:55,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 128 treesize of output 302 [2018-11-12 20:30:55,985 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-12 20:30:56,036 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 116 xjuncts. [2018-11-12 20:31:02,380 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:02,382 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:02,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 86 [2018-11-12 20:31:02,391 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 2 xjuncts. [2018-11-12 20:31:02,394 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:02,394 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:02,395 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:02,395 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:02,397 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:02,398 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:02,400 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:02,410 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 120 [2018-11-12 20:31:02,411 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 2 xjuncts. [2018-11-12 20:31:02,415 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:02,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 42 [2018-11-12 20:31:02,416 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-12 20:31:02,421 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:02,422 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:02,422 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:02,423 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:02,424 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:02,426 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:02,427 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:02,428 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:02,429 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:02,437 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 126 [2018-11-12 20:31:02,438 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 2 xjuncts. [2018-11-12 20:31:02,441 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:02,442 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:02,463 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:02,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 119 [2018-11-12 20:31:02,472 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 2 xjuncts. [2018-11-12 20:31:02,475 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:02,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 80 [2018-11-12 20:31:02,477 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-11-12 20:31:02,482 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:02,483 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:02,483 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:02,484 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:02,484 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 68 treesize of output 77 [2018-11-12 20:31:02,485 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-12 20:31:02,487 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:02,487 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:02,488 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:02,489 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:02,489 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:02,492 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 107 [2018-11-12 20:31:02,492 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-11-12 20:31:02,624 INFO L267 ElimStorePlain]: Start of recursive call 21: 6 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-12 20:31:02,686 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-12 20:31:02,691 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:02,691 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:02,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 148 treesize of output 151 [2018-11-12 20:31:02,734 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-12 20:31:02,734 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-11-12 20:31:02,767 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:02,789 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:02,789 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:02,792 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:02,792 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:02,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 99 treesize of output 180 [2018-11-12 20:31:03,111 WARN L179 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 87 [2018-11-12 20:31:03,117 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:03,117 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:03,117 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:03,118 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:03,120 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:03,120 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:03,121 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:03,122 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:03,129 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:03,130 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:03,132 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:03,133 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:03,140 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:03,144 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:03,162 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:03,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 96 treesize of output 313 [2018-11-12 20:31:03,224 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-11-12 20:31:03,364 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 131 xjuncts. [2018-11-12 20:31:03,392 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:03,400 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:03,406 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:03,408 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:03,410 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:03,421 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:03,438 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:03,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 84 treesize of output 257 [2018-11-12 20:31:03,504 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-12 20:31:03,711 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 187 xjuncts. [2018-11-12 20:31:03,718 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-12 20:31:03,718 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-11-12 20:31:07,261 INFO L267 ElimStorePlain]: Start of recursive call 35: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:31:07,268 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:07,278 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:07,281 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:07,289 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:07,289 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:07,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 159 treesize of output 212 [2018-11-12 20:31:08,012 WARN L179 SmtUtils]: Spent 653.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 92 [2018-11-12 20:31:08,015 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:08,015 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:08,016 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:08,017 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:31:08,018 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:08,018 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:08,019 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:08,019 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:08,023 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:08,026 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 134 [2018-11-12 20:31:08,027 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-11-12 20:31:08,032 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:08,032 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:08,032 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:08,033 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:08,033 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:08,034 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:08,035 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:08,035 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:08,037 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:31:08,038 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:08,038 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:08,039 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:08,044 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:08,049 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:08,053 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:08,055 INFO L477 Elim1Store]: Elim1 did not use 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 5 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 180 [2018-11-12 20:31:08,057 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-11-12 20:31:08,059 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-12 20:31:08,059 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-11-12 20:31:08,247 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:08,256 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:08,269 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:08,278 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:08,293 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:08,302 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:08,306 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:08,306 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:08,311 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:08,311 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:08,312 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:08,320 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:08,325 INFO L303 Elim1Store]: Index analysis took 116 ms [2018-11-12 20:31:08,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 146 [2018-11-12 20:31:08,327 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-11-12 20:31:08,388 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:08,389 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:08,389 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:08,391 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:08,392 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:08,393 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:08,396 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:08,404 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:08,405 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:08,415 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:31:08,467 INFO L477 Elim1Store]: Elim1 did not use 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 5 new quantified variables, introduced 7 case distinctions, treesize of input 74 treesize of output 230 [2018-11-12 20:31:08,467 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-11-12 20:31:08,502 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 38 xjuncts. [2018-11-12 20:31:08,656 INFO L267 ElimStorePlain]: Start of recursive call 39: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:31:08,666 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:31:08,685 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-12 20:31:08,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-12 20:31:08,707 INFO L202 ElimStorePlain]: Needed 44 recursive calls to eliminate 4 variables, input treesize:202, output treesize:32 [2018-11-12 20:31:08,932 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:31:08,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:31:08,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26, 22] total 58 [2018-11-12 20:31:08,953 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:31:08,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-12 20:31:08,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-12 20:31:08,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=348, Invalid=2955, Unknown=3, NotChecked=0, Total=3306 [2018-11-12 20:31:08,954 INFO L87 Difference]: Start difference. First operand 226 states and 259 transitions. Second operand 41 states. Received shutdown request... [2018-11-12 20:31:17,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-12 20:31:17,236 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-12 20:31:17,241 WARN L205 ceAbstractionStarter]: Timeout [2018-11-12 20:31:17,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 08:31:17 BoogieIcfgContainer [2018-11-12 20:31:17,241 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-12 20:31:17,242 INFO L168 Benchmark]: Toolchain (without parser) took 265094.91 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 850.9 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -502.5 MB). Peak memory consumption was 348.4 MB. Max. memory is 7.1 GB. [2018-11-12 20:31:17,243 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 20:31:17,243 INFO L168 Benchmark]: CACSL2BoogieTranslator took 293.49 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-12 20:31:17,243 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.72 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 20:31:17,243 INFO L168 Benchmark]: Boogie Preprocessor took 51.77 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 20:31:17,243 INFO L168 Benchmark]: RCFGBuilder took 581.41 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 731.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -766.5 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. [2018-11-12 20:31:17,244 INFO L168 Benchmark]: TraceAbstraction took 264132.69 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 119.5 MB). Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 253.4 MB). Peak memory consumption was 372.9 MB. Max. memory is 7.1 GB. [2018-11-12 20:31:17,245 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 293.49 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 30.72 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 51.77 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 581.41 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 731.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -766.5 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 264132.69 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 119.5 MB). Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 253.4 MB). Peak memory consumption was 372.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was constructing difference of abstraction (226states) and FLOYD_HOARE automaton (currently 22 states, 41 states before enhancement),while ReachableStatesComputation was computing reachable states (52 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 33 locations, 1 error locations. TIMEOUT Result, 264.0s OverallTime, 20 OverallIterations, 5 TraceHistogramMax, 52.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 743 SDtfs, 2033 SDslu, 6246 SDs, 0 SdLazy, 8108 SolverSat, 1250 SolverUnsat, 20 SolverUnknown, 0 SolverNotchecked, 38.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2035 GetRequests, 1092 SyntacticMatches, 115 SemanticMatches, 828 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 13617 ImplicationChecksByTransitivity, 192.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=226occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.9s AbstIntTime, 9 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 19 MinimizatonAttempts, 974 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 207.2s InterpolantComputationTime, 1511 NumberOfCodeBlocks, 1503 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 2196 ConstructedInterpolants, 203 QuantifiedInterpolants, 1344466 SizeOfPredicates, 256 NumberOfNonLiveVariables, 1912 ConjunctsInSsa, 441 ConjunctsInUnsatCore, 56 InterpolantComputations, 2 PerfectInterpolantSequences, 450/1542 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown