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.epf -i ../../../trunk/examples/svcomp/loop-acceleration/underapprox_true-unreach-call1_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 05:03:00,871 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 05:03:00,874 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 05:03:00,889 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 05:03:00,889 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 05:03:00,891 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 05:03:00,892 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 05:03:00,895 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 05:03:00,897 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 05:03:00,898 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 05:03:00,899 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 05:03:00,899 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 05:03:00,900 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 05:03:00,901 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 05:03:00,902 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 05:03:00,903 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 05:03:00,903 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 05:03:00,905 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 05:03:00,907 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 05:03:00,909 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 05:03:00,910 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 05:03:00,911 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 05:03:00,914 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 05:03:00,914 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 05:03:00,914 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 05:03:00,915 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 05:03:00,916 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 05:03:00,917 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 05:03:00,917 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 05:03:00,919 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 05:03:00,919 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 05:03:00,920 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 05:03:00,920 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 05:03:00,920 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 05:03:00,921 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 05:03:00,922 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 05:03:00,922 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf [2018-11-07 05:03:00,939 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 05:03:00,939 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 05:03:00,940 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 05:03:00,941 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 05:03:00,941 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 05:03:00,941 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 05:03:00,941 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 05:03:00,941 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 05:03:00,942 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 05:03:00,942 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 05:03:00,942 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 05:03:00,942 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 05:03:00,943 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 05:03:00,943 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 05:03:00,943 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 05:03:00,944 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 05:03:00,944 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 05:03:00,944 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 05:03:00,944 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 05:03:00,944 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 05:03:00,945 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 05:03:00,945 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 05:03:00,945 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 05:03:00,945 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 05:03:00,945 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 05:03:00,946 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 05:03:00,946 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 05:03:00,946 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 05:03:00,946 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 05:03:00,946 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 05:03:00,947 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 05:03:00,947 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 05:03:00,947 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 05:03:00,947 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 05:03:01,019 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 05:03:01,036 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 05:03:01,041 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 05:03:01,043 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 05:03:01,043 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 05:03:01,044 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/underapprox_true-unreach-call1_true-termination.i [2018-11-07 05:03:01,111 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37d10b525/7ac54c7149ee4808baf1ae59186ea20f/FLAGe39bb8390 [2018-11-07 05:03:01,583 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 05:03:01,584 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/underapprox_true-unreach-call1_true-termination.i [2018-11-07 05:03:01,592 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37d10b525/7ac54c7149ee4808baf1ae59186ea20f/FLAGe39bb8390 [2018-11-07 05:03:01,607 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37d10b525/7ac54c7149ee4808baf1ae59186ea20f [2018-11-07 05:03:01,618 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 05:03:01,620 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 05:03:01,621 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 05:03:01,621 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 05:03:01,626 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 05:03:01,627 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:03:01" (1/1) ... [2018-11-07 05:03:01,630 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2228132a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:03:01, skipping insertion in model container [2018-11-07 05:03:01,631 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:03:01" (1/1) ... [2018-11-07 05:03:01,641 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 05:03:01,663 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 05:03:01,893 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 05:03:01,898 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 05:03:01,918 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 05:03:01,937 INFO L193 MainTranslator]: Completed translation [2018-11-07 05:03:01,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:03:01 WrapperNode [2018-11-07 05:03:01,938 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 05:03:01,939 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 05:03:01,939 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 05:03:01,939 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 05:03:01,948 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:03:01" (1/1) ... [2018-11-07 05:03:01,956 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:03:01" (1/1) ... [2018-11-07 05:03:01,962 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 05:03:01,963 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 05:03:01,963 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 05:03:01,963 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 05:03:01,973 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:03:01" (1/1) ... [2018-11-07 05:03:01,974 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:03:01" (1/1) ... [2018-11-07 05:03:01,974 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:03:01" (1/1) ... [2018-11-07 05:03:01,974 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:03:01" (1/1) ... [2018-11-07 05:03:01,984 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:03:01" (1/1) ... [2018-11-07 05:03:01,989 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:03:01" (1/1) ... [2018-11-07 05:03:01,989 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:03:01" (1/1) ... [2018-11-07 05:03:01,991 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 05:03:01,991 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 05:03:01,992 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 05:03:01,992 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 05:03:01,993 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:03:01" (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 05:03:02,114 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 05:03:02,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 05:03:02,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 05:03:02,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 05:03:02,115 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 05:03:02,115 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 05:03:02,115 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 05:03:02,116 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 05:03:02,394 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 05:03:02,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:03:02 BoogieIcfgContainer [2018-11-07 05:03:02,395 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 05:03:02,397 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 05:03:02,397 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 05:03:02,400 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 05:03:02,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:03:01" (1/3) ... [2018-11-07 05:03:02,401 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@290deb75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:03:02, skipping insertion in model container [2018-11-07 05:03:02,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:03:01" (2/3) ... [2018-11-07 05:03:02,402 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@290deb75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:03:02, skipping insertion in model container [2018-11-07 05:03:02,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:03:02" (3/3) ... [2018-11-07 05:03:02,404 INFO L112 eAbstractionObserver]: Analyzing ICFG underapprox_true-unreach-call1_true-termination.i [2018-11-07 05:03:02,412 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 05:03:02,420 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 05:03:02,432 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 05:03:02,463 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 05:03:02,464 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 05:03:02,464 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 05:03:02,464 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 05:03:02,464 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 05:03:02,464 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 05:03:02,464 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 05:03:02,464 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 05:03:02,482 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-11-07 05:03:02,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-07 05:03:02,489 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:03:02,490 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:03:02,492 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:03:02,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:03:02,498 INFO L82 PathProgramCache]: Analyzing trace with hash -10373566, now seen corresponding path program 1 times [2018-11-07 05:03:02,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:03:02,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:03:02,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:03:02,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:03:02,553 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:03:02,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:03:02,603 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 05:03:02,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 05:03:02,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 05:03:02,606 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:03:02,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 05:03:02,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 05:03:02,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 05:03:02,624 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2018-11-07 05:03:02,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:03:02,645 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-11-07 05:03:02,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 05:03:02,646 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-07 05:03:02,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:03:02,656 INFO L225 Difference]: With dead ends: 29 [2018-11-07 05:03:02,656 INFO L226 Difference]: Without dead ends: 12 [2018-11-07 05:03:02,659 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 05:03:02,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-07 05:03:02,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-07 05:03:02,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-07 05:03:02,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-11-07 05:03:02,694 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-11-07 05:03:02,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:03:02,695 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-11-07 05:03:02,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 05:03:02,695 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-07 05:03:02,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-07 05:03:02,696 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:03:02,696 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:03:02,697 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:03:02,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:03:02,697 INFO L82 PathProgramCache]: Analyzing trace with hash -571410792, now seen corresponding path program 1 times [2018-11-07 05:03:02,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:03:02,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:03:02,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:03:02,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:03:02,700 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:03:02,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:03:02,951 WARN L179 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 5 [2018-11-07 05:03:02,953 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 05:03:02,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 05:03:02,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 05:03:02,953 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:03:02,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 05:03:02,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 05:03:02,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 05:03:02,957 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 3 states. [2018-11-07 05:03:03,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:03:03,013 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-11-07 05:03:03,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 05:03:03,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-07 05:03:03,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:03:03,016 INFO L225 Difference]: With dead ends: 19 [2018-11-07 05:03:03,016 INFO L226 Difference]: Without dead ends: 14 [2018-11-07 05:03:03,018 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 05:03:03,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-07 05:03:03,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-07 05:03:03,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-07 05:03:03,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-11-07 05:03:03,025 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2018-11-07 05:03:03,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:03:03,026 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-11-07 05:03:03,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 05:03:03,026 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-07 05:03:03,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-07 05:03:03,027 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:03:03,027 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:03:03,031 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:03:03,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:03:03,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1625028318, now seen corresponding path program 1 times [2018-11-07 05:03:03,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:03:03,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:03:03,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:03:03,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:03:03,033 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:03:03,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:03:03,166 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 05:03:03,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:03:03,167 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:03:03,169 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2018-11-07 05:03:03,171 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [14], [20], [23], [25], [31], [32], [33], [35] [2018-11-07 05:03:03,222 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 05:03:03,222 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 05:03:03,341 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 05:03:03,770 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 05:03:03,772 INFO L272 AbstractInterpreter]: Visited 12 different actions 81 times. Merged at 3 different actions 31 times. Widened at 1 different actions 7 times. Found 1 fixpoints after 1 different actions. Largest state had 3 variables. [2018-11-07 05:03:03,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:03:03,822 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 05:03:03,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:03:03,823 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 05:03:03,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:03:03,843 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:03:03,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:03:03,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:03:03,916 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 05:03:03,917 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:03:04,039 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 05:03:04,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:03:04,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-11-07 05:03:04,071 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:03:04,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 05:03:04,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 05:03:04,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-07 05:03:04,073 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 4 states. [2018-11-07 05:03:04,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:03:04,103 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-07 05:03:04,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 05:03:04,103 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-11-07 05:03:04,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:03:04,104 INFO L225 Difference]: With dead ends: 21 [2018-11-07 05:03:04,104 INFO L226 Difference]: Without dead ends: 16 [2018-11-07 05:03:04,105 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-07 05:03:04,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-07 05:03:04,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-07 05:03:04,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-07 05:03:04,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-11-07 05:03:04,109 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2018-11-07 05:03:04,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:03:04,110 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-11-07 05:03:04,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 05:03:04,110 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-07 05:03:04,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-07 05:03:04,111 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:03:04,111 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:03:04,111 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:03:04,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:03:04,112 INFO L82 PathProgramCache]: Analyzing trace with hash -720896604, now seen corresponding path program 2 times [2018-11-07 05:03:04,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:03:04,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:03:04,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:03:04,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:03:04,113 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:03:04,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:03:04,286 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:03:04,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:03:04,287 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:03:04,287 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:03:04,287 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:03:04,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:03:04,288 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 05:03:04,298 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:03:04,298 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:03:04,323 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 05:03:04,323 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:03:04,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:03:04,396 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:03:04,396 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:03:04,634 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:03:04,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:03:04,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2018-11-07 05:03:04,662 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:03:04,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 05:03:04,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 05:03:04,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-07 05:03:04,664 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 5 states. [2018-11-07 05:03:04,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:03:04,705 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-11-07 05:03:04,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 05:03:04,706 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-07 05:03:04,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:03:04,707 INFO L225 Difference]: With dead ends: 23 [2018-11-07 05:03:04,707 INFO L226 Difference]: Without dead ends: 18 [2018-11-07 05:03:04,708 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-07 05:03:04,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-07 05:03:04,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-07 05:03:04,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-07 05:03:04,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-11-07 05:03:04,713 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2018-11-07 05:03:04,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:03:04,713 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-11-07 05:03:04,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 05:03:04,714 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-07 05:03:04,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-07 05:03:04,714 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:03:04,715 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:03:04,715 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:03:04,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:03:04,715 INFO L82 PathProgramCache]: Analyzing trace with hash -296916246, now seen corresponding path program 3 times [2018-11-07 05:03:04,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:03:04,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:03:04,717 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:03:04,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:03:04,717 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:03:04,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:03:04,835 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:03:04,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:03:04,836 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:03:04,836 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:03:04,836 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:03:04,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:03:04,837 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 05:03:04,848 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:03:04,848 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:03:04,861 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:03:04,861 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:03:04,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:03:04,896 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:03:04,897 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:03:05,082 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:03:05,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:03:05,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2018-11-07 05:03:05,103 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:03:05,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 05:03:05,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 05:03:05,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-11-07 05:03:05,104 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 6 states. [2018-11-07 05:03:05,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:03:05,150 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-11-07 05:03:05,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 05:03:05,151 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-07 05:03:05,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:03:05,152 INFO L225 Difference]: With dead ends: 25 [2018-11-07 05:03:05,152 INFO L226 Difference]: Without dead ends: 20 [2018-11-07 05:03:05,153 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-11-07 05:03:05,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-07 05:03:05,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-07 05:03:05,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-07 05:03:05,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-11-07 05:03:05,158 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 17 [2018-11-07 05:03:05,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:03:05,158 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-11-07 05:03:05,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 05:03:05,158 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-07 05:03:05,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-07 05:03:05,159 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:03:05,159 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:03:05,160 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:03:05,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:03:05,160 INFO L82 PathProgramCache]: Analyzing trace with hash -873685328, now seen corresponding path program 4 times [2018-11-07 05:03:05,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:03:05,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:03:05,161 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:03:05,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:03:05,162 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:03:05,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:03:05,374 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:03:05,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:03:05,374 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:03:05,375 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:03:05,375 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:03:05,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:03:05,375 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 05:03:05,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:03:05,391 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:03:05,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:03:05,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:03:05,424 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:03:05,424 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:03:05,647 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:03:05,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:03:05,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2018-11-07 05:03:05,667 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:03:05,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 05:03:05,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 05:03:05,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-11-07 05:03:05,668 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 7 states. [2018-11-07 05:03:05,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:03:05,713 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-11-07 05:03:05,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 05:03:05,713 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-11-07 05:03:05,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:03:05,714 INFO L225 Difference]: With dead ends: 27 [2018-11-07 05:03:05,715 INFO L226 Difference]: Without dead ends: 22 [2018-11-07 05:03:05,716 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-11-07 05:03:05,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-07 05:03:05,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-07 05:03:05,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-07 05:03:05,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-11-07 05:03:05,721 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 19 [2018-11-07 05:03:05,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:03:05,721 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-11-07 05:03:05,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 05:03:05,722 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-07 05:03:05,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-07 05:03:05,722 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:03:05,723 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:03:05,723 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:03:05,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:03:05,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1097991946, now seen corresponding path program 5 times [2018-11-07 05:03:05,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:03:05,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:03:05,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:03:05,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:03:05,725 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:03:05,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:03:06,173 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:03:06,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:03:06,174 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:03:06,174 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:03:06,174 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:03:06,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:03:06,174 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 05:03:06,183 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:03:06,183 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:03:06,217 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-07 05:03:06,217 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:03:06,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:03:06,250 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:03:06,250 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:03:06,392 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:03:06,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:03:06,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2018-11-07 05:03:06,413 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:03:06,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 05:03:06,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 05:03:06,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-11-07 05:03:06,414 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 8 states. [2018-11-07 05:03:06,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:03:06,563 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-11-07 05:03:06,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 05:03:06,565 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-11-07 05:03:06,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:03:06,566 INFO L225 Difference]: With dead ends: 29 [2018-11-07 05:03:06,566 INFO L226 Difference]: Without dead ends: 24 [2018-11-07 05:03:06,567 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-11-07 05:03:06,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-07 05:03:06,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-07 05:03:06,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-07 05:03:06,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-11-07 05:03:06,571 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 21 [2018-11-07 05:03:06,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:03:06,572 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-11-07 05:03:06,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 05:03:06,572 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-07 05:03:06,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-07 05:03:06,573 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:03:06,573 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:03:06,573 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:03:06,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:03:06,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1908287044, now seen corresponding path program 6 times [2018-11-07 05:03:06,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:03:06,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:03:06,575 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:03:06,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:03:06,575 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:03:06,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:03:14,167 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 38 refuted. 4 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:03:14,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:03:14,168 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:03:14,168 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:03:14,168 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:03:14,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:03:14,168 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 05:03:14,181 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 05:03:14,181 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 05:03:14,198 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 05:03:14,199 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:03:14,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:03:15,220 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:03:15,221 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:04:07,893 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 28 refuted. 14 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:04:07,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:04:07,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 26 [2018-11-07 05:04:07,928 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:04:07,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-07 05:04:07,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-07 05:04:07,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=498, Unknown=23, NotChecked=0, Total=650 [2018-11-07 05:04:07,929 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 19 states. [2018-11-07 05:04:08,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:04:08,137 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-11-07 05:04:08,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-07 05:04:08,142 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 23 [2018-11-07 05:04:08,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:04:08,143 INFO L225 Difference]: With dead ends: 31 [2018-11-07 05:04:08,143 INFO L226 Difference]: Without dead ends: 26 [2018-11-07 05:04:08,144 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 61.1s TimeCoverageRelationStatistics Valid=135, Invalid=544, Unknown=23, NotChecked=0, Total=702 [2018-11-07 05:04:08,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-07 05:04:08,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-07 05:04:08,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-07 05:04:08,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-11-07 05:04:08,149 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 23 [2018-11-07 05:04:08,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:04:08,150 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-11-07 05:04:08,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-07 05:04:08,150 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-07 05:04:08,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-07 05:04:08,151 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:04:08,151 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:04:08,151 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:04:08,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:04:08,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1082171650, now seen corresponding path program 7 times [2018-11-07 05:04:08,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:04:08,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:08,153 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 05:04:08,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:04:08,153 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:04:08,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:04:08,532 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 14 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:04:08,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:04:08,533 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:04:08,533 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:04:08,534 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 05:04:08,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:04:08,534 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 05:04:08,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:04:08,543 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:04:08,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:04:08,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:04:08,567 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 14 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:04:08,568 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:04:08,706 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 14 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:04:08,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:04:08,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2018-11-07 05:04:08,727 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:04:08,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 05:04:08,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 05:04:08,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-11-07 05:04:08,729 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 9 states. [2018-11-07 05:04:08,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:04:08,804 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-11-07 05:04:08,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 05:04:08,806 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-11-07 05:04:08,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:04:08,806 INFO L225 Difference]: With dead ends: 26 [2018-11-07 05:04:08,806 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 05:04:08,807 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-11-07 05:04:08,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 05:04:08,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 05:04:08,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 05:04:08,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 05:04:08,808 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2018-11-07 05:04:08,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:04:08,809 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 05:04:08,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 05:04:08,809 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 05:04:08,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 05:04:08,814 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 05:04:08,938 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-07 05:04:08,939 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 05:04:08,939 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 05:04:08,939 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-07 05:04:08,939 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 05:04:08,939 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 05:04:08,939 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 8 16) the Hoare annotation is: true [2018-11-07 05:04:08,939 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 8 16) no Hoare annotation was computed. [2018-11-07 05:04:08,939 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 8 16) no Hoare annotation was computed. [2018-11-07 05:04:08,940 INFO L425 ceAbstractionStarter]: For program point L11-1(lines 11 14) no Hoare annotation was computed. [2018-11-07 05:04:08,940 INFO L421 ceAbstractionStarter]: At program point L11-3(lines 11 14) the Hoare annotation is: (or (and (<= main_~x~0 1) (exists ((v_main_~y~0_26 Int)) (and (<= 1 v_main_~y~0_26) (= (* 2 v_main_~y~0_26) main_~y~0) (<= v_main_~y~0_26 1))) (<= 1 main_~x~0)) (and (<= main_~x~0 6) (exists ((v_main_~y~0_26 Int)) (and (<= 1 v_main_~y~0_26) (= main_~y~0 (* 64 v_main_~y~0_26)) (<= v_main_~y~0_26 1))) (<= 6 main_~x~0)) (and (exists ((v_main_~y~0_26 Int)) (and (<= 1 v_main_~y~0_26) (= (* 16 v_main_~y~0_26) main_~y~0) (<= v_main_~y~0_26 1))) (<= 4 main_~x~0) (<= main_~x~0 4)) (and (<= 1 main_~y~0) (<= main_~x~0 0) (<= main_~y~0 1) (<= 0 main_~x~0)) (and (<= main_~x~0 3) (exists ((v_main_~y~0_26 Int)) (and (<= 1 v_main_~y~0_26) (= main_~y~0 (* 8 v_main_~y~0_26)) (<= v_main_~y~0_26 1))) (<= 3 main_~x~0)) (and (<= 5 main_~x~0) (exists ((v_main_~y~0_26 Int)) (and (= main_~y~0 (* 32 v_main_~y~0_26)) (<= 1 v_main_~y~0_26) (<= v_main_~y~0_26 1))) (<= main_~x~0 5)) (and (exists ((v_main_~y~0_26 Int)) (and (<= 1 v_main_~y~0_26) (= main_~y~0 (* 4 v_main_~y~0_26)) (<= v_main_~y~0_26 1))) (<= 2 main_~x~0) (<= main_~x~0 2))) [2018-11-07 05:04:08,940 INFO L421 ceAbstractionStarter]: At program point L11-4(lines 11 14) the Hoare annotation is: (exists ((v_main_~y~0_26 Int)) (and (<= 1 v_main_~y~0_26) (= main_~y~0 (* 64 v_main_~y~0_26)) (<= v_main_~y~0_26 1))) [2018-11-07 05:04:08,940 INFO L425 ceAbstractionStarter]: For program point L3-2(lines 2 7) no Hoare annotation was computed. [2018-11-07 05:04:08,940 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 2 7) the Hoare annotation is: true [2018-11-07 05:04:08,940 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2018-11-07 05:04:08,941 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 2 7) no Hoare annotation was computed. [2018-11-07 05:04:08,941 INFO L425 ceAbstractionStarter]: For program point L4(line 4) no Hoare annotation was computed. [2018-11-07 05:04:08,941 INFO L425 ceAbstractionStarter]: For program point L3(lines 3 5) no Hoare annotation was computed. [2018-11-07 05:04:08,947 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-11-07 05:04:08,948 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-11-07 05:04:08,949 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-11-07 05:04:08,949 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-11-07 05:04:08,949 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-11-07 05:04:08,949 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-11-07 05:04:08,950 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-11-07 05:04:08,950 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-11-07 05:04:08,950 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-11-07 05:04:08,950 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-11-07 05:04:08,950 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-11-07 05:04:08,951 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-11-07 05:04:08,951 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-11-07 05:04:08,951 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-11-07 05:04:08,951 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-11-07 05:04:08,952 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-11-07 05:04:08,952 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-11-07 05:04:08,952 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-11-07 05:04:08,961 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-11-07 05:04:08,961 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-11-07 05:04:08,961 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-11-07 05:04:08,962 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-11-07 05:04:08,962 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-11-07 05:04:08,962 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-11-07 05:04:08,963 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-11-07 05:04:08,963 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-11-07 05:04:08,963 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-11-07 05:04:08,963 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-11-07 05:04:08,964 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-11-07 05:04:08,964 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-11-07 05:04:08,964 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-11-07 05:04:08,965 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-11-07 05:04:08,965 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-11-07 05:04:08,965 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-11-07 05:04:08,965 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-11-07 05:04:08,966 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-11-07 05:04:08,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 05:04:08 BoogieIcfgContainer [2018-11-07 05:04:08,969 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 05:04:08,970 INFO L168 Benchmark]: Toolchain (without parser) took 67350.90 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 677.4 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -301.0 MB). Peak memory consumption was 376.4 MB. Max. memory is 7.1 GB. [2018-11-07 05:04:08,971 INFO L168 Benchmark]: CDTParser took 0.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 05:04:08,972 INFO L168 Benchmark]: CACSL2BoogieTranslator took 316.96 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 05:04:08,973 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.81 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 05:04:08,973 INFO L168 Benchmark]: Boogie Preprocessor took 28.37 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 05:04:08,974 INFO L168 Benchmark]: RCFGBuilder took 403.41 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 677.4 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -726.8 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2018-11-07 05:04:08,975 INFO L168 Benchmark]: TraceAbstraction took 66572.20 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.7 GB in the end (delta: 415.2 MB). Peak memory consumption was 415.2 MB. Max. memory is 7.1 GB. [2018-11-07 05:04:08,984 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.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. * CACSL2BoogieTranslator took 316.96 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 23.81 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 28.37 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 403.41 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 677.4 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -726.8 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 66572.20 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.7 GB in the end (delta: 415.2 MB). Peak memory consumption was 415.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 11]: Loop Invariant [2018-11-07 05:04:09,007 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-11-07 05:04:09,007 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-11-07 05:04:09,007 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-11-07 05:04:09,007 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-11-07 05:04:09,008 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-11-07 05:04:09,008 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-11-07 05:04:09,008 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-11-07 05:04:09,008 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-11-07 05:04:09,011 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-11-07 05:04:09,011 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-11-07 05:04:09,011 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-11-07 05:04:09,012 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-11-07 05:04:09,012 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-11-07 05:04:09,012 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-11-07 05:04:09,012 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-11-07 05:04:09,013 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-11-07 05:04:09,013 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-11-07 05:04:09,013 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-11-07 05:04:09,014 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-11-07 05:04:09,014 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-11-07 05:04:09,014 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-11-07 05:04:09,015 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-11-07 05:04:09,015 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-11-07 05:04:09,015 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-11-07 05:04:09,015 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-11-07 05:04:09,015 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-11-07 05:04:09,019 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-11-07 05:04:09,019 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-11-07 05:04:09,019 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-11-07 05:04:09,020 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-11-07 05:04:09,020 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-11-07 05:04:09,020 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-11-07 05:04:09,020 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-11-07 05:04:09,020 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-11-07 05:04:09,022 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] [2018-11-07 05:04:09,022 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_26,QUANTIFIED] Derived loop invariant: (((((((x <= 1 && (\exists v_main_~y~0_26 : int :: (1 <= v_main_~y~0_26 && 2 * v_main_~y~0_26 == y) && v_main_~y~0_26 <= 1)) && 1 <= x) || ((x <= 6 && (\exists v_main_~y~0_26 : int :: (1 <= v_main_~y~0_26 && y == 64 * v_main_~y~0_26) && v_main_~y~0_26 <= 1)) && 6 <= x)) || (((\exists v_main_~y~0_26 : int :: (1 <= v_main_~y~0_26 && 16 * v_main_~y~0_26 == y) && v_main_~y~0_26 <= 1) && 4 <= x) && x <= 4)) || (((1 <= y && x <= 0) && y <= 1) && 0 <= x)) || ((x <= 3 && (\exists v_main_~y~0_26 : int :: (1 <= v_main_~y~0_26 && y == 8 * v_main_~y~0_26) && v_main_~y~0_26 <= 1)) && 3 <= x)) || ((5 <= x && (\exists v_main_~y~0_26 : int :: (y == 32 * v_main_~y~0_26 && 1 <= v_main_~y~0_26) && v_main_~y~0_26 <= 1)) && x <= 5)) || (((\exists v_main_~y~0_26 : int :: (1 <= v_main_~y~0_26 && y == 4 * v_main_~y~0_26) && v_main_~y~0_26 <= 1) && 2 <= x) && x <= 2) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 18 locations, 1 error locations. SAFE Result, 66.4s OverallTime, 9 OverallIterations, 8 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 127 SDtfs, 2 SDslu, 465 SDs, 0 SdLazy, 279 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 315 GetRequests, 227 SyntacticMatches, 8 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 63.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.6s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 15 PreInvPairs, 23 NumberOfFragments, 152 HoareAnnotationTreeSize, 15 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 64.1s InterpolantComputationTime, 287 NumberOfCodeBlocks, 287 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 397 ConstructedInterpolants, 15 QuantifiedInterpolants, 38623 SizeOfPredicates, 7 NumberOfNonLiveVariables, 343 ConjunctsInSsa, 80 ConjunctsInUnsatCore, 23 InterpolantComputations, 2 PerfectInterpolantSequences, 42/504 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...