java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/nested3_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 16:50:40,617 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 16:50:40,619 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 16:50:40,631 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 16:50:40,631 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 16:50:40,632 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 16:50:40,634 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 16:50:40,636 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 16:50:40,638 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 16:50:40,639 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 16:50:40,640 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 16:50:40,640 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 16:50:40,641 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 16:50:40,642 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 16:50:40,643 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 16:50:40,644 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 16:50:40,645 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 16:50:40,647 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 16:50:40,650 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 16:50:40,652 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 16:50:40,653 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 16:50:40,654 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 16:50:40,657 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 16:50:40,657 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 16:50:40,658 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 16:50:40,659 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 16:50:40,660 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 16:50:40,661 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 16:50:40,662 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 16:50:40,663 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 16:50:40,663 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 16:50:40,664 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 16:50:40,664 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 16:50:40,665 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 16:50:40,666 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 16:50:40,667 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 16:50:40,667 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf [2018-11-07 16:50:40,684 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 16:50:40,684 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 16:50:40,685 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 16:50:40,686 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 16:50:40,686 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 16:50:40,686 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 16:50:40,687 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 16:50:40,687 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 16:50:40,687 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 16:50:40,687 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 16:50:40,688 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 16:50:40,688 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 16:50:40,689 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 16:50:40,689 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 16:50:40,689 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 16:50:40,689 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 16:50:40,690 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 16:50:40,690 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 16:50:40,690 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 16:50:40,690 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 16:50:40,691 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 16:50:40,691 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 16:50:40,691 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 16:50:40,691 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 16:50:40,692 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 16:50:40,692 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 16:50:40,692 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 16:50:40,692 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 16:50:40,693 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 16:50:40,693 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 16:50:40,693 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 16:50:40,693 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 16:50:40,694 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 16:50:40,694 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 16:50:40,753 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 16:50:40,771 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 16:50:40,775 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 16:50:40,777 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 16:50:40,777 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 16:50:40,778 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/nested3_false-unreach-call.c [2018-11-07 16:50:40,848 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1e6b1f07/affc93f3b6bc491485a3f5ac5351e168/FLAGf4615ef81 [2018-11-07 16:50:41,260 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 16:50:41,261 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested3_false-unreach-call.c [2018-11-07 16:50:41,267 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1e6b1f07/affc93f3b6bc491485a3f5ac5351e168/FLAGf4615ef81 [2018-11-07 16:50:41,283 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1e6b1f07/affc93f3b6bc491485a3f5ac5351e168 [2018-11-07 16:50:41,296 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 16:50:41,298 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 16:50:41,299 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 16:50:41,299 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 16:50:41,303 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 16:50:41,304 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:50:41" (1/1) ... [2018-11-07 16:50:41,307 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5aa5a63e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:50:41, skipping insertion in model container [2018-11-07 16:50:41,307 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:50:41" (1/1) ... [2018-11-07 16:50:41,318 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 16:50:41,339 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 16:50:41,529 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 16:50:41,537 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 16:50:41,558 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 16:50:41,578 INFO L193 MainTranslator]: Completed translation [2018-11-07 16:50:41,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:50:41 WrapperNode [2018-11-07 16:50:41,579 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 16:50:41,580 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 16:50:41,580 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 16:50:41,580 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 16:50:41,590 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:50:41" (1/1) ... [2018-11-07 16:50:41,598 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:50:41" (1/1) ... [2018-11-07 16:50:41,604 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 16:50:41,605 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 16:50:41,605 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 16:50:41,605 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 16:50:41,615 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:50:41" (1/1) ... [2018-11-07 16:50:41,615 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:50:41" (1/1) ... [2018-11-07 16:50:41,616 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:50:41" (1/1) ... [2018-11-07 16:50:41,616 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:50:41" (1/1) ... [2018-11-07 16:50:41,625 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:50:41" (1/1) ... [2018-11-07 16:50:41,635 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:50:41" (1/1) ... [2018-11-07 16:50:41,637 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:50:41" (1/1) ... [2018-11-07 16:50:41,639 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 16:50:41,641 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 16:50:41,642 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 16:50:41,642 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 16:50:41,650 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:50:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 16:50:41,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 16:50:41,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 16:50:41,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 16:50:41,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 16:50:41,771 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 16:50:41,771 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 16:50:41,772 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 16:50:41,772 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 16:50:42,099 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 16:50:42,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:50:42 BoogieIcfgContainer [2018-11-07 16:50:42,100 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 16:50:42,101 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 16:50:42,101 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 16:50:42,104 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 16:50:42,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:50:41" (1/3) ... [2018-11-07 16:50:42,105 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a190654 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:50:42, skipping insertion in model container [2018-11-07 16:50:42,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:50:41" (2/3) ... [2018-11-07 16:50:42,106 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a190654 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:50:42, skipping insertion in model container [2018-11-07 16:50:42,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:50:42" (3/3) ... [2018-11-07 16:50:42,108 INFO L112 eAbstractionObserver]: Analyzing ICFG nested3_false-unreach-call.c [2018-11-07 16:50:42,117 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 16:50:42,124 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 16:50:42,138 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 16:50:42,172 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 16:50:42,172 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 16:50:42,172 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 16:50:42,173 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 16:50:42,173 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 16:50:42,173 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 16:50:42,173 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 16:50:42,173 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 16:50:42,192 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2018-11-07 16:50:42,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-07 16:50:42,198 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:50:42,199 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:50:42,202 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:50:42,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:50:42,208 INFO L82 PathProgramCache]: Analyzing trace with hash 17946046, now seen corresponding path program 1 times [2018-11-07 16:50:42,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:50:42,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:50:42,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:50:42,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:50:42,265 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:50:42,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:50:42,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:50:42,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:50:42,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 16:50:42,319 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:50:42,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 16:50:42,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 16:50:42,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 16:50:42,342 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 2 states. [2018-11-07 16:50:42,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:50:42,368 INFO L93 Difference]: Finished difference Result 47 states and 66 transitions. [2018-11-07 16:50:42,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 16:50:42,369 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-07 16:50:42,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:50:42,379 INFO L225 Difference]: With dead ends: 47 [2018-11-07 16:50:42,379 INFO L226 Difference]: Without dead ends: 22 [2018-11-07 16:50:42,382 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 16:50:42,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-07 16:50:42,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-07 16:50:42,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-07 16:50:42,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2018-11-07 16:50:42,425 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 10 [2018-11-07 16:50:42,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:50:42,425 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2018-11-07 16:50:42,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 16:50:42,426 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2018-11-07 16:50:42,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-07 16:50:42,426 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:50:42,427 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:50:42,427 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:50:42,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:50:42,428 INFO L82 PathProgramCache]: Analyzing trace with hash -583657870, now seen corresponding path program 1 times [2018-11-07 16:50:42,428 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:50:42,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:50:42,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:50:42,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:50:42,429 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:50:42,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:50:42,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:50:42,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:50:42,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 16:50:42,643 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:50:42,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 16:50:42,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 16:50:42,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 16:50:42,646 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 3 states. [2018-11-07 16:50:42,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:50:42,722 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2018-11-07 16:50:42,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 16:50:42,725 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-07 16:50:42,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:50:42,726 INFO L225 Difference]: With dead ends: 39 [2018-11-07 16:50:42,727 INFO L226 Difference]: Without dead ends: 32 [2018-11-07 16:50:42,728 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 16:50:42,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-07 16:50:42,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2018-11-07 16:50:42,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-07 16:50:42,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2018-11-07 16:50:42,738 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 11 [2018-11-07 16:50:42,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:50:42,738 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-11-07 16:50:42,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 16:50:42,739 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2018-11-07 16:50:42,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-07 16:50:42,739 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:50:42,740 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:50:42,740 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:50:42,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:50:42,741 INFO L82 PathProgramCache]: Analyzing trace with hash 2034978746, now seen corresponding path program 1 times [2018-11-07 16:50:42,741 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:50:42,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:50:42,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:50:42,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:50:42,743 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:50:42,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:50:42,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:50:42,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:50:42,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 16:50:42,841 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:50:42,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 16:50:42,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 16:50:42,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 16:50:42,843 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 3 states. [2018-11-07 16:50:42,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:50:42,897 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2018-11-07 16:50:42,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 16:50:42,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-07 16:50:42,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:50:42,899 INFO L225 Difference]: With dead ends: 47 [2018-11-07 16:50:42,900 INFO L226 Difference]: Without dead ends: 30 [2018-11-07 16:50:42,900 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 16:50:42,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-07 16:50:42,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2018-11-07 16:50:42,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-07 16:50:42,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2018-11-07 16:50:42,907 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 13 [2018-11-07 16:50:42,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:50:42,907 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-11-07 16:50:42,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 16:50:42,907 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-07 16:50:42,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-07 16:50:42,908 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:50:42,908 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:50:42,909 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:50:42,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:50:42,909 INFO L82 PathProgramCache]: Analyzing trace with hash 2046656706, now seen corresponding path program 1 times [2018-11-07 16:50:42,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:50:42,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:50:42,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:50:42,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:50:42,910 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:50:42,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:50:43,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:50:43,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:50:43,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 16:50:43,023 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:50:43,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 16:50:43,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 16:50:43,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 16:50:43,025 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 3 states. [2018-11-07 16:50:43,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:50:43,074 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2018-11-07 16:50:43,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 16:50:43,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-07 16:50:43,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:50:43,080 INFO L225 Difference]: With dead ends: 49 [2018-11-07 16:50:43,080 INFO L226 Difference]: Without dead ends: 30 [2018-11-07 16:50:43,081 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 16:50:43,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-07 16:50:43,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2018-11-07 16:50:43,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-07 16:50:43,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-11-07 16:50:43,090 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 15 [2018-11-07 16:50:43,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:50:43,094 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-11-07 16:50:43,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 16:50:43,094 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-07 16:50:43,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-07 16:50:43,095 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:50:43,095 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:50:43,095 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:50:43,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:50:43,095 INFO L82 PathProgramCache]: Analyzing trace with hash 441532680, now seen corresponding path program 1 times [2018-11-07 16:50:43,095 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:50:43,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:50:43,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:50:43,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:50:43,097 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:50:43,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:50:43,210 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:50:43,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:50:43,210 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:50:43,211 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 18 with the following transitions: [2018-11-07 16:50:43,213 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [14], [18], [24], [28], [32], [34], [50], [53], [55], [61], [62], [63], [65] [2018-11-07 16:50:43,240 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 16:50:43,241 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 16:50:43,328 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 16:50:43,669 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 16:50:43,670 INFO L272 AbstractInterpreter]: Visited 16 different actions 57 times. Merged at 3 different actions 19 times. Widened at 1 different actions 3 times. Found 1 fixpoints after 1 different actions. Largest state had 5 variables. [2018-11-07 16:50:43,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:50:43,720 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 16:50:43,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:50:43,720 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:50:43,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:50:43,735 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:50:43,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:50:43,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:50:43,869 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:50:43,869 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:50:44,126 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:50:44,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:50:44,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-11-07 16:50:44,148 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:50:44,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 16:50:44,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 16:50:44,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-07 16:50:44,149 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 4 states. [2018-11-07 16:50:44,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:50:44,216 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2018-11-07 16:50:44,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 16:50:44,217 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-11-07 16:50:44,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:50:44,218 INFO L225 Difference]: With dead ends: 53 [2018-11-07 16:50:44,218 INFO L226 Difference]: Without dead ends: 32 [2018-11-07 16:50:44,219 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-07 16:50:44,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-07 16:50:44,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-11-07 16:50:44,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-07 16:50:44,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-11-07 16:50:44,225 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 17 [2018-11-07 16:50:44,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:50:44,225 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-11-07 16:50:44,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 16:50:44,226 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-07 16:50:44,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-07 16:50:44,226 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:50:44,227 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:50:44,227 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:50:44,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:50:44,227 INFO L82 PathProgramCache]: Analyzing trace with hash -189397042, now seen corresponding path program 2 times [2018-11-07 16:50:44,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:50:44,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:50:44,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:50:44,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:50:44,229 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:50:44,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:50:44,426 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:50:44,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:50:44,426 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:50:44,427 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:50:44,427 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:50:44,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:50:44,427 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:50:44,447 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:50:44,448 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:50:44,484 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 16:50:44,485 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:50:44,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:50:44,513 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:50:44,513 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:50:44,768 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:50:44,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:50:44,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2018-11-07 16:50:44,795 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:50:44,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 16:50:44,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 16:50:44,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-07 16:50:44,796 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 5 states. [2018-11-07 16:50:44,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:50:44,847 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2018-11-07 16:50:44,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 16:50:44,850 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-07 16:50:44,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:50:44,851 INFO L225 Difference]: With dead ends: 57 [2018-11-07 16:50:44,851 INFO L226 Difference]: Without dead ends: 34 [2018-11-07 16:50:44,852 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-07 16:50:44,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-07 16:50:44,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-11-07 16:50:44,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-07 16:50:44,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-11-07 16:50:44,858 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 19 [2018-11-07 16:50:44,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:50:44,858 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-11-07 16:50:44,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 16:50:44,859 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-07 16:50:44,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-07 16:50:44,859 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:50:44,860 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:50:44,860 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:50:44,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:50:44,860 INFO L82 PathProgramCache]: Analyzing trace with hash -922471148, now seen corresponding path program 3 times [2018-11-07 16:50:44,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:50:44,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:50:44,861 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:50:44,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:50:44,862 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:50:44,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:50:45,024 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:50:45,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:50:45,025 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:50:45,025 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:50:45,025 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:50:45,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:50:45,025 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:50:45,041 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:50:45,042 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:50:45,080 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:50:45,080 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:50:45,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:50:45,102 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:50:45,103 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:50:45,306 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:50:45,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:50:45,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2018-11-07 16:50:45,329 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:50:45,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 16:50:45,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 16:50:45,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-07 16:50:45,330 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 6 states. [2018-11-07 16:50:45,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:50:45,381 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2018-11-07 16:50:45,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 16:50:45,383 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-07 16:50:45,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:50:45,384 INFO L225 Difference]: With dead ends: 61 [2018-11-07 16:50:45,384 INFO L226 Difference]: Without dead ends: 36 [2018-11-07 16:50:45,385 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-07 16:50:45,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-07 16:50:45,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-11-07 16:50:45,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-07 16:50:45,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-11-07 16:50:45,391 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 21 [2018-11-07 16:50:45,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:50:45,392 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-11-07 16:50:45,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 16:50:45,392 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-07 16:50:45,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-07 16:50:45,393 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:50:45,393 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:50:45,393 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:50:45,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:50:45,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1032050470, now seen corresponding path program 4 times [2018-11-07 16:50:45,394 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:50:45,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:50:45,395 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:50:45,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:50:45,395 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:50:45,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:50:45,996 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:50:45,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:50:45,996 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:50:45,996 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:50:45,996 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:50:45,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:50:45,997 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:50:46,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:50:46,014 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:50:46,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:50:46,048 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:50:46,105 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:50:46,106 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:50:46,314 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:50:46,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:50:46,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2018-11-07 16:50:46,335 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:50:46,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 16:50:46,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 16:50:46,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-07 16:50:46,336 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 7 states. [2018-11-07 16:50:46,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:50:46,405 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2018-11-07 16:50:46,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 16:50:46,408 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-11-07 16:50:46,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:50:46,409 INFO L225 Difference]: With dead ends: 65 [2018-11-07 16:50:46,409 INFO L226 Difference]: Without dead ends: 38 [2018-11-07 16:50:46,410 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-07 16:50:46,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-07 16:50:46,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2018-11-07 16:50:46,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-07 16:50:46,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2018-11-07 16:50:46,418 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 23 [2018-11-07 16:50:46,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:50:46,418 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2018-11-07 16:50:46,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 16:50:46,418 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-11-07 16:50:46,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-07 16:50:46,419 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:50:46,419 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:50:46,419 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:50:46,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:50:46,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1036403488, now seen corresponding path program 5 times [2018-11-07 16:50:46,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:50:46,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:50:46,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:50:46,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:50:46,422 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:50:46,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:50:46,583 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:50:46,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:50:46,584 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:50:46,584 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:50:46,584 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:50:46,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:50:46,585 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:50:46,597 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:50:46,597 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:50:46,621 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-07 16:50:46,621 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:50:46,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:50:46,641 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:50:46,642 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:50:46,876 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:50:46,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:50:46,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2018-11-07 16:50:46,897 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:50:46,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 16:50:46,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 16:50:46,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2018-11-07 16:50:46,899 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 8 states. [2018-11-07 16:50:46,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:50:46,981 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2018-11-07 16:50:46,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 16:50:46,984 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-11-07 16:50:46,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:50:46,985 INFO L225 Difference]: With dead ends: 69 [2018-11-07 16:50:46,985 INFO L226 Difference]: Without dead ends: 40 [2018-11-07 16:50:46,985 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2018-11-07 16:50:46,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-07 16:50:46,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-11-07 16:50:46,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-07 16:50:46,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2018-11-07 16:50:46,992 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 25 [2018-11-07 16:50:46,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:50:46,992 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2018-11-07 16:50:46,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 16:50:46,992 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-11-07 16:50:46,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-07 16:50:46,993 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:50:46,993 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:50:46,994 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:50:46,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:50:46,994 INFO L82 PathProgramCache]: Analyzing trace with hash 250799078, now seen corresponding path program 6 times [2018-11-07 16:50:46,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:50:46,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:50:46,995 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:50:46,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:50:46,995 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:50:47,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:50:47,169 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:50:47,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:50:47,170 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:50:47,170 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:50:47,170 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:50:47,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:50:47,170 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:50:47,180 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:50:47,180 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:50:47,208 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:50:47,208 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:50:47,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:50:47,238 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:50:47,238 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:50:47,402 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:50:47,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:50:47,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2018-11-07 16:50:47,423 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:50:47,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 16:50:47,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 16:50:47,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-11-07 16:50:47,424 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 9 states. [2018-11-07 16:50:47,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:50:47,503 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2018-11-07 16:50:47,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 16:50:47,510 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2018-11-07 16:50:47,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:50:47,511 INFO L225 Difference]: With dead ends: 73 [2018-11-07 16:50:47,511 INFO L226 Difference]: Without dead ends: 42 [2018-11-07 16:50:47,512 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-11-07 16:50:47,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-07 16:50:47,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2018-11-07 16:50:47,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-07 16:50:47,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-11-07 16:50:47,522 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 27 [2018-11-07 16:50:47,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:50:47,522 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-11-07 16:50:47,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 16:50:47,522 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-07 16:50:47,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-07 16:50:47,523 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:50:47,524 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:50:47,527 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:50:47,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:50:47,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1199205164, now seen corresponding path program 7 times [2018-11-07 16:50:47,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:50:47,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:50:47,528 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:50:47,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:50:47,528 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:50:47,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:50:47,727 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:50:47,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:50:47,728 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:50:47,728 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:50:47,728 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:50:47,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:50:47,728 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:50:47,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:50:47,739 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:50:47,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:50:47,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:50:47,770 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:50:47,771 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:50:48,169 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:50:48,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:50:48,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2018-11-07 16:50:48,190 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:50:48,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 16:50:48,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 16:50:48,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2018-11-07 16:50:48,191 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 10 states. [2018-11-07 16:50:48,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:50:48,322 INFO L93 Difference]: Finished difference Result 77 states and 86 transitions. [2018-11-07 16:50:48,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-07 16:50:48,322 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2018-11-07 16:50:48,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:50:48,323 INFO L225 Difference]: With dead ends: 77 [2018-11-07 16:50:48,323 INFO L226 Difference]: Without dead ends: 44 [2018-11-07 16:50:48,324 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2018-11-07 16:50:48,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-07 16:50:48,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2018-11-07 16:50:48,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-07 16:50:48,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-11-07 16:50:48,330 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 29 [2018-11-07 16:50:48,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:50:48,330 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-11-07 16:50:48,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 16:50:48,331 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-11-07 16:50:48,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-07 16:50:48,331 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:50:48,332 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:50:48,332 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:50:48,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:50:48,332 INFO L82 PathProgramCache]: Analyzing trace with hash 2084387058, now seen corresponding path program 8 times [2018-11-07 16:50:48,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:50:48,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:50:48,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:50:48,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:50:48,333 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:50:48,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:50:48,803 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:50:48,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:50:48,804 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:50:48,804 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:50:48,804 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:50:48,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:50:48,804 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:50:48,816 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:50:48,816 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:50:48,873 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-07 16:50:48,873 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:50:48,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:50:48,900 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:50:48,901 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:50:49,122 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:50:49,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:50:49,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 20 [2018-11-07 16:50:49,144 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:50:49,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 16:50:49,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 16:50:49,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2018-11-07 16:50:49,145 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 11 states. [2018-11-07 16:50:49,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:50:49,233 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2018-11-07 16:50:49,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-07 16:50:49,242 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 31 [2018-11-07 16:50:49,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:50:49,244 INFO L225 Difference]: With dead ends: 81 [2018-11-07 16:50:49,244 INFO L226 Difference]: Without dead ends: 46 [2018-11-07 16:50:49,245 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2018-11-07 16:50:49,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-07 16:50:49,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2018-11-07 16:50:49,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-07 16:50:49,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-11-07 16:50:49,256 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 31 [2018-11-07 16:50:49,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:50:49,257 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-11-07 16:50:49,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 16:50:49,258 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-11-07 16:50:49,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-07 16:50:49,258 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:50:49,259 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:50:49,259 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:50:49,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:50:49,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1954304712, now seen corresponding path program 9 times [2018-11-07 16:50:49,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:50:49,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:50:49,260 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:50:49,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:50:49,261 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:50:49,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:50:49,527 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:50:49,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:50:49,527 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:50:49,528 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:50:49,528 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:50:49,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:50:49,528 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:50:49,536 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:50:49,536 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:50:49,565 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:50:49,565 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:50:49,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:50:49,660 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:50:49,660 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:50:50,373 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:50:50,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:50:50,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 22 [2018-11-07 16:50:50,394 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:50:50,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 16:50:50,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 16:50:50,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2018-11-07 16:50:50,395 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 12 states. [2018-11-07 16:50:50,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:50:50,507 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2018-11-07 16:50:50,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 16:50:50,509 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2018-11-07 16:50:50,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:50:50,510 INFO L225 Difference]: With dead ends: 85 [2018-11-07 16:50:50,510 INFO L226 Difference]: Without dead ends: 48 [2018-11-07 16:50:50,511 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2018-11-07 16:50:50,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-07 16:50:50,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-11-07 16:50:50,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-07 16:50:50,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-11-07 16:50:50,518 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 33 [2018-11-07 16:50:50,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:50:50,519 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-11-07 16:50:50,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 16:50:50,519 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-11-07 16:50:50,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-07 16:50:50,520 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:50:50,520 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:50:50,520 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:50:50,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:50:50,521 INFO L82 PathProgramCache]: Analyzing trace with hash -486660098, now seen corresponding path program 10 times [2018-11-07 16:50:50,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:50:50,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:50:50,522 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:50:50,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:50:50,522 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:50:50,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:50:50,888 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:50:50,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:50:50,888 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:50:50,888 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:50:50,888 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:50:50,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:50:50,889 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:50:50,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:50:50,900 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:50:50,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:50:50,916 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:50:50,942 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:50:50,942 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:50:51,323 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:50:51,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:50:51,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2018-11-07 16:50:51,344 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:50:51,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-07 16:50:51,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-07 16:50:51,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-07 16:50:51,346 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 13 states. [2018-11-07 16:50:51,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:50:51,468 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2018-11-07 16:50:51,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 16:50:51,468 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 35 [2018-11-07 16:50:51,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:50:51,469 INFO L225 Difference]: With dead ends: 89 [2018-11-07 16:50:51,469 INFO L226 Difference]: Without dead ends: 50 [2018-11-07 16:50:51,470 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-07 16:50:51,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-07 16:50:51,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2018-11-07 16:50:51,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-07 16:50:51,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2018-11-07 16:50:51,476 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 35 [2018-11-07 16:50:51,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:50:51,476 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2018-11-07 16:50:51,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-07 16:50:51,476 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2018-11-07 16:50:51,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-07 16:50:51,477 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:50:51,477 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:50:51,477 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:50:51,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:50:51,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1170540868, now seen corresponding path program 11 times [2018-11-07 16:50:51,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:50:51,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:50:51,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:50:51,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:50:51,482 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:50:51,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:50:51,711 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:50:51,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:50:51,712 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:50:51,712 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:50:51,712 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:50:51,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:50:51,712 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:50:51,722 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:50:51,722 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:52:00,592 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-07 16:52:00,592 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:52:00,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:52:00,639 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:52:00,640 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:52:01,013 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:52:01,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:52:01,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 26 [2018-11-07 16:52:01,017 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:52:01,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 16:52:01,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 16:52:01,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2018-11-07 16:52:01,019 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 14 states. [2018-11-07 16:52:01,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:52:01,180 INFO L93 Difference]: Finished difference Result 93 states and 102 transitions. [2018-11-07 16:52:01,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-07 16:52:01,181 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2018-11-07 16:52:01,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:52:01,182 INFO L225 Difference]: With dead ends: 93 [2018-11-07 16:52:01,182 INFO L226 Difference]: Without dead ends: 52 [2018-11-07 16:52:01,183 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2018-11-07 16:52:01,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-07 16:52:01,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2018-11-07 16:52:01,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-07 16:52:01,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-11-07 16:52:01,190 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 37 [2018-11-07 16:52:01,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:52:01,191 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-11-07 16:52:01,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 16:52:01,191 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-11-07 16:52:01,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-07 16:52:01,192 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:52:01,192 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:52:01,192 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:52:01,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:52:01,193 INFO L82 PathProgramCache]: Analyzing trace with hash 307802378, now seen corresponding path program 12 times [2018-11-07 16:52:01,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:52:01,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:52:01,194 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:52:01,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:52:01,194 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:52:01,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:52:01,784 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:52:01,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:52:01,784 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:52:01,785 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:52:01,785 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:52:01,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:52:01,785 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:52:01,802 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:52:01,803 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:52:01,815 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:52:01,816 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:52:01,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:52:01,850 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:52:01,851 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:52:02,454 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:52:02,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:52:02,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 28 [2018-11-07 16:52:02,474 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:52:02,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-07 16:52:02,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-07 16:52:02,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2018-11-07 16:52:02,475 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 15 states. [2018-11-07 16:52:02,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:52:02,660 INFO L93 Difference]: Finished difference Result 97 states and 106 transitions. [2018-11-07 16:52:02,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-07 16:52:02,660 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 39 [2018-11-07 16:52:02,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:52:02,661 INFO L225 Difference]: With dead ends: 97 [2018-11-07 16:52:02,661 INFO L226 Difference]: Without dead ends: 54 [2018-11-07 16:52:02,662 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2018-11-07 16:52:02,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-07 16:52:02,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2018-11-07 16:52:02,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-07 16:52:02,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-11-07 16:52:02,667 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 39 [2018-11-07 16:52:02,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:52:02,668 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-11-07 16:52:02,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-07 16:52:02,668 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-11-07 16:52:02,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-07 16:52:02,669 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:52:02,669 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:52:02,669 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:52:02,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:52:02,669 INFO L82 PathProgramCache]: Analyzing trace with hash 144801616, now seen corresponding path program 13 times [2018-11-07 16:52:02,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:52:02,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:52:02,670 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:52:02,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:52:02,671 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:52:02,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:52:03,000 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:52:03,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:52:03,001 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:52:03,001 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:52:03,001 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:52:03,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:52:03,001 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:52:03,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:52:03,017 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:52:03,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:52:03,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:52:03,054 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:52:03,055 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:52:03,799 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:52:03,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:52:03,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 30 [2018-11-07 16:52:03,819 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:52:03,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-07 16:52:03,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-07 16:52:03,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=617, Unknown=0, NotChecked=0, Total=870 [2018-11-07 16:52:03,821 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 16 states. [2018-11-07 16:52:03,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:52:03,987 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2018-11-07 16:52:03,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 16:52:03,994 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 41 [2018-11-07 16:52:03,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:52:03,995 INFO L225 Difference]: With dead ends: 101 [2018-11-07 16:52:03,995 INFO L226 Difference]: Without dead ends: 56 [2018-11-07 16:52:03,996 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=253, Invalid=617, Unknown=0, NotChecked=0, Total=870 [2018-11-07 16:52:03,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-07 16:52:04,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2018-11-07 16:52:04,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-07 16:52:04,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-11-07 16:52:04,011 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 41 [2018-11-07 16:52:04,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:52:04,012 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-11-07 16:52:04,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-07 16:52:04,012 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-11-07 16:52:04,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-07 16:52:04,015 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:52:04,015 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:52:04,015 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:52:04,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:52:04,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1880108010, now seen corresponding path program 14 times [2018-11-07 16:52:04,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:52:04,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:52:04,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:52:04,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:52:04,017 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:52:04,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:52:04,284 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:52:04,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:52:04,284 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:52:04,284 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:52:04,284 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:52:04,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:52:04,285 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:52:04,292 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:52:04,292 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 16:53:04,342 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-11-07 16:53:04,343 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:53:04,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:53:04,745 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:53:04,746 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:53:59,570 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 204 refuted. 6 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:53:59,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:53:59,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 32 [2018-11-07 16:53:59,579 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:53:59,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 16:53:59,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 16:53:59,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=685, Unknown=21, NotChecked=0, Total=992 [2018-11-07 16:53:59,581 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 17 states. [2018-11-07 16:53:59,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:53:59,838 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2018-11-07 16:53:59,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 16:53:59,842 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 43 [2018-11-07 16:53:59,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:53:59,843 INFO L225 Difference]: With dead ends: 105 [2018-11-07 16:53:59,843 INFO L226 Difference]: Without dead ends: 58 [2018-11-07 16:53:59,844 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 70 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 55.1s TimeCoverageRelationStatistics Valid=286, Invalid=685, Unknown=21, NotChecked=0, Total=992 [2018-11-07 16:53:59,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-07 16:53:59,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2018-11-07 16:53:59,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-07 16:53:59,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-11-07 16:53:59,853 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 43 [2018-11-07 16:53:59,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:53:59,854 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-11-07 16:53:59,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 16:53:59,854 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-11-07 16:53:59,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-07 16:53:59,855 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:53:59,855 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:53:59,855 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:53:59,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:53:59,856 INFO L82 PathProgramCache]: Analyzing trace with hash 2096893788, now seen corresponding path program 15 times [2018-11-07 16:53:59,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:53:59,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:53:59,859 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:53:59,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:53:59,859 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:53:59,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:54:00,623 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:54:00,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:54:00,623 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:54:00,624 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:54:00,624 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:54:00,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:54:00,624 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:54:00,632 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 16:54:00,632 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 16:54:00,666 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 16:54:00,666 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 16:54:00,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:54:00,727 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:54:00,728 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:54:01,317 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:54:01,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:54:01,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 34 [2018-11-07 16:54:01,337 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:54:01,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-07 16:54:01,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-07 16:54:01,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=801, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 16:54:01,339 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 18 states. [2018-11-07 16:54:01,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:54:01,660 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2018-11-07 16:54:01,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-07 16:54:01,663 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 45 [2018-11-07 16:54:01,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:54:01,663 INFO L225 Difference]: With dead ends: 109 [2018-11-07 16:54:01,664 INFO L226 Difference]: Without dead ends: 60 [2018-11-07 16:54:01,664 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=321, Invalid=801, Unknown=0, NotChecked=0, Total=1122 [2018-11-07 16:54:01,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-07 16:54:01,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2018-11-07 16:54:01,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-07 16:54:01,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2018-11-07 16:54:01,669 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 45 [2018-11-07 16:54:01,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:54:01,670 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2018-11-07 16:54:01,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-07 16:54:01,670 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2018-11-07 16:54:01,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-07 16:54:01,671 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:54:01,671 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:54:01,671 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:54:01,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:54:01,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1474728226, now seen corresponding path program 16 times [2018-11-07 16:54:01,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:54:01,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:54:01,672 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 16:54:01,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:54:01,673 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:54:01,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:54:02,195 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:54:02,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:54:02,196 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:54:02,196 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:54:02,196 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:54:02,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:54:02,196 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:54:02,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:54:02,206 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:54:02,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:54:02,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:54:02,239 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:54:02,249 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:54:02,870 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:54:02,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:54:02,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 36 [2018-11-07 16:54:02,899 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:54:02,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-07 16:54:02,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-07 16:54:02,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=902, Unknown=0, NotChecked=0, Total=1260 [2018-11-07 16:54:02,900 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 19 states. [2018-11-07 16:54:03,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:54:03,163 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2018-11-07 16:54:03,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-07 16:54:03,164 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 47 [2018-11-07 16:54:03,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:54:03,165 INFO L225 Difference]: With dead ends: 113 [2018-11-07 16:54:03,165 INFO L226 Difference]: Without dead ends: 62 [2018-11-07 16:54:03,166 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=358, Invalid=902, Unknown=0, NotChecked=0, Total=1260 [2018-11-07 16:54:03,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-07 16:54:03,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2018-11-07 16:54:03,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-07 16:54:03,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2018-11-07 16:54:03,170 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 47 [2018-11-07 16:54:03,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:54:03,170 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2018-11-07 16:54:03,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-07 16:54:03,170 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-11-07 16:54:03,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-07 16:54:03,171 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:54:03,171 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:54:03,171 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:54:03,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:54:03,171 INFO L82 PathProgramCache]: Analyzing trace with hash 574077288, now seen corresponding path program 17 times [2018-11-07 16:54:03,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:54:03,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:54:03,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:54:03,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:54:03,173 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:54:03,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:54:03,487 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:54:03,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:54:03,487 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:54:03,487 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 16:54:03,487 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 16:54:03,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:54:03,487 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:54:03,495 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 16:54:03,495 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