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-EXP.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/Mono3_false-unreach-call1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 10:42:39,564 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 10:42:39,566 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 10:42:39,584 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 10:42:39,584 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 10:42:39,585 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 10:42:39,587 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 10:42:39,590 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 10:42:39,592 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 10:42:39,594 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 10:42:39,595 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 10:42:39,595 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 10:42:39,597 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 10:42:39,598 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 10:42:39,607 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 10:42:39,608 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 10:42:39,613 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 10:42:39,614 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 10:42:39,620 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 10:42:39,622 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 10:42:39,623 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 10:42:39,626 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 10:42:39,629 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 10:42:39,629 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 10:42:39,632 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 10:42:39,633 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 10:42:39,634 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 10:42:39,635 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 10:42:39,635 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 10:42:39,638 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 10:42:39,638 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 10:42:39,640 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 10:42:39,641 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 10:42:39,641 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 10:42:39,643 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 10:42:39,644 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 10:42:39,644 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-11-07 10:42:39,667 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 10:42:39,668 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 10:42:39,669 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 10:42:39,669 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 10:42:39,670 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 10:42:39,670 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 10:42:39,670 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-07 10:42:39,670 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 10:42:39,670 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 10:42:39,671 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 10:42:39,671 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 10:42:39,671 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 10:42:39,672 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 10:42:39,672 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 10:42:39,673 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 10:42:39,673 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 10:42:39,673 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 10:42:39,673 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 10:42:39,673 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 10:42:39,675 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 10:42:39,675 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 10:42:39,675 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 10:42:39,676 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 10:42:39,676 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 10:42:39,676 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 10:42:39,676 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 10:42:39,676 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 10:42:39,677 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 10:42:39,677 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 10:42:39,677 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 10:42:39,677 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 10:42:39,677 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 10:42:39,678 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 10:42:39,678 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 10:42:39,678 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 10:42:39,678 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 10:42:39,738 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 10:42:39,751 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 10:42:39,755 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 10:42:39,757 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 10:42:39,757 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 10:42:39,758 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/Mono3_false-unreach-call1.c [2018-11-07 10:42:39,839 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6062b754f/13c7999dba9b4187b8acbbe5d4035053/FLAG7921c89d8 [2018-11-07 10:42:40,289 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 10:42:40,289 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono3_false-unreach-call1.c [2018-11-07 10:42:40,297 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6062b754f/13c7999dba9b4187b8acbbe5d4035053/FLAG7921c89d8 [2018-11-07 10:42:40,313 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6062b754f/13c7999dba9b4187b8acbbe5d4035053 [2018-11-07 10:42:40,325 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 10:42:40,326 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 10:42:40,327 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 10:42:40,328 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 10:42:40,332 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 10:42:40,333 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:42:40" (1/1) ... [2018-11-07 10:42:40,336 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a7ecc06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:42:40, skipping insertion in model container [2018-11-07 10:42:40,337 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:42:40" (1/1) ... [2018-11-07 10:42:40,348 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 10:42:40,375 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 10:42:40,625 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 10:42:40,630 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 10:42:40,650 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 10:42:40,668 INFO L193 MainTranslator]: Completed translation [2018-11-07 10:42:40,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:42:40 WrapperNode [2018-11-07 10:42:40,669 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 10:42:40,670 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 10:42:40,671 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 10:42:40,671 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 10:42:40,683 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:42:40" (1/1) ... [2018-11-07 10:42:40,691 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:42:40" (1/1) ... [2018-11-07 10:42:40,699 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 10:42:40,700 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 10:42:40,700 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 10:42:40,700 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 10:42:40,712 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:42:40" (1/1) ... [2018-11-07 10:42:40,712 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:42:40" (1/1) ... [2018-11-07 10:42:40,713 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:42:40" (1/1) ... [2018-11-07 10:42:40,713 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:42:40" (1/1) ... [2018-11-07 10:42:40,718 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:42:40" (1/1) ... [2018-11-07 10:42:40,726 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:42:40" (1/1) ... [2018-11-07 10:42:40,727 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:42:40" (1/1) ... [2018-11-07 10:42:40,728 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 10:42:40,729 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 10:42:40,729 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 10:42:40,729 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 10:42:40,733 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:42:40" (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 10:42:40,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 10:42:40,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 10:42:40,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 10:42:40,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 10:42:40,879 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 10:42:40,879 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 10:42:40,879 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 10:42:40,880 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 10:42:41,081 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 10:42:41,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:42:41 BoogieIcfgContainer [2018-11-07 10:42:41,082 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 10:42:41,083 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 10:42:41,083 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 10:42:41,097 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 10:42:41,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:42:40" (1/3) ... [2018-11-07 10:42:41,101 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75a0e155 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:42:41, skipping insertion in model container [2018-11-07 10:42:41,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:42:40" (2/3) ... [2018-11-07 10:42:41,102 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75a0e155 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:42:41, skipping insertion in model container [2018-11-07 10:42:41,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:42:41" (3/3) ... [2018-11-07 10:42:41,109 INFO L112 eAbstractionObserver]: Analyzing ICFG Mono3_false-unreach-call1.c [2018-11-07 10:42:41,135 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 10:42:41,150 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 10:42:41,205 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 10:42:41,243 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 10:42:41,244 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 10:42:41,244 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 10:42:41,244 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 10:42:41,244 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 10:42:41,244 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 10:42:41,245 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 10:42:41,245 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 10:42:41,267 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-11-07 10:42:41,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-07 10:42:41,278 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:42:41,279 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:42:41,289 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:42:41,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:42:41,304 INFO L82 PathProgramCache]: Analyzing trace with hash -146959038, now seen corresponding path program 1 times [2018-11-07 10:42:41,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:42:41,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:41,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:42:41,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:41,384 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:42:41,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:42:41,440 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 10:42:41,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:42:41,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 10:42:41,443 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:42:41,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 10:42:41,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 10:42:41,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 10:42:41,462 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2018-11-07 10:42:41,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:42:41,485 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-07 10:42:41,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 10:42:41,487 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-07 10:42:41,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:42:41,496 INFO L225 Difference]: With dead ends: 31 [2018-11-07 10:42:41,497 INFO L226 Difference]: Without dead ends: 14 [2018-11-07 10:42:41,500 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 10:42:41,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-07 10:42:41,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-07 10:42:41,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-07 10:42:41,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-11-07 10:42:41,538 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2018-11-07 10:42:41,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:42:41,539 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2018-11-07 10:42:41,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 10:42:41,539 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-07 10:42:41,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-07 10:42:41,540 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:42:41,540 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:42:41,541 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:42:41,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:42:41,541 INFO L82 PathProgramCache]: Analyzing trace with hash -717461825, now seen corresponding path program 1 times [2018-11-07 10:42:41,541 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:42:41,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:41,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:42:41,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:41,543 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:42:41,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:42:41,618 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 10:42:41,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:42:41,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 10:42:41,619 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:42:41,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 10:42:41,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 10:42:41,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 10:42:41,622 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 3 states. [2018-11-07 10:42:41,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:42:41,706 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2018-11-07 10:42:41,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 10:42:41,706 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-07 10:42:41,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:42:41,707 INFO L225 Difference]: With dead ends: 27 [2018-11-07 10:42:41,707 INFO L226 Difference]: Without dead ends: 18 [2018-11-07 10:42:41,709 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 10:42:41,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-07 10:42:41,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-11-07 10:42:41,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-07 10:42:41,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-11-07 10:42:41,715 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 11 [2018-11-07 10:42:41,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:42:41,715 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-11-07 10:42:41,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 10:42:41,716 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-11-07 10:42:41,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-07 10:42:41,716 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:42:41,717 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:42:41,717 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:42:41,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:42:41,717 INFO L82 PathProgramCache]: Analyzing trace with hash 514987241, now seen corresponding path program 1 times [2018-11-07 10:42:41,718 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:42:41,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:41,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:42:41,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:41,719 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:42:41,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:42:41,819 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 10:42:41,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:41,820 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:42:41,823 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 16 with the following transitions: [2018-11-07 10:42:41,826 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [17], [21], [27], [30], [32], [38], [39], [40], [42] [2018-11-07 10:42:41,857 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 10:42:41,857 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:42:42,048 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 10:42:42,049 INFO L272 AbstractInterpreter]: Visited 14 different actions 24 times. Merged at 4 different actions 8 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 4 variables. [2018-11-07 10:42:42,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:42:42,102 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 10:42:42,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:42,103 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 10:42:42,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:42:42,132 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:42:42,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:42:42,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:42:42,384 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 10:42:42,384 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:42:42,898 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 10:42:42,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:42:42,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 8] total 13 [2018-11-07 10:42:42,921 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:42:42,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 10:42:42,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 10:42:42,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-11-07 10:42:42,922 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 7 states. [2018-11-07 10:42:43,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:42:43,027 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-07 10:42:43,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 10:42:43,028 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-11-07 10:42:43,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:42:43,029 INFO L225 Difference]: With dead ends: 31 [2018-11-07 10:42:43,029 INFO L226 Difference]: Without dead ends: 22 [2018-11-07 10:42:43,030 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-11-07 10:42:43,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-07 10:42:43,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-11-07 10:42:43,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-07 10:42:43,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-11-07 10:42:43,035 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 15 [2018-11-07 10:42:43,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:42:43,036 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-07 10:42:43,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 10:42:43,036 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-07 10:42:43,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-07 10:42:43,037 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:42:43,037 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:42:43,038 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:42:43,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:42:43,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1005624851, now seen corresponding path program 2 times [2018-11-07 10:42:43,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:42:43,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:43,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:42:43,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:43,040 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:42:43,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:42:43,133 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:42:43,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:43,134 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:42:43,134 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:42:43,134 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:42:43,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:43,135 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 10:42:43,155 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:42:43,156 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:42:43,190 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-07 10:42:43,190 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:42:43,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:42:43,345 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-07 10:42:43,345 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:42:43,419 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-07 10:42:43,439 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 10:42:43,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [5] total 9 [2018-11-07 10:42:43,440 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:42:43,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 10:42:43,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 10:42:43,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-11-07 10:42:43,441 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 4 states. [2018-11-07 10:42:43,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:42:43,587 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-11-07 10:42:43,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 10:42:43,587 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-11-07 10:42:43,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:42:43,588 INFO L225 Difference]: With dead ends: 32 [2018-11-07 10:42:43,589 INFO L226 Difference]: Without dead ends: 27 [2018-11-07 10:42:43,589 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-11-07 10:42:43,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-07 10:42:43,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2018-11-07 10:42:43,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-07 10:42:43,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-11-07 10:42:43,595 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 19 [2018-11-07 10:42:43,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:42:43,595 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-11-07 10:42:43,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 10:42:43,595 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-07 10:42:43,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-07 10:42:43,596 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:42:43,596 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:42:43,596 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:42:43,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:42:43,597 INFO L82 PathProgramCache]: Analyzing trace with hash -422257669, now seen corresponding path program 1 times [2018-11-07 10:42:43,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:42:43,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:43,598 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:42:43,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:43,599 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:42:43,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:42:43,746 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:42:43,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:43,747 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:42:43,748 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-11-07 10:42:43,748 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [17], [19], [21], [27], [30], [32], [38], [39], [40], [42] [2018-11-07 10:42:43,750 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 10:42:43,750 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:42:43,785 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 10:42:43,786 INFO L272 AbstractInterpreter]: Visited 15 different actions 27 times. Merged at 4 different actions 8 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 5 variables. [2018-11-07 10:42:43,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:42:43,802 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 10:42:43,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:43,802 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 10:42:43,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:42:43,812 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:42:43,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:42:43,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:42:44,001 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:42:44,002 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:42:44,281 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:42:44,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:42:44,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 10 [2018-11-07 10:42:44,302 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:42:44,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 10:42:44,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 10:42:44,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2018-11-07 10:42:44,303 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 6 states. [2018-11-07 10:42:44,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:42:44,406 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2018-11-07 10:42:44,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 10:42:44,407 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-11-07 10:42:44,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:42:44,407 INFO L225 Difference]: With dead ends: 41 [2018-11-07 10:42:44,408 INFO L226 Difference]: Without dead ends: 29 [2018-11-07 10:42:44,408 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2018-11-07 10:42:44,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-07 10:42:44,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2018-11-07 10:42:44,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-07 10:42:44,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-11-07 10:42:44,414 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 23 [2018-11-07 10:42:44,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:42:44,415 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-11-07 10:42:44,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 10:42:44,415 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-11-07 10:42:44,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-07 10:42:44,416 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:42:44,416 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:42:44,416 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:42:44,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:42:44,417 INFO L82 PathProgramCache]: Analyzing trace with hash -659252443, now seen corresponding path program 2 times [2018-11-07 10:42:44,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:42:44,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:44,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:42:44,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:44,418 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:42:44,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:42:44,590 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:42:44,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:44,590 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:42:44,590 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:42:44,591 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:42:44,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:44,591 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 10:42:44,601 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:42:44,601 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:42:44,621 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 10:42:44,621 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:42:44,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:42:44,761 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-07 10:42:44,761 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:42:44,853 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-07 10:42:44,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:42:44,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 13 [2018-11-07 10:42:44,875 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:42:44,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 10:42:44,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 10:42:44,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2018-11-07 10:42:44,877 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 10 states. [2018-11-07 10:42:45,175 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-11-07 10:42:45,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:42:45,569 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2018-11-07 10:42:45,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 10:42:45,570 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2018-11-07 10:42:45,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:42:45,572 INFO L225 Difference]: With dead ends: 63 [2018-11-07 10:42:45,572 INFO L226 Difference]: Without dead ends: 51 [2018-11-07 10:42:45,573 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2018-11-07 10:42:45,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-07 10:42:45,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 44. [2018-11-07 10:42:45,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-07 10:42:45,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2018-11-07 10:42:45,581 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 27 [2018-11-07 10:42:45,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:42:45,581 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2018-11-07 10:42:45,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 10:42:45,581 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2018-11-07 10:42:45,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-07 10:42:45,582 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:42:45,583 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:42:45,583 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:42:45,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:42:45,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1470926709, now seen corresponding path program 3 times [2018-11-07 10:42:45,583 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:42:45,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:45,584 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:42:45,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:45,585 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:42:45,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:42:46,055 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:42:46,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:46,055 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:42:46,056 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:42:46,056 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:42:46,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:46,056 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 10:42:46,069 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:42:46,069 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:42:46,112 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:42:46,112 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:42:46,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:42:46,191 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 23 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:42:46,191 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:42:46,759 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 23 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:42:46,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:42:46,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 20 [2018-11-07 10:42:46,779 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:42:46,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 10:42:46,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 10:42:46,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=261, Unknown=0, NotChecked=0, Total=380 [2018-11-07 10:42:46,781 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 11 states. [2018-11-07 10:42:47,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:42:47,085 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2018-11-07 10:42:47,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-07 10:42:47,087 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 43 [2018-11-07 10:42:47,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:42:47,089 INFO L225 Difference]: With dead ends: 73 [2018-11-07 10:42:47,089 INFO L226 Difference]: Without dead ends: 57 [2018-11-07 10:42:47,090 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=119, Invalid=261, Unknown=0, NotChecked=0, Total=380 [2018-11-07 10:42:47,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-07 10:42:47,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-11-07 10:42:47,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-07 10:42:47,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2018-11-07 10:42:47,098 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 43 [2018-11-07 10:42:47,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:42:47,099 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2018-11-07 10:42:47,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 10:42:47,099 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-11-07 10:42:47,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-07 10:42:47,100 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:42:47,101 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 9, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:42:47,101 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:42:47,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:42:47,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1020521463, now seen corresponding path program 4 times [2018-11-07 10:42:47,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:42:47,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:47,102 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:42:47,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:47,103 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:42:47,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:42:47,378 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:42:47,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:47,379 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:42:47,379 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:42:47,379 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:42:47,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:47,379 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 10:42:47,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:42:47,391 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:42:47,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:42:47,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:42:47,486 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 68 proven. 171 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-07 10:42:47,486 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:42:47,981 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 68 proven. 171 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-07 10:42:48,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:42:48,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 13] total 25 [2018-11-07 10:42:48,003 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:42:48,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 10:42:48,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 10:42:48,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=420, Unknown=0, NotChecked=0, Total=600 [2018-11-07 10:42:48,004 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 14 states. [2018-11-07 10:42:48,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:42:48,589 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2018-11-07 10:42:48,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-07 10:42:48,590 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2018-11-07 10:42:48,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:42:48,592 INFO L225 Difference]: With dead ends: 85 [2018-11-07 10:42:48,592 INFO L226 Difference]: Without dead ends: 69 [2018-11-07 10:42:48,593 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 98 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=180, Invalid=420, Unknown=0, NotChecked=0, Total=600 [2018-11-07 10:42:48,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-07 10:42:48,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2018-11-07 10:42:48,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-07 10:42:48,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2018-11-07 10:42:48,601 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 55 [2018-11-07 10:42:48,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:42:48,602 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2018-11-07 10:42:48,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 10:42:48,602 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2018-11-07 10:42:48,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-07 10:42:48,604 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:42:48,604 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 12, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:42:48,605 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:42:48,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:42:48,605 INFO L82 PathProgramCache]: Analyzing trace with hash 732260999, now seen corresponding path program 5 times [2018-11-07 10:42:48,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:42:48,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:48,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:42:48,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:48,606 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:42:48,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:42:48,989 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:42:48,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:48,990 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:42:48,990 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:42:48,990 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:42:48,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:48,990 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 10:42:49,001 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:42:49,002 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:42:49,020 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-07 10:42:49,021 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:42:49,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:42:49,183 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 129 proven. 10 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-11-07 10:42:49,184 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:42:49,353 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 129 proven. 10 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-11-07 10:42:49,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:42:49,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 6, 6] total 25 [2018-11-07 10:42:49,375 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:42:49,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-07 10:42:49,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-07 10:42:49,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=423, Unknown=0, NotChecked=0, Total=600 [2018-11-07 10:42:49,377 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 21 states. [2018-11-07 10:42:51,332 WARN L179 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-11-07 10:42:51,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:42:51,334 INFO L93 Difference]: Finished difference Result 115 states and 128 transitions. [2018-11-07 10:42:51,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-07 10:42:51,334 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 67 [2018-11-07 10:42:51,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:42:51,337 INFO L225 Difference]: With dead ends: 115 [2018-11-07 10:42:51,337 INFO L226 Difference]: Without dead ends: 99 [2018-11-07 10:42:51,338 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=314, Invalid=616, Unknown=0, NotChecked=0, Total=930 [2018-11-07 10:42:51,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-07 10:42:51,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 88. [2018-11-07 10:42:51,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-07 10:42:51,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 91 transitions. [2018-11-07 10:42:51,348 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 91 transitions. Word has length 67 [2018-11-07 10:42:51,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:42:51,348 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 91 transitions. [2018-11-07 10:42:51,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-07 10:42:51,349 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 91 transitions. [2018-11-07 10:42:51,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-07 10:42:51,350 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:42:51,350 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 16, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:42:51,350 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:42:51,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:42:51,351 INFO L82 PathProgramCache]: Analyzing trace with hash -742753001, now seen corresponding path program 6 times [2018-11-07 10:42:51,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:42:51,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:51,352 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:42:51,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:51,352 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:42:51,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:42:51,898 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 0 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:42:51,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:51,899 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:42:51,899 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:42:51,899 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:42:51,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:51,899 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 10:42:51,910 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:42:51,911 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:42:51,960 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:42:51,960 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:42:51,965 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:42:52,473 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 184 proven. 528 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-07 10:42:52,473 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:42:53,907 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 184 proven. 528 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-07 10:42:53,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:42:53,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19, 20] total 40 [2018-11-07 10:42:53,936 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:42:53,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-07 10:42:53,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-07 10:42:53,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=438, Invalid=1122, Unknown=0, NotChecked=0, Total=1560 [2018-11-07 10:42:53,938 INFO L87 Difference]: Start difference. First operand 88 states and 91 transitions. Second operand 22 states. [2018-11-07 10:42:55,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:42:55,629 INFO L93 Difference]: Finished difference Result 125 states and 135 transitions. [2018-11-07 10:42:55,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-07 10:42:55,630 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 87 [2018-11-07 10:42:55,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:42:55,631 INFO L225 Difference]: With dead ends: 125 [2018-11-07 10:42:55,631 INFO L226 Difference]: Without dead ends: 105 [2018-11-07 10:42:55,632 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 155 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=438, Invalid=1122, Unknown=0, NotChecked=0, Total=1560 [2018-11-07 10:42:55,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-07 10:42:55,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2018-11-07 10:42:55,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-07 10:42:55,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 107 transitions. [2018-11-07 10:42:55,643 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 107 transitions. Word has length 87 [2018-11-07 10:42:55,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:42:55,643 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 107 transitions. [2018-11-07 10:42:55,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-07 10:42:55,644 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 107 transitions. [2018-11-07 10:42:55,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-07 10:42:55,645 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:42:55,645 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 23, 20, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:42:55,646 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:42:55,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:42:55,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1462524863, now seen corresponding path program 7 times [2018-11-07 10:42:55,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:42:55,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:55,647 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:42:55,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:42:55,647 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:42:55,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:42:56,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 0 proven. 1058 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:42:56,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:56,490 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:42:56,490 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:42:56,490 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:42:56,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:42:56,490 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 10:42:56,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:42:56,503 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:42:56,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:42:56,545 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:42:56,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 228 proven. 820 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-07 10:42:56,635 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:42:58,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 228 proven. 820 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-07 10:42:58,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:42:58,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23, 24] total 48 [2018-11-07 10:42:58,547 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:42:58,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-07 10:42:58,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-07 10:42:58,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2018-11-07 10:42:58,549 INFO L87 Difference]: Start difference. First operand 104 states and 107 transitions. Second operand 26 states. [2018-11-07 10:43:00,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:43:00,088 INFO L93 Difference]: Finished difference Result 141 states and 151 transitions. [2018-11-07 10:43:00,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-07 10:43:00,089 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 103 [2018-11-07 10:43:00,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:43:00,091 INFO L225 Difference]: With dead ends: 141 [2018-11-07 10:43:00,091 INFO L226 Difference]: Without dead ends: 121 [2018-11-07 10:43:00,092 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 183 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2018-11-07 10:43:00,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-11-07 10:43:00,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2018-11-07 10:43:00,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-07 10:43:00,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 123 transitions. [2018-11-07 10:43:00,103 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 123 transitions. Word has length 103 [2018-11-07 10:43:00,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:43:00,104 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 123 transitions. [2018-11-07 10:43:00,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-07 10:43:00,104 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 123 transitions. [2018-11-07 10:43:00,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-07 10:43:00,106 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:43:00,106 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 27, 24, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:43:00,107 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:43:00,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:43:00,107 INFO L82 PathProgramCache]: Analyzing trace with hash 379316839, now seen corresponding path program 8 times [2018-11-07 10:43:00,107 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:43:00,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:43:00,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:43:00,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:43:00,108 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:43:00,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:43:00,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 0 proven. 1458 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:43:00,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:43:00,784 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:43:00,784 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:43:00,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 10:43:00,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:43:00,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 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 10:43:00,796 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:43:00,796 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:43:00,818 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-07 10:43:00,818 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:43:00,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:43:01,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 356 proven. 21 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2018-11-07 10:43:01,296 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:43:01,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 356 proven. 21 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2018-11-07 10:43:01,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:43:01,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 7, 7] total 40 [2018-11-07 10:43:01,595 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:43:01,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-07 10:43:01,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-07 10:43:01,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=372, Invalid=1188, Unknown=0, NotChecked=0, Total=1560 [2018-11-07 10:43:01,598 INFO L87 Difference]: Start difference. First operand 120 states and 123 transitions. Second operand 35 states. [2018-11-07 10:43:03,297 WARN L179 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 10 [2018-11-07 10:43:05,899 WARN L179 SmtUtils]: Spent 2.31 s on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2018-11-07 10:43:14,634 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 16 [2018-11-07 10:43:15,846 WARN L179 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 18 DAG size of output: 10 [2018-11-07 10:43:17,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:43:17,862 INFO L93 Difference]: Finished difference Result 179 states and 196 transitions. [2018-11-07 10:43:17,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-07 10:43:17,928 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 119 [2018-11-07 10:43:17,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:43:17,930 INFO L225 Difference]: With dead ends: 179 [2018-11-07 10:43:17,930 INFO L226 Difference]: Without dead ends: 159 [2018-11-07 10:43:17,931 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=707, Invalid=1644, Unknown=1, NotChecked=0, Total=2352 [2018-11-07 10:43:17,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-11-07 10:43:17,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 144. [2018-11-07 10:43:17,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-11-07 10:43:17,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 148 transitions. [2018-11-07 10:43:17,946 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 148 transitions. Word has length 119 [2018-11-07 10:43:17,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:43:17,947 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 148 transitions. [2018-11-07 10:43:17,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-07 10:43:17,947 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 148 transitions. [2018-11-07 10:43:17,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-07 10:43:17,949 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:43:17,949 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 33, 29, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:43:17,950 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:43:17,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:43:17,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1811900639, now seen corresponding path program 9 times [2018-11-07 10:43:17,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:43:17,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:43:17,951 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:43:17,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:43:17,951 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:43:17,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:43:19,233 INFO L134 CoverageAnalysis]: Checked inductivity of 2178 backedges. 98 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:43:19,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:43:19,233 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:43:19,234 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:43:19,234 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:43:19,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:43:19,234 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 10:43:19,260 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:43:19,260 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:43:19,309 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:43:19,309 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:43:19,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:43:19,412 INFO L134 CoverageAnalysis]: Checked inductivity of 2178 backedges. 222 proven. 1953 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-07 10:43:19,412 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:43:24,342 INFO L134 CoverageAnalysis]: Checked inductivity of 2178 backedges. 222 proven. 1953 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-07 10:43:24,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:43:24,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 34, 35] total 69 [2018-11-07 10:43:24,363 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:43:24,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-07 10:43:24,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-07 10:43:24,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1291, Invalid=3401, Unknown=0, NotChecked=0, Total=4692 [2018-11-07 10:43:24,366 INFO L87 Difference]: Start difference. First operand 144 states and 148 transitions. Second operand 36 states. [2018-11-07 10:43:27,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:43:27,010 INFO L93 Difference]: Finished difference Result 185 states and 197 transitions. [2018-11-07 10:43:27,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-07 10:43:27,011 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 143 [2018-11-07 10:43:27,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:43:27,012 INFO L225 Difference]: With dead ends: 185 [2018-11-07 10:43:27,012 INFO L226 Difference]: Without dead ends: 161 [2018-11-07 10:43:27,014 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 252 SyntacticMatches, 3 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=1291, Invalid=3401, Unknown=0, NotChecked=0, Total=4692 [2018-11-07 10:43:27,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-11-07 10:43:27,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 160. [2018-11-07 10:43:27,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-11-07 10:43:27,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 164 transitions. [2018-11-07 10:43:27,026 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 164 transitions. Word has length 143 [2018-11-07 10:43:27,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:43:27,027 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 164 transitions. [2018-11-07 10:43:27,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-07 10:43:27,027 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 164 transitions. [2018-11-07 10:43:27,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-11-07 10:43:27,029 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:43:27,029 INFO L375 BasicCegarLoop]: trace histogram [38, 37, 37, 33, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:43:27,030 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:43:27,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:43:27,030 INFO L82 PathProgramCache]: Analyzing trace with hash 426139081, now seen corresponding path program 10 times [2018-11-07 10:43:27,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:43:27,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:43:27,031 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:43:27,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:43:27,031 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:43:27,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:43:28,223 INFO L134 CoverageAnalysis]: Checked inductivity of 2738 backedges. 110 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:43:28,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:43:28,223 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:43:28,224 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:43:28,224 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:43:28,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:43:28,224 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 10:43:28,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:43:28,234 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:43:28,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:43:28,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:43:28,575 INFO L134 CoverageAnalysis]: Checked inductivity of 2738 backedges. 506 proven. 2211 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-07 10:43:28,575 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:43:32,853 INFO L134 CoverageAnalysis]: Checked inductivity of 2738 backedges. 506 proven. 2211 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-07 10:43:32,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:43:32,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 36, 37] total 75 [2018-11-07 10:43:32,874 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:43:32,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-07 10:43:32,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-07 10:43:32,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1515, Invalid=4035, Unknown=0, NotChecked=0, Total=5550 [2018-11-07 10:43:32,876 INFO L87 Difference]: Start difference. First operand 160 states and 164 transitions. Second operand 40 states. [2018-11-07 10:43:35,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:43:35,695 INFO L93 Difference]: Finished difference Result 201 states and 213 transitions. [2018-11-07 10:43:35,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-07 10:43:35,696 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 159 [2018-11-07 10:43:35,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:43:35,698 INFO L225 Difference]: With dead ends: 201 [2018-11-07 10:43:35,698 INFO L226 Difference]: Without dead ends: 177 [2018-11-07 10:43:35,701 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 282 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=1515, Invalid=4035, Unknown=0, NotChecked=0, Total=5550 [2018-11-07 10:43:35,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-11-07 10:43:35,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 176. [2018-11-07 10:43:35,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-11-07 10:43:35,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 180 transitions. [2018-11-07 10:43:35,713 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 180 transitions. Word has length 159 [2018-11-07 10:43:35,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:43:35,714 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 180 transitions. [2018-11-07 10:43:35,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-07 10:43:35,714 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 180 transitions. [2018-11-07 10:43:35,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-07 10:43:35,716 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:43:35,717 INFO L375 BasicCegarLoop]: trace histogram [42, 41, 41, 37, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:43:35,717 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:43:35,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:43:35,717 INFO L82 PathProgramCache]: Analyzing trace with hash -2047224719, now seen corresponding path program 11 times [2018-11-07 10:43:35,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:43:35,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:43:35,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:43:35,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:43:35,719 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:43:35,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:43:37,290 INFO L134 CoverageAnalysis]: Checked inductivity of 3362 backedges. 122 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:43:37,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:43:37,291 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:43:37,291 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:43:37,291 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:43:37,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:43:37,291 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 10:43:37,303 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:43:37,304 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:43:39,578 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-07 10:43:39,578 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:43:39,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:43:40,574 INFO L134 CoverageAnalysis]: Checked inductivity of 3362 backedges. 698 proven. 36 refuted. 0 times theorem prover too weak. 2628 trivial. 0 not checked. [2018-11-07 10:43:40,575 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:43:44,334 INFO L134 CoverageAnalysis]: Checked inductivity of 3362 backedges. 698 proven. 34 refuted. 2 times theorem prover too weak. 2628 trivial. 0 not checked. [2018-11-07 10:43:44,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:43:44,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 9, 9] total 58 [2018-11-07 10:43:44,356 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:43:44,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-11-07 10:43:44,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-11-07 10:43:44,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=581, Invalid=2724, Unknown=1, NotChecked=0, Total=3306 [2018-11-07 10:43:44,359 INFO L87 Difference]: Start difference. First operand 176 states and 180 transitions. Second operand 51 states. [2018-11-07 10:44:01,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:44:01,370 INFO L93 Difference]: Finished difference Result 227 states and 243 transitions. [2018-11-07 10:44:01,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-11-07 10:44:01,371 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 175 [2018-11-07 10:44:01,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:44:01,373 INFO L225 Difference]: With dead ends: 227 [2018-11-07 10:44:01,373 INFO L226 Difference]: Without dead ends: 203 [2018-11-07 10:44:01,375 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 335 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=632, Invalid=2789, Unknown=1, NotChecked=0, Total=3422 [2018-11-07 10:44:01,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-11-07 10:44:01,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 201. [2018-11-07 10:44:01,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-11-07 10:44:01,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 203 transitions. [2018-11-07 10:44:01,387 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 203 transitions. Word has length 175 [2018-11-07 10:44:01,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:44:01,388 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 203 transitions. [2018-11-07 10:44:01,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-11-07 10:44:01,388 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 203 transitions. [2018-11-07 10:44:01,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-11-07 10:44:01,390 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:44:01,390 INFO L375 BasicCegarLoop]: trace histogram [48, 47, 47, 42, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:44:01,391 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:44:01,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:44:01,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1093808597, now seen corresponding path program 12 times [2018-11-07 10:44:01,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:44:01,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:44:01,392 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:44:01,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:44:01,392 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:44:01,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:44:03,713 INFO L134 CoverageAnalysis]: Checked inductivity of 4418 backedges. 0 proven. 4418 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:44:03,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:44:03,713 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:44:03,713 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:44:03,713 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:44:03,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:44:03,714 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 10:44:03,722 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:44:03,722 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:44:03,782 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:44:03,783 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:44:03,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:44:03,954 INFO L134 CoverageAnalysis]: Checked inductivity of 4418 backedges. 812 proven. 3570 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-07 10:44:03,954 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:44:10,465 INFO L134 CoverageAnalysis]: Checked inductivity of 4418 backedges. 812 proven. 3570 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-07 10:44:10,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:44:10,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 45, 46] total 94 [2018-11-07 10:44:10,485 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:44:10,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-11-07 10:44:10,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-11-07 10:44:10,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2298, Invalid=6444, Unknown=0, NotChecked=0, Total=8742 [2018-11-07 10:44:10,489 INFO L87 Difference]: Start difference. First operand 201 states and 203 transitions. Second operand 50 states. [2018-11-07 10:44:15,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:44:15,234 INFO L93 Difference]: Finished difference Result 255 states and 265 transitions. [2018-11-07 10:44:15,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-11-07 10:44:15,235 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 199 [2018-11-07 10:44:15,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:44:15,237 INFO L225 Difference]: With dead ends: 255 [2018-11-07 10:44:15,237 INFO L226 Difference]: Without dead ends: 226 [2018-11-07 10:44:15,241 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 353 SyntacticMatches, 2 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=2298, Invalid=6444, Unknown=0, NotChecked=0, Total=8742 [2018-11-07 10:44:15,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-11-07 10:44:15,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 225. [2018-11-07 10:44:15,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-11-07 10:44:15,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 227 transitions. [2018-11-07 10:44:15,254 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 227 transitions. Word has length 199 [2018-11-07 10:44:15,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:44:15,255 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 227 transitions. [2018-11-07 10:44:15,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-11-07 10:44:15,255 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 227 transitions. [2018-11-07 10:44:15,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-11-07 10:44:15,257 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:44:15,258 INFO L375 BasicCegarLoop]: trace histogram [54, 53, 53, 48, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:44:15,258 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:44:15,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:44:15,258 INFO L82 PathProgramCache]: Analyzing trace with hash 17397287, now seen corresponding path program 13 times [2018-11-07 10:44:15,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:44:15,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:44:15,259 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:44:15,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:44:15,259 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:44:15,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:44:17,014 INFO L134 CoverageAnalysis]: Checked inductivity of 5618 backedges. 0 proven. 5618 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:44:17,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:44:17,014 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:44:17,015 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:44:17,015 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:44:17,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:44:17,015 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 10:44:17,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:44:17,029 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:44:17,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:44:17,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:44:17,282 INFO L134 CoverageAnalysis]: Checked inductivity of 5618 backedges. 926 proven. 4656 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-07 10:44:17,282 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:44:26,225 INFO L134 CoverageAnalysis]: Checked inductivity of 5618 backedges. 926 proven. 4656 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-07 10:44:26,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:44:26,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 51, 52] total 106 [2018-11-07 10:44:26,245 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:44:26,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-11-07 10:44:26,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-11-07 10:44:26,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2910, Invalid=8220, Unknown=0, NotChecked=0, Total=11130 [2018-11-07 10:44:26,247 INFO L87 Difference]: Start difference. First operand 225 states and 227 transitions. Second operand 56 states. [2018-11-07 10:44:31,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:44:31,809 INFO L93 Difference]: Finished difference Result 279 states and 289 transitions. [2018-11-07 10:44:31,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-11-07 10:44:31,810 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 223 [2018-11-07 10:44:31,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:44:31,811 INFO L225 Difference]: With dead ends: 279 [2018-11-07 10:44:31,811 INFO L226 Difference]: Without dead ends: 250 [2018-11-07 10:44:31,812 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 395 SyntacticMatches, 2 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=2910, Invalid=8220, Unknown=0, NotChecked=0, Total=11130 [2018-11-07 10:44:31,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-11-07 10:44:31,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 249. [2018-11-07 10:44:31,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-11-07 10:44:31,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 251 transitions. [2018-11-07 10:44:31,827 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 251 transitions. Word has length 223 [2018-11-07 10:44:31,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:44:31,827 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 251 transitions. [2018-11-07 10:44:31,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-11-07 10:44:31,827 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 251 transitions. [2018-11-07 10:44:31,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-11-07 10:44:31,829 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:44:31,829 INFO L375 BasicCegarLoop]: trace histogram [60, 59, 59, 54, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:44:31,829 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:44:31,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:44:31,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1542723037, now seen corresponding path program 14 times [2018-11-07 10:44:31,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:44:31,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:44:31,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:44:31,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:44:31,831 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:44:31,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:44:34,059 INFO L134 CoverageAnalysis]: Checked inductivity of 6962 backedges. 0 proven. 6962 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:44:34,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:44:34,059 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:44:34,059 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:44:34,060 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:44:34,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:44:34,060 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 10:44:34,069 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:44:34,069 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:44:38,576 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-07 10:44:38,576 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:44:38,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:44:39,141 INFO L134 CoverageAnalysis]: Checked inductivity of 6962 backedges. 1236 proven. 55 refuted. 0 times theorem prover too weak. 5671 trivial. 0 not checked. [2018-11-07 10:44:39,141 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:44:39,750 INFO L134 CoverageAnalysis]: Checked inductivity of 6962 backedges. 1236 proven. 55 refuted. 0 times theorem prover too weak. 5671 trivial. 0 not checked. [2018-11-07 10:44:39,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:44:39,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 9, 9] total 76 [2018-11-07 10:44:39,771 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:44:39,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-11-07 10:44:39,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-11-07 10:44:39,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1017, Invalid=4683, Unknown=0, NotChecked=0, Total=5700 [2018-11-07 10:44:39,774 INFO L87 Difference]: Start difference. First operand 249 states and 251 transitions. Second operand 69 states. [2018-11-07 10:44:47,112 WARN L179 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 10 [2018-11-07 10:44:50,799 WARN L179 SmtUtils]: Spent 534.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2018-11-07 10:44:53,179 WARN L832 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 4294967294) 4294967296) 500000) (< (mod (+ c_main_~x~0 4294967291) 4294967296) 500000) (< (mod (+ c_main_~x~0 4294967292) 4294967296) 500000) (< (mod (+ c_main_~x~0 4294967293) 4294967296) 500000) (< (mod (+ c_main_~x~0 4294967290) 4294967296) 500000)) is different from false [2018-11-07 10:45:09,892 WARN L179 SmtUtils]: Spent 2.47 s on a formula simplification. DAG size of input: 18 DAG size of output: 10 [2018-11-07 10:45:17,220 WARN L832 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 4294967295) 4294967296) 500000) (< (mod (+ c_main_~x~0 4294967294) 4294967296) 500000) (< (mod (+ c_main_~x~0 4294967291) 4294967296) 500000) (< (mod (+ c_main_~x~0 4294967292) 4294967296) 500000) (< (mod (+ c_main_~x~0 4294967293) 4294967296) 500000)) is different from false [2018-11-07 10:45:17,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:45:17,223 INFO L93 Difference]: Finished difference Result 332 states and 350 transitions. [2018-11-07 10:45:17,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-11-07 10:45:17,223 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 247 [2018-11-07 10:45:17,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:45:17,225 INFO L225 Difference]: With dead ends: 332 [2018-11-07 10:45:17,225 INFO L226 Difference]: Without dead ends: 303 [2018-11-07 10:45:17,226 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 576 GetRequests, 487 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 31.7s TimeCoverageRelationStatistics Valid=1947, Invalid=5887, Unknown=6, NotChecked=350, Total=8190 [2018-11-07 10:45:17,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-11-07 10:45:17,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 280. [2018-11-07 10:45:17,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-11-07 10:45:17,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 282 transitions. [2018-11-07 10:45:17,242 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 282 transitions. Word has length 247 [2018-11-07 10:45:17,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:45:17,243 INFO L480 AbstractCegarLoop]: Abstraction has 280 states and 282 transitions. [2018-11-07 10:45:17,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-11-07 10:45:17,243 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 282 transitions. [2018-11-07 10:45:17,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-11-07 10:45:17,245 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:45:17,245 INFO L375 BasicCegarLoop]: trace histogram [68, 67, 67, 61, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:45:17,245 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:45:17,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:45:17,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1860249137, now seen corresponding path program 15 times [2018-11-07 10:45:17,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:45:17,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:45:17,247 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:45:17,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:45:17,247 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:45:17,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:45:20,165 INFO L134 CoverageAnalysis]: Checked inductivity of 8978 backedges. 200 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:45:20,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:45:20,166 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:45:20,166 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:45:20,166 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:45:20,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:45:20,166 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 10:45:20,179 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 10:45:20,179 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 10:45:20,270 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 10:45:20,270 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:45:20,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:45:20,550 INFO L134 CoverageAnalysis]: Checked inductivity of 8978 backedges. 956 proven. 8001 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-07 10:45:20,550 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:45:36,116 INFO L134 CoverageAnalysis]: Checked inductivity of 8978 backedges. 956 proven. 8001 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-07 10:45:36,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:45:36,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 66, 67] total 135 [2018-11-07 10:45:36,136 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:45:36,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-11-07 10:45:36,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-11-07 10:45:36,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4755, Invalid=13335, Unknown=0, NotChecked=0, Total=18090 [2018-11-07 10:45:36,139 INFO L87 Difference]: Start difference. First operand 280 states and 282 transitions. Second operand 70 states. [2018-11-07 10:45:44,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:45:44,478 INFO L93 Difference]: Finished difference Result 337 states and 347 transitions. [2018-11-07 10:45:44,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-11-07 10:45:44,480 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 279 [2018-11-07 10:45:44,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:45:44,482 INFO L225 Difference]: With dead ends: 337 [2018-11-07 10:45:44,482 INFO L226 Difference]: Without dead ends: 305 [2018-11-07 10:45:44,484 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 628 GetRequests, 492 SyntacticMatches, 3 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 18.2s TimeCoverageRelationStatistics Valid=4755, Invalid=13335, Unknown=0, NotChecked=0, Total=18090 [2018-11-07 10:45:44,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-11-07 10:45:44,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 304. [2018-11-07 10:45:44,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-11-07 10:45:44,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 306 transitions. [2018-11-07 10:45:44,503 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 306 transitions. Word has length 279 [2018-11-07 10:45:44,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:45:44,504 INFO L480 AbstractCegarLoop]: Abstraction has 304 states and 306 transitions. [2018-11-07 10:45:44,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-11-07 10:45:44,504 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 306 transitions. [2018-11-07 10:45:44,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-11-07 10:45:44,505 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:45:44,506 INFO L375 BasicCegarLoop]: trace histogram [74, 73, 73, 67, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:45:44,506 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:45:44,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:45:44,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1582860755, now seen corresponding path program 16 times [2018-11-07 10:45:44,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:45:44,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:45:44,507 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 10:45:44,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:45:44,507 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:45:44,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:45:47,466 INFO L134 CoverageAnalysis]: Checked inductivity of 10658 backedges. 218 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:45:47,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:45:47,466 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:45:47,466 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:45:47,467 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:45:47,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:45:47,467 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 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:45:47,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:45:47,475 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:45:47,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:45:47,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:45:47,829 INFO L134 CoverageAnalysis]: Checked inductivity of 10658 backedges. 1558 proven. 9045 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-07 10:45:47,829 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:46:05,336 INFO L134 CoverageAnalysis]: Checked inductivity of 10658 backedges. 1558 proven. 9045 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-07 10:46:05,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:46:05,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 70, 71] total 145 [2018-11-07 10:46:05,356 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:46:05,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-11-07 10:46:05,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-11-07 10:46:05,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5467, Invalid=15413, Unknown=0, NotChecked=0, Total=20880 [2018-11-07 10:46:05,359 INFO L87 Difference]: Start difference. First operand 304 states and 306 transitions. Second operand 76 states. [2018-11-07 10:46:14,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:46:14,821 INFO L93 Difference]: Finished difference Result 361 states and 371 transitions. [2018-11-07 10:46:14,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-11-07 10:46:14,822 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 303 [2018-11-07 10:46:14,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:46:14,823 INFO L225 Difference]: With dead ends: 361 [2018-11-07 10:46:14,823 INFO L226 Difference]: Without dead ends: 329 [2018-11-07 10:46:14,824 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 682 GetRequests, 536 SyntacticMatches, 3 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 20.0s TimeCoverageRelationStatistics Valid=5467, Invalid=15413, Unknown=0, NotChecked=0, Total=20880 [2018-11-07 10:46:14,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-11-07 10:46:14,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 328. [2018-11-07 10:46:14,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-11-07 10:46:14,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 330 transitions. [2018-11-07 10:46:14,847 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 330 transitions. Word has length 303 [2018-11-07 10:46:14,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:46:14,848 INFO L480 AbstractCegarLoop]: Abstraction has 328 states and 330 transitions. [2018-11-07 10:46:14,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-11-07 10:46:14,848 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 330 transitions. [2018-11-07 10:46:14,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-11-07 10:46:14,850 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:46:14,850 INFO L375 BasicCegarLoop]: trace histogram [80, 79, 79, 73, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:46:14,850 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:46:14,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:46:14,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1773965865, now seen corresponding path program 17 times [2018-11-07 10:46:14,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:46:14,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:46:14,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:46:14,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:46:14,852 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:46:14,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:46:18,353 INFO L134 CoverageAnalysis]: Checked inductivity of 12482 backedges. 236 proven. 12246 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:46:18,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:46:18,354 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:46:18,354 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 10:46:18,354 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 10:46:18,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:46:18,354 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 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:46:18,364 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 10:46:18,364 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 10:46:18,541 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-07 10:46:18,541 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 10:46:18,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:46:19,493 INFO L134 CoverageAnalysis]: Checked inductivity of 12482 backedges. 1964 proven. 78 refuted. 0 times theorem prover too weak. 10440 trivial. 0 not checked. [2018-11-07 10:46:19,493 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:46:20,338 INFO L134 CoverageAnalysis]: Checked inductivity of 12482 backedges. 1964 proven. 78 refuted. 0 times theorem prover too weak. 10440 trivial. 0 not checked. [2018-11-07 10:46:20,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:46:20,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 10, 10] total 98 [2018-11-07 10:46:20,359 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:46:20,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-11-07 10:46:20,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-11-07 10:46:20,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1581, Invalid=7925, Unknown=0, NotChecked=0, Total=9506 [2018-11-07 10:46:20,360 INFO L87 Difference]: Start difference. First operand 328 states and 330 transitions. Second operand 90 states. [2018-11-07 10:46:42,654 WARN L179 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 34 DAG size of output: 10 [2018-11-07 10:46:53,605 WARN L179 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 32 DAG size of output: 12 Received shutdown request... [2018-11-07 10:47:03,615 WARN L187 SmtUtils]: Removed 1 from assertion stack [2018-11-07 10:47:03,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-11-07 10:47:03,616 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 10:47:03,619 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 10:47:03,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:47:03 BoogieIcfgContainer [2018-11-07 10:47:03,620 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 10:47:03,620 INFO L168 Benchmark]: Toolchain (without parser) took 263295.22 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 882.4 MB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -944.8 MB). Peak memory consumption was 777.0 MB. Max. memory is 7.1 GB. [2018-11-07 10:47:03,621 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 10:47:03,622 INFO L168 Benchmark]: CACSL2BoogieTranslator took 342.30 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-07 10:47:03,623 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.96 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 10:47:03,623 INFO L168 Benchmark]: Boogie Preprocessor took 29.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 10:47:03,623 INFO L168 Benchmark]: RCFGBuilder took 353.23 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 723.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -775.3 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. [2018-11-07 10:47:03,624 INFO L168 Benchmark]: TraceAbstraction took 262536.65 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 159.4 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -180.0 MB). Peak memory consumption was 818.8 MB. Max. memory is 7.1 GB. [2018-11-07 10:47:03,628 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 342.30 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 28.96 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 29.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 353.23 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 723.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -775.3 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 262536.65 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 159.4 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -180.0 MB). Peak memory consumption was 818.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 2]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 2). Cancelled while BasicCegarLoop was constructing difference of abstraction (328states) and FLOYD_HOARE automaton (currently 84 states, 90 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 24. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. TIMEOUT Result, 262.3s OverallTime, 21 OverallIterations, 80 TraceHistogramMax, 154.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 846 SDtfs, 2711 SDslu, 33319 SDs, 0 SdLazy, 93802 SolverSat, 602 SolverUnsat, 8 SolverUnknown, 0 SolverNotchecked, 72.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5930 GetRequests, 4798 SyntacticMatches, 31 SemanticMatches, 1100 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 622 ImplicationChecksByTransitivity, 156.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=328occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 20 MinimizatonAttempts, 74 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 7.9s SatisfiabilityAnalysisTime, 96.9s InterpolantComputationTime, 5247 NumberOfCodeBlocks, 4483 NumberOfCodeBlocksAsserted, 80 NumberOfCheckSat, 7801 ConstructedInterpolants, 0 QuantifiedInterpolants, 10710123 SizeOfPredicates, 26 NumberOfNonLiveVariables, 3345 ConjunctsInSsa, 807 ConjunctsInUnsatCore, 59 InterpolantComputations, 4 PerfectInterpolantSequences, 61350/184362 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown