java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call2_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 12:33:28,554 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 12:33:28,556 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 12:33:28,568 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 12:33:28,568 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 12:33:28,569 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 12:33:28,571 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 12:33:28,573 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 12:33:28,575 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 12:33:28,576 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 12:33:28,577 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 12:33:28,577 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 12:33:28,579 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 12:33:28,580 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 12:33:28,581 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 12:33:28,582 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 12:33:28,583 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 12:33:28,585 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 12:33:28,587 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 12:33:28,589 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 12:33:28,591 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 12:33:28,592 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 12:33:28,595 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 12:33:28,595 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 12:33:28,595 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 12:33:28,596 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 12:33:28,597 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 12:33:28,598 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 12:33:28,599 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 12:33:28,600 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 12:33:28,601 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 12:33:28,601 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 12:33:28,602 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 12:33:28,602 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 12:33:28,603 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 12:33:28,604 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 12:33:28,604 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-10-24 12:33:28,621 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 12:33:28,621 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 12:33:28,622 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 12:33:28,622 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-24 12:33:28,623 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-24 12:33:28,623 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-24 12:33:28,623 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-24 12:33:28,624 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-24 12:33:28,624 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-24 12:33:28,624 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-24 12:33:28,624 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-24 12:33:28,625 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-24 12:33:28,625 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-24 12:33:28,625 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-24 12:33:28,626 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 12:33:28,626 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 12:33:28,626 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 12:33:28,627 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 12:33:28,627 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 12:33:28,627 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 12:33:28,627 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 12:33:28,627 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 12:33:28,628 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 12:33:28,628 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 12:33:28,628 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 12:33:28,628 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 12:33:28,628 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 12:33:28,629 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 12:33:28,629 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 12:33:28,629 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 12:33:28,629 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-24 12:33:28,629 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 12:33:28,630 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 12:33:28,630 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 12:33:28,630 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 12:33:28,630 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-24 12:33:28,694 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 12:33:28,711 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 12:33:28,716 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 12:33:28,717 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 12:33:28,718 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 12:33:28,718 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call2_true-termination.i [2018-10-24 12:33:28,782 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/08bce88b8/59e851c08f64453b819ee932195b442b/FLAGb9f426980 [2018-10-24 12:33:29,258 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 12:33:29,258 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call2_true-termination.i [2018-10-24 12:33:29,264 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/08bce88b8/59e851c08f64453b819ee932195b442b/FLAGb9f426980 [2018-10-24 12:33:29,279 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/08bce88b8/59e851c08f64453b819ee932195b442b [2018-10-24 12:33:29,292 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 12:33:29,293 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 12:33:29,295 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 12:33:29,295 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 12:33:29,299 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 12:33:29,300 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:33:29" (1/1) ... [2018-10-24 12:33:29,303 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e21aa8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:33:29, skipping insertion in model container [2018-10-24 12:33:29,303 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:33:29" (1/1) ... [2018-10-24 12:33:29,313 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 12:33:29,334 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 12:33:29,506 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 12:33:29,510 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 12:33:29,537 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 12:33:29,565 INFO L193 MainTranslator]: Completed translation [2018-10-24 12:33:29,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:33:29 WrapperNode [2018-10-24 12:33:29,566 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 12:33:29,567 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 12:33:29,567 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 12:33:29,567 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 12:33:29,577 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:33:29" (1/1) ... [2018-10-24 12:33:29,590 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:33:29" (1/1) ... [2018-10-24 12:33:29,612 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 12:33:29,612 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 12:33:29,613 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 12:33:29,613 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 12:33:29,623 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:33:29" (1/1) ... [2018-10-24 12:33:29,624 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:33:29" (1/1) ... [2018-10-24 12:33:29,625 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:33:29" (1/1) ... [2018-10-24 12:33:29,626 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:33:29" (1/1) ... [2018-10-24 12:33:29,630 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:33:29" (1/1) ... [2018-10-24 12:33:29,635 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:33:29" (1/1) ... [2018-10-24 12:33:29,637 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:33:29" (1/1) ... [2018-10-24 12:33:29,640 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 12:33:29,641 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 12:33:29,641 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 12:33:29,641 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 12:33:29,644 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:33:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 12:33:29,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-24 12:33:29,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-24 12:33:29,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 12:33:29,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 12:33:29,826 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-24 12:33:29,826 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-24 12:33:29,826 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-24 12:33:29,827 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-24 12:33:30,190 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 12:33:30,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:33:30 BoogieIcfgContainer [2018-10-24 12:33:30,190 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 12:33:30,191 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 12:33:30,191 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 12:33:30,195 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 12:33:30,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:33:29" (1/3) ... [2018-10-24 12:33:30,196 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ee8aad9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:33:30, skipping insertion in model container [2018-10-24 12:33:30,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:33:29" (2/3) ... [2018-10-24 12:33:30,196 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ee8aad9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:33:30, skipping insertion in model container [2018-10-24 12:33:30,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:33:30" (3/3) ... [2018-10-24 12:33:30,198 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_true-unreach-call2_true-termination.i [2018-10-24 12:33:30,207 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 12:33:30,215 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 12:33:30,232 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 12:33:30,269 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 12:33:30,269 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 12:33:30,269 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 12:33:30,269 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 12:33:30,269 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 12:33:30,270 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 12:33:30,270 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 12:33:30,270 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 12:33:30,289 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2018-10-24 12:33:30,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-24 12:33:30,295 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:33:30,296 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:33:30,299 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:33:30,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:33:30,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1193744236, now seen corresponding path program 1 times [2018-10-24 12:33:30,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:33:30,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:33:30,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:33:30,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:33:30,356 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:33:30,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:33:30,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:33:30,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 12:33:30,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 12:33:30,440 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:33:30,445 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-24 12:33:30,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-24 12:33:30,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-24 12:33:30,464 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 2 states. [2018-10-24 12:33:30,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:33:30,489 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2018-10-24 12:33:30,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-24 12:33:30,490 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-10-24 12:33:30,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:33:30,498 INFO L225 Difference]: With dead ends: 43 [2018-10-24 12:33:30,498 INFO L226 Difference]: Without dead ends: 21 [2018-10-24 12:33:30,502 INFO L605 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-10-24 12:33:30,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-24 12:33:30,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-10-24 12:33:30,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-24 12:33:30,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-10-24 12:33:30,535 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 14 [2018-10-24 12:33:30,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:33:30,535 INFO L481 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-10-24 12:33:30,536 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-24 12:33:30,536 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-10-24 12:33:30,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-24 12:33:30,537 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:33:30,537 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:33:30,537 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:33:30,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:33:30,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1255135895, now seen corresponding path program 1 times [2018-10-24 12:33:30,538 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:33:30,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:33:30,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:33:30,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:33:30,540 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:33:30,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:33:30,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:33:30,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 12:33:30,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 12:33:30,663 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:33:30,664 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 12:33:30,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 12:33:30,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 12:33:30,665 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 3 states. [2018-10-24 12:33:30,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:33:30,741 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2018-10-24 12:33:30,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 12:33:30,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-24 12:33:30,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:33:30,744 INFO L225 Difference]: With dead ends: 41 [2018-10-24 12:33:30,744 INFO L226 Difference]: Without dead ends: 29 [2018-10-24 12:33:30,745 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 12:33:30,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-24 12:33:30,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2018-10-24 12:33:30,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-24 12:33:30,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-10-24 12:33:30,756 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 15 [2018-10-24 12:33:30,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:33:30,756 INFO L481 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-10-24 12:33:30,756 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 12:33:30,756 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-10-24 12:33:30,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-24 12:33:30,757 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:33:30,757 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:33:30,758 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:33:30,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:33:30,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1812131568, now seen corresponding path program 1 times [2018-10-24 12:33:30,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:33:30,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:33:30,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:33:30,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:33:30,760 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:33:30,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:33:30,906 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:33:30,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:33:30,907 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:33:30,910 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-10-24 12:33:30,913 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [16], [20], [24], [29], [39], [42], [44], [50], [51], [52], [54] [2018-10-24 12:33:30,946 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 12:33:30,946 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:33:31,302 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 12:33:31,303 INFO L272 AbstractInterpreter]: Visited 17 different actions 35 times. Merged at 7 different actions 12 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 31 variables. [2018-10-24 12:33:31,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:33:31,315 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 12:33:31,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:33:31,316 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 12:33:31,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:33:31,325 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:33:31,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:33:31,374 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:33:31,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-24 12:33:31,478 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-24 12:33:31,479 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:33:31,504 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:33:31,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:33:31,571 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-10-24 12:33:31,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-10-24 12:33:31,708 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:33:31,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-24 12:33:31,710 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:33:31,771 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:33:31,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:33:31,849 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:9 [2018-10-24 12:33:31,966 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:33:31,966 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:33:32,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 18 treesize of output 16 [2018-10-24 12:33:32,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-10-24 12:33:32,138 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:33:32,184 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:33:32,243 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-10-24 12:33:32,243 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:26, output treesize:15 [2018-10-24 12:33:33,362 WARN L179 SmtUtils]: Spent 1.07 s on a formula simplification that was a NOOP. DAG size: 12 [2018-10-24 12:33:33,377 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:33:33,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:33:33,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8, 8] total 14 [2018-10-24 12:33:33,398 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:33:33,399 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-24 12:33:33,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-24 12:33:33,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-10-24 12:33:33,400 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 9 states. [2018-10-24 12:33:34,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:33:34,084 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2018-10-24 12:33:34,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-24 12:33:34,085 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-10-24 12:33:34,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:33:34,086 INFO L225 Difference]: With dead ends: 53 [2018-10-24 12:33:34,087 INFO L226 Difference]: Without dead ends: 41 [2018-10-24 12:33:34,087 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2018-10-24 12:33:34,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-24 12:33:34,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2018-10-24 12:33:34,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-24 12:33:34,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-10-24 12:33:34,100 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 18 [2018-10-24 12:33:34,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:33:34,101 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-10-24 12:33:34,101 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-24 12:33:34,101 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-10-24 12:33:34,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-24 12:33:34,102 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:33:34,103 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:33:34,103 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:33:34,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:33:34,103 INFO L82 PathProgramCache]: Analyzing trace with hash 602547482, now seen corresponding path program 1 times [2018-10-24 12:33:34,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:33:34,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:33:34,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:33:34,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:33:34,105 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:33:34,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:33:34,440 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-24 12:33:34,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:33:34,441 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:33:34,441 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-10-24 12:33:34,441 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [16], [20], [24], [29], [31], [33], [39], [42], [44], [47], [49], [50], [51], [52], [54], [55] [2018-10-24 12:33:34,444 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 12:33:34,444 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:33:34,701 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 12:33:34,701 INFO L272 AbstractInterpreter]: Visited 22 different actions 71 times. Merged at 10 different actions 28 times. Widened at 1 different actions 1 times. Found 3 fixpoints after 2 different actions. Largest state had 32 variables. [2018-10-24 12:33:34,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:33:34,747 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 12:33:34,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:33:34,748 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 12:33:34,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:33:34,761 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:33:34,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:33:34,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:33:34,967 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 17 treesize of output 14 [2018-10-24 12:33:34,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-10-24 12:33:34,985 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:33:34,988 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:33:35,054 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-10-24 12:33:35,055 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:41 [2018-10-24 12:33:35,783 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 31 treesize of output 27 [2018-10-24 12:33:35,802 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:33:35,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-10-24 12:33:35,804 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:33:38,120 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:33:38,157 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-10-24 12:33:38,158 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:57, output treesize:34 [2018-10-24 12:33:40,355 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:33:40,355 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:33:44,822 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2018-10-24 12:33:48,166 WARN L179 SmtUtils]: Spent 3.23 s on a formula simplification. DAG size of input: 55 DAG size of output: 30 [2018-10-24 12:33:48,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2018-10-24 12:33:48,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-10-24 12:33:48,433 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:33:48,439 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:33:48,446 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-10-24 12:33:48,447 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:15 [2018-10-24 12:33:48,831 WARN L179 SmtUtils]: Spent 323.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-24 12:33:49,636 WARN L179 SmtUtils]: Spent 336.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-24 12:33:49,649 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:33:49,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:33:49,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 13, 13] total 25 [2018-10-24 12:33:49,670 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:33:49,670 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-24 12:33:49,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-24 12:33:49,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=513, Unknown=4, NotChecked=0, Total=600 [2018-10-24 12:33:49,672 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 14 states. [2018-10-24 12:34:04,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:34:04,724 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-10-24 12:34:04,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 12:34:04,730 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 30 [2018-10-24 12:34:04,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:34:04,731 INFO L225 Difference]: With dead ends: 67 [2018-10-24 12:34:04,731 INFO L226 Difference]: Without dead ends: 48 [2018-10-24 12:34:04,732 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=89, Invalid=557, Unknown=4, NotChecked=0, Total=650 [2018-10-24 12:34:04,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-10-24 12:34:04,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 36. [2018-10-24 12:34:04,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-24 12:34:04,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-10-24 12:34:04,740 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 30 [2018-10-24 12:34:04,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:34:04,741 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-10-24 12:34:04,741 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-24 12:34:04,741 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-10-24 12:34:04,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-24 12:34:04,742 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:34:04,743 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:34:04,743 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:34:04,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:34:04,743 INFO L82 PathProgramCache]: Analyzing trace with hash 500960641, now seen corresponding path program 2 times [2018-10-24 12:34:04,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:34:04,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:34:04,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:34:04,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:34:04,745 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:34:04,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:34:05,044 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-24 12:34:05,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:34:05,045 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:34:05,045 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:34:05,045 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:34:05,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:34:05,045 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 12:34:05,057 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:34:05,058 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-24 12:34:05,146 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-24 12:34:05,146 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:34:05,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:34:05,256 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 17 treesize of output 14 [2018-10-24 12:34:05,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-10-24 12:34:05,270 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:34:05,272 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:34:05,288 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-10-24 12:34:05,291 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:41 [2018-10-24 12:34:05,351 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-10-24 12:34:05,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 38 [2018-10-24 12:34:05,391 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-24 12:34:05,447 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:34:05,476 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 1 xjuncts. [2018-10-24 12:34:05,476 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:68, output treesize:61 [2018-10-24 12:34:09,200 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 31 treesize of output 27 [2018-10-24 12:34:09,208 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:34:09,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-10-24 12:34:09,209 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:34:09,221 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:34:09,250 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-10-24 12:34:09,250 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:57, output treesize:34 [2018-10-24 12:34:12,224 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-24 12:34:12,224 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:34:16,896 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2018-10-24 12:34:34,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2018-10-24 12:34:34,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-10-24 12:34:34,382 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:34:34,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2018-10-24 12:34:34,388 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-24 12:34:34,406 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-24 12:34:34,407 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-24 12:34:34,433 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:34:34,440 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:34:34,456 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-24 12:34:34,456 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:48, output treesize:20 [2018-10-24 12:34:36,810 WARN L179 SmtUtils]: Spent 1.29 s on a formula simplification that was a NOOP. DAG size: 11 [2018-10-24 12:34:39,881 WARN L179 SmtUtils]: Spent 1.41 s on a formula simplification that was a NOOP. DAG size: 13 [2018-10-24 12:34:39,899 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:34:39,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:34:39,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 13, 14] total 27 [2018-10-24 12:34:39,921 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:34:39,922 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-24 12:34:39,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-24 12:34:39,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=600, Unknown=11, NotChecked=0, Total=702 [2018-10-24 12:34:39,923 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 15 states. [2018-10-24 12:34:54,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:34:54,725 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2018-10-24 12:34:54,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-24 12:34:54,726 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 33 [2018-10-24 12:34:54,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:34:54,728 INFO L225 Difference]: With dead ends: 80 [2018-10-24 12:34:54,728 INFO L226 Difference]: Without dead ends: 61 [2018-10-24 12:34:54,729 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 44 SyntacticMatches, 6 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 37.0s TimeCoverageRelationStatistics Valid=147, Invalid=898, Unknown=11, NotChecked=0, Total=1056 [2018-10-24 12:34:54,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-10-24 12:34:54,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 48. [2018-10-24 12:34:54,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-10-24 12:34:54,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2018-10-24 12:34:54,741 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 33 [2018-10-24 12:34:54,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:34:54,742 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2018-10-24 12:34:54,742 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-24 12:34:54,742 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-10-24 12:34:54,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-24 12:34:54,743 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:34:54,744 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:34:54,744 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:34:54,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:34:54,744 INFO L82 PathProgramCache]: Analyzing trace with hash -207301449, now seen corresponding path program 3 times [2018-10-24 12:34:54,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:34:54,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:34:54,746 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:34:54,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:34:54,746 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:34:54,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:34:55,332 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 4 proven. 26 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-10-24 12:34:55,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:34:55,332 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:34:55,333 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:34:55,333 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:34:55,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:34:55,333 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 12:34:55,340 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-24 12:34:55,340 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-24 12:34:55,388 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-24 12:34:55,388 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:34:55,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:34:55,475 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 17 treesize of output 14 [2018-10-24 12:34:55,478 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-10-24 12:34:55,478 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:34:55,485 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:34:55,510 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-10-24 12:34:55,511 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2018-10-24 12:34:55,579 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-10-24 12:34:55,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 38 [2018-10-24 12:34:55,627 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-24 12:34:55,642 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:34:55,666 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 1 xjuncts. [2018-10-24 12:34:55,667 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:66, output treesize:59 [2018-10-24 12:34:58,722 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 31 treesize of output 27 [2018-10-24 12:34:58,726 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:34:58,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-10-24 12:34:58,727 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:34:58,741 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:34:58,761 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-10-24 12:34:58,762 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:55, output treesize:32 [2018-10-24 12:35:02,940 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 1 proven. 41 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-24 12:35:02,940 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:35:10,169 WARN L179 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 30 [2018-10-24 12:35:21,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2018-10-24 12:35:21,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-10-24 12:35:21,165 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-24 12:35:21,165 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-24 12:35:21,168 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:35:21,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2018-10-24 12:35:21,172 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-24 12:35:21,180 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:35:21,189 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:35:21,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-24 12:35:21,211 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:48, output treesize:20 [2018-10-24 12:35:21,961 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 6 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-24 12:35:21,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:35:21,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 16, 16] total 33 [2018-10-24 12:35:21,981 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:35:21,982 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-24 12:35:21,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-24 12:35:21,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=925, Unknown=11, NotChecked=0, Total=1056 [2018-10-24 12:35:21,983 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 19 states. [2018-10-24 12:35:48,849 WARN L179 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 35 [2018-10-24 12:35:51,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:35:51,551 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2018-10-24 12:35:51,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-24 12:35:51,552 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 45 [2018-10-24 12:35:51,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:35:51,554 INFO L225 Difference]: With dead ends: 101 [2018-10-24 12:35:51,554 INFO L226 Difference]: Without dead ends: 73 [2018-10-24 12:35:51,556 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 62 SyntacticMatches, 8 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 31.1s TimeCoverageRelationStatistics Valid=168, Invalid=1227, Unknown=11, NotChecked=0, Total=1406 [2018-10-24 12:35:51,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-10-24 12:35:51,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 60. [2018-10-24 12:35:51,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-10-24 12:35:51,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2018-10-24 12:35:51,571 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 45 [2018-10-24 12:35:51,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:35:51,572 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2018-10-24 12:35:51,572 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-24 12:35:51,572 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2018-10-24 12:35:51,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-24 12:35:51,574 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:35:51,574 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:35:51,574 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:35:51,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:35:51,574 INFO L82 PathProgramCache]: Analyzing trace with hash -597350463, now seen corresponding path program 4 times [2018-10-24 12:35:51,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:35:51,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:35:51,575 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-24 12:35:51,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:35:51,576 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:35:51,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:35:52,320 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 6 proven. 40 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-24 12:35:52,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:35:52,320 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:35:52,320 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:35:52,320 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:35:52,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:35:52,321 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 12:35:52,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:35:52,329 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:35:52,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:35:52,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:35:52,729 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 17 treesize of output 14 [2018-10-24 12:35:52,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-10-24 12:35:52,732 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-24 12:35:52,734 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:35:52,751 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-10-24 12:35:52,751 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2018-10-24 12:35:52,863 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-10-24 12:35:52,885 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 38 [2018-10-24 12:35:52,887 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-24 12:35:52,899 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:35:52,937 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 1 xjuncts. [2018-10-24 12:35:52,938 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:66, output treesize:59 [2018-10-24 12:35:55,164 WARN L179 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 77 DAG size of output: 72 [2018-10-24 12:35:57,315 WARN L179 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 72 [2018-10-24 12:35:58,617 WARN L179 SmtUtils]: Spent 317.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2018-10-24 12:36:03,361 WARN L179 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 102 DAG size of output: 72 [2018-10-24 12:36:04,064 WARN L179 SmtUtils]: Spent 441.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2018-10-24 12:36:04,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 68 [2018-10-24 12:36:04,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 68 [2018-10-24 12:36:04,147 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-10-24 12:36:04,357 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:36:04,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, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 62 [2018-10-24 12:36:04,373 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-24 12:36:04,383 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:36:04,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 72 [2018-10-24 12:36:04,415 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-24 12:36:04,632 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:36:04,713 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 60 treesize of output 128 [2018-10-24 12:36:04,714 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-24 12:36:04,744 INFO L267 ElimStorePlain]: Start of recursive call 6: 34 dim-0 vars, End of recursive call: 34 dim-0 vars, and 64 xjuncts. [2018-10-24 12:36:08,040 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 38 dim-0 vars, and 27 xjuncts. [2018-10-24 12:36:12,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 1 dim-2 vars, End of recursive call: 13 dim-0 vars, and 7 xjuncts. [2018-10-24 12:36:12,327 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 11 variables, input treesize:133, output treesize:267 [2018-10-24 12:36:14,707 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 3 proven. 75 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-24 12:36:14,708 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:36:15,630 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2018-10-24 12:36:16,269 WARN L179 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 30 [2018-10-24 12:36:16,664 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-10-24 12:36:31,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2018-10-24 12:36:31,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-10-24 12:36:31,401 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-24 12:36:31,402 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-24 12:36:31,404 INFO L682 Elim1Store]: detected equality via solver [2018-10-24 12:36:31,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2018-10-24 12:36:31,409 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-24 12:36:31,418 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:36:31,425 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-24 12:36:31,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-24 12:36:31,442 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:48, output treesize:20 [2018-10-24 12:36:33,116 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 8 proven. 68 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-24 12:36:33,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:36:33,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 21, 18] total 41 [2018-10-24 12:36:33,137 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:36:33,137 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-24 12:36:33,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-24 12:36:33,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1463, Unknown=8, NotChecked=0, Total=1640 [2018-10-24 12:36:33,140 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 25 states. [2018-10-24 12:36:48,108 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 45 [2018-10-24 12:36:51,049 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-10-24 12:37:07,396 WARN L179 SmtUtils]: Spent 2.22 s on a formula simplification that was a NOOP. DAG size: 87 [2018-10-24 12:37:10,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:37:10,072 INFO L93 Difference]: Finished difference Result 122 states and 127 transitions. [2018-10-24 12:37:10,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-24 12:37:10,072 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 57 [2018-10-24 12:37:10,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:37:10,073 INFO L225 Difference]: With dead ends: 122 [2018-10-24 12:37:10,073 INFO L226 Difference]: Without dead ends: 85 [2018-10-24 12:37:10,075 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 78 SyntacticMatches, 7 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 562 ImplicationChecksByTransitivity, 41.2s TimeCoverageRelationStatistics Valid=233, Invalid=2014, Unknown=9, NotChecked=0, Total=2256 [2018-10-24 12:37:10,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-10-24 12:37:10,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 72. [2018-10-24 12:37:10,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-10-24 12:37:10,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2018-10-24 12:37:10,092 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 57 [2018-10-24 12:37:10,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:37:10,092 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2018-10-24 12:37:10,092 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-24 12:37:10,092 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2018-10-24 12:37:10,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-10-24 12:37:10,094 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:37:10,094 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 12:37:10,094 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:37:10,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:37:10,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1336655223, now seen corresponding path program 5 times [2018-10-24 12:37:10,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:37:10,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:37:10,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:37:10,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:37:10,096 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:37:10,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:37:17,393 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 8 proven. 54 refuted. 3 times theorem prover too weak. 66 trivial. 0 not checked. [2018-10-24 12:37:17,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:37:17,394 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:37:17,394 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:37:17,394 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:37:17,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:37:17,394 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 12:37:17,403 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:37:17,403 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown