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-invgen/nested6_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 05:05:21,780 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 05:05:21,781 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 05:05:21,795 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 05:05:21,795 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 05:05:21,798 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 05:05:21,800 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 05:05:21,802 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 05:05:21,804 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 05:05:21,810 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 05:05:21,811 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 05:05:21,811 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 05:05:21,815 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 05:05:21,816 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 05:05:21,817 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 05:05:21,820 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 05:05:21,821 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 05:05:21,823 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 05:05:21,825 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 05:05:21,830 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 05:05:21,831 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 05:05:21,833 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 05:05:21,836 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 05:05:21,836 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 05:05:21,836 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 05:05:21,837 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 05:05:21,838 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 05:05:21,839 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 05:05:21,839 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 05:05:21,840 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 05:05:21,841 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 05:05:21,846 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 05:05:21,846 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 05:05:21,847 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 05:05:21,847 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 05:05:21,849 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 05:05:21,849 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:05:21,872 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 05:05:21,873 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 05:05:21,874 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 05:05:21,874 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 05:05:21,874 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 05:05:21,874 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 05:05:21,874 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 05:05:21,875 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 05:05:21,875 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 05:05:21,876 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 05:05:21,876 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 05:05:21,876 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 05:05:21,877 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 05:05:21,877 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 05:05:21,877 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 05:05:21,877 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 05:05:21,878 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 05:05:21,878 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 05:05:21,878 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 05:05:21,878 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 05:05:21,878 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 05:05:21,879 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 05:05:21,879 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 05:05:21,879 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 05:05:21,879 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 05:05:21,879 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 05:05:21,881 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 05:05:21,882 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 05:05:21,882 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 05:05:21,882 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 05:05:21,882 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 05:05:21,882 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 05:05:21,883 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 05:05:21,883 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 05:05:21,951 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 05:05:21,966 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 05:05:21,971 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 05:05:21,972 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 05:05:21,973 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 05:05:21,974 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/nested6_true-unreach-call_true-termination.i [2018-11-07 05:05:22,033 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8b5d043e/d07ecbc84a434f838da419bd771ca748/FLAGdc00d6b0d [2018-11-07 05:05:22,505 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 05:05:22,505 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/nested6_true-unreach-call_true-termination.i [2018-11-07 05:05:22,511 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8b5d043e/d07ecbc84a434f838da419bd771ca748/FLAGdc00d6b0d [2018-11-07 05:05:22,524 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8b5d043e/d07ecbc84a434f838da419bd771ca748 [2018-11-07 05:05:22,535 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 05:05:22,536 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 05:05:22,537 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 05:05:22,537 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 05:05:22,540 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 05:05:22,541 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:05:22" (1/1) ... [2018-11-07 05:05:22,544 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e83fd99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:05:22, skipping insertion in model container [2018-11-07 05:05:22,544 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:05:22" (1/1) ... [2018-11-07 05:05:22,553 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 05:05:22,573 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 05:05:22,806 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 05:05:22,810 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 05:05:22,836 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 05:05:22,854 INFO L193 MainTranslator]: Completed translation [2018-11-07 05:05:22,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:05:22 WrapperNode [2018-11-07 05:05:22,855 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 05:05:22,856 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 05:05:22,856 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 05:05:22,856 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 05:05:22,866 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:05:22" (1/1) ... [2018-11-07 05:05:22,872 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:05:22" (1/1) ... [2018-11-07 05:05:22,879 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 05:05:22,880 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 05:05:22,880 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 05:05:22,880 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 05:05:22,890 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:05:22" (1/1) ... [2018-11-07 05:05:22,891 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:05:22" (1/1) ... [2018-11-07 05:05:22,891 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:05:22" (1/1) ... [2018-11-07 05:05:22,892 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:05:22" (1/1) ... [2018-11-07 05:05:22,896 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:05:22" (1/1) ... [2018-11-07 05:05:22,905 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:05:22" (1/1) ... [2018-11-07 05:05:22,906 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:05:22" (1/1) ... [2018-11-07 05:05:22,909 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 05:05:22,916 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 05:05:22,916 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 05:05:22,916 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 05:05:22,917 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:05:22" (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:05:23,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 05:05:23,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 05:05:23,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 05:05:23,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 05:05:23,054 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 05:05:23,054 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 05:05:23,054 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 05:05:23,054 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 05:05:23,488 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 05:05:23,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:05:23 BoogieIcfgContainer [2018-11-07 05:05:23,490 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 05:05:23,491 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 05:05:23,491 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 05:05:23,494 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 05:05:23,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:05:22" (1/3) ... [2018-11-07 05:05:23,495 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@687d7c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:05:23, skipping insertion in model container [2018-11-07 05:05:23,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:05:22" (2/3) ... [2018-11-07 05:05:23,496 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@687d7c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:05:23, skipping insertion in model container [2018-11-07 05:05:23,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:05:23" (3/3) ... [2018-11-07 05:05:23,500 INFO L112 eAbstractionObserver]: Analyzing ICFG nested6_true-unreach-call_true-termination.i [2018-11-07 05:05:23,508 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 05:05:23,515 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 05:05:23,533 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 05:05:23,567 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 05:05:23,567 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 05:05:23,568 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 05:05:23,568 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 05:05:23,568 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 05:05:23,568 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 05:05:23,568 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 05:05:23,568 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 05:05:23,590 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-11-07 05:05:23,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-07 05:05:23,597 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:05:23,598 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:05:23,600 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:05:23,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:05:23,608 INFO L82 PathProgramCache]: Analyzing trace with hash 416534784, now seen corresponding path program 1 times [2018-11-07 05:05:23,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:05:23,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:23,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:05:23,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:23,661 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:05:23,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:05:23,829 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:05:23,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 05:05:23,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 05:05:23,832 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:05:23,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 05:05:23,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 05:05:23,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 05:05:23,851 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 5 states. [2018-11-07 05:05:24,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:05:24,032 INFO L93 Difference]: Finished difference Result 63 states and 86 transitions. [2018-11-07 05:05:24,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 05:05:24,033 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-07 05:05:24,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:05:24,042 INFO L225 Difference]: With dead ends: 63 [2018-11-07 05:05:24,043 INFO L226 Difference]: Without dead ends: 31 [2018-11-07 05:05:24,047 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-07 05:05:24,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-07 05:05:24,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-07 05:05:24,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-07 05:05:24,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-11-07 05:05:24,091 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 17 [2018-11-07 05:05:24,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:05:24,091 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-11-07 05:05:24,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 05:05:24,092 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-11-07 05:05:24,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-07 05:05:24,093 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:05:24,093 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:05:24,094 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:05:24,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:05:24,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1670630326, now seen corresponding path program 1 times [2018-11-07 05:05:24,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:05:24,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:24,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:05:24,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:24,096 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:05:24,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:05:24,285 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:05:24,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 05:05:24,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 05:05:24,286 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:05:24,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 05:05:24,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 05:05:24,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-07 05:05:24,288 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 6 states. [2018-11-07 05:05:24,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:05:24,698 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2018-11-07 05:05:24,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 05:05:24,699 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-07 05:05:24,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:05:24,700 INFO L225 Difference]: With dead ends: 44 [2018-11-07 05:05:24,700 INFO L226 Difference]: Without dead ends: 42 [2018-11-07 05:05:24,701 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-07 05:05:24,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-07 05:05:24,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 35. [2018-11-07 05:05:24,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-07 05:05:24,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2018-11-07 05:05:24,711 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 19 [2018-11-07 05:05:24,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:05:24,712 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2018-11-07 05:05:24,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 05:05:24,712 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-11-07 05:05:24,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-07 05:05:24,713 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:05:24,713 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:05:24,713 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:05:24,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:05:24,714 INFO L82 PathProgramCache]: Analyzing trace with hash 767827044, now seen corresponding path program 1 times [2018-11-07 05:05:24,714 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:05:24,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:24,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:05:24,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:24,715 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:05:24,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:05:24,923 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:05:24,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:05:24,923 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:05:24,924 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 23 with the following transitions: [2018-11-07 05:05:24,926 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [15], [19], [24], [28], [33], [53], [67], [70], [72], [75], [77], [78], [79], [80], [84], [85], [86] [2018-11-07 05:05:24,978 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 05:05:24,978 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 05:05:25,145 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 05:05:25,150 INFO L272 AbstractInterpreter]: Visited 20 different actions 24 times. Never merged. Never widened. Never found a fixpoint. Largest state had 7 variables. [2018-11-07 05:05:25,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:05:25,162 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 05:05:25,271 INFO L227 lantSequenceWeakener]: Weakened 9 states. On average, predicates are now at 54.44% of their original sizes. [2018-11-07 05:05:25,272 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 05:05:25,779 INFO L415 sIntCurrentIteration]: We unified 21 AI predicates to 21 [2018-11-07 05:05:25,779 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 05:05:25,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 05:05:25,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [7] total 16 [2018-11-07 05:05:25,780 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:05:25,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 05:05:25,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 05:05:25,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-11-07 05:05:25,782 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 11 states. [2018-11-07 05:05:27,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:05:27,478 INFO L93 Difference]: Finished difference Result 107 states and 130 transitions. [2018-11-07 05:05:27,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-07 05:05:27,478 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-11-07 05:05:27,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:05:27,481 INFO L225 Difference]: With dead ends: 107 [2018-11-07 05:05:27,481 INFO L226 Difference]: Without dead ends: 80 [2018-11-07 05:05:27,482 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2018-11-07 05:05:27,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-07 05:05:27,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 56. [2018-11-07 05:05:27,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-07 05:05:27,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2018-11-07 05:05:27,510 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 22 [2018-11-07 05:05:27,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:05:27,511 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2018-11-07 05:05:27,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 05:05:27,511 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2018-11-07 05:05:27,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-07 05:05:27,512 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:05:27,513 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:05:27,513 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:05:27,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:05:27,514 INFO L82 PathProgramCache]: Analyzing trace with hash -676333797, now seen corresponding path program 1 times [2018-11-07 05:05:27,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:05:27,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:27,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:05:27,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:27,516 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:05:27,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:05:27,677 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 05:05:27,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:05:27,678 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:05:27,678 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-11-07 05:05:27,679 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [15], [19], [24], [28], [33], [36], [40], [43], [53], [57], [67], [70], [72], [75], [77], [78], [79], [80], [84], [85], [86] [2018-11-07 05:05:27,681 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 05:05:27,681 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 05:05:27,701 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 05:05:27,702 INFO L272 AbstractInterpreter]: Visited 23 different actions 27 times. Never merged. Never widened. Never found a fixpoint. Largest state had 8 variables. [2018-11-07 05:05:27,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:05:27,708 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 05:05:27,760 INFO L227 lantSequenceWeakener]: Weakened 17 states. On average, predicates are now at 46.86% of their original sizes. [2018-11-07 05:05:27,760 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 05:05:28,095 INFO L415 sIntCurrentIteration]: We unified 27 AI predicates to 27 [2018-11-07 05:05:28,095 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 05:05:28,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 05:05:28,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [8] total 20 [2018-11-07 05:05:28,096 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:05:28,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 05:05:28,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 05:05:28,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-11-07 05:05:28,098 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand 14 states. [2018-11-07 05:05:29,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:05:29,963 INFO L93 Difference]: Finished difference Result 139 states and 173 transitions. [2018-11-07 05:05:29,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 05:05:29,965 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 28 [2018-11-07 05:05:29,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:05:29,966 INFO L225 Difference]: With dead ends: 139 [2018-11-07 05:05:29,968 INFO L226 Difference]: Without dead ends: 112 [2018-11-07 05:05:29,969 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2018-11-07 05:05:29,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-07 05:05:29,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 59. [2018-11-07 05:05:29,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-07 05:05:29,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2018-11-07 05:05:29,996 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 28 [2018-11-07 05:05:29,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:05:29,996 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2018-11-07 05:05:29,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 05:05:29,996 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2018-11-07 05:05:29,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-07 05:05:29,998 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:05:29,998 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:05:29,998 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:05:29,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:05:29,999 INFO L82 PathProgramCache]: Analyzing trace with hash 542199398, now seen corresponding path program 1 times [2018-11-07 05:05:29,999 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:05:30,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:30,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:05:30,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:30,000 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:05:30,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:05:30,124 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-07 05:05:30,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:05:30,125 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:05:30,126 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 37 with the following transitions: [2018-11-07 05:05:30,126 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [15], [19], [24], [28], [33], [36], [40], [43], [45], [48], [53], [57], [67], [70], [72], [75], [77], [78], [79], [80], [82], [83], [84], [85], [86] [2018-11-07 05:05:30,128 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 05:05:30,129 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 05:05:30,295 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 05:05:30,295 INFO L272 AbstractInterpreter]: Visited 29 different actions 313 times. Merged at 11 different actions 108 times. Widened at 3 different actions 16 times. Found 15 fixpoints after 4 different actions. Largest state had 9 variables. [2018-11-07 05:05:30,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:05:30,317 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 05:05:30,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:05:30,317 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:05:30,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:05:30,326 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:05:30,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:05:30,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:05:30,475 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 05:05:30,475 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:05:30,655 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 05:05:30,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:05:30,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 11 [2018-11-07 05:05:30,677 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:05:30,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 05:05:30,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 05:05:30,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-11-07 05:05:30,678 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand 11 states. [2018-11-07 05:05:31,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:05:31,187 INFO L93 Difference]: Finished difference Result 113 states and 133 transitions. [2018-11-07 05:05:31,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-07 05:05:31,189 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2018-11-07 05:05:31,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:05:31,193 INFO L225 Difference]: With dead ends: 113 [2018-11-07 05:05:31,194 INFO L226 Difference]: Without dead ends: 86 [2018-11-07 05:05:31,195 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2018-11-07 05:05:31,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-07 05:05:31,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 81. [2018-11-07 05:05:31,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-07 05:05:31,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 94 transitions. [2018-11-07 05:05:31,217 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 94 transitions. Word has length 36 [2018-11-07 05:05:31,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:05:31,218 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 94 transitions. [2018-11-07 05:05:31,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 05:05:31,218 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 94 transitions. [2018-11-07 05:05:31,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-07 05:05:31,220 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:05:31,220 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:05:31,221 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:05:31,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:05:31,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1487760091, now seen corresponding path program 1 times [2018-11-07 05:05:31,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:05:31,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:31,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:05:31,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:31,223 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:05:31,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:05:31,424 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-07 05:05:31,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:05:31,424 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:05:31,425 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 48 with the following transitions: [2018-11-07 05:05:31,425 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [15], [19], [24], [28], [31], [33], [36], [40], [43], [53], [57], [61], [67], [70], [72], [75], [77], [78], [79], [80], [84], [85], [86], [87] [2018-11-07 05:05:31,427 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 05:05:31,427 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 05:05:31,581 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 05:05:31,581 INFO L272 AbstractInterpreter]: Visited 27 different actions 258 times. Merged at 12 different actions 107 times. Widened at 4 different actions 17 times. Found 11 fixpoints after 3 different actions. Largest state had 9 variables. [2018-11-07 05:05:31,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:05:31,588 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 05:05:31,650 INFO L227 lantSequenceWeakener]: Weakened 20 states. On average, predicates are now at 55.5% of their original sizes. [2018-11-07 05:05:31,650 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 05:05:32,478 INFO L415 sIntCurrentIteration]: We unified 46 AI predicates to 46 [2018-11-07 05:05:32,479 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 05:05:32,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 05:05:32,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [13] total 30 [2018-11-07 05:05:32,480 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:05:32,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-07 05:05:32,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-07 05:05:32,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2018-11-07 05:05:32,481 INFO L87 Difference]: Start difference. First operand 81 states and 94 transitions. Second operand 19 states. [2018-11-07 05:05:34,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:05:34,411 INFO L93 Difference]: Finished difference Result 162 states and 199 transitions. [2018-11-07 05:05:34,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-07 05:05:34,411 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 47 [2018-11-07 05:05:34,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:05:34,414 INFO L225 Difference]: With dead ends: 162 [2018-11-07 05:05:34,414 INFO L226 Difference]: Without dead ends: 113 [2018-11-07 05:05:34,415 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 51 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2018-11-07 05:05:34,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-11-07 05:05:34,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 94. [2018-11-07 05:05:34,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-07 05:05:34,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 114 transitions. [2018-11-07 05:05:34,440 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 114 transitions. Word has length 47 [2018-11-07 05:05:34,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:05:34,440 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 114 transitions. [2018-11-07 05:05:34,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-07 05:05:34,441 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 114 transitions. [2018-11-07 05:05:34,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-07 05:05:34,443 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:05:34,443 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:05:34,443 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:05:34,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:05:34,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1746865647, now seen corresponding path program 1 times [2018-11-07 05:05:34,444 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:05:34,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:34,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:05:34,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:34,445 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:05:34,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:05:34,709 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 28 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-07 05:05:34,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:05:34,710 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:05:34,710 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 53 with the following transitions: [2018-11-07 05:05:34,710 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [15], [19], [24], [28], [31], [33], [36], [40], [43], [45], [48], [53], [57], [61], [67], [70], [72], [75], [77], [78], [79], [80], [82], [83], [84], [85], [86] [2018-11-07 05:05:34,712 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 05:05:34,712 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 05:05:34,868 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 05:05:34,869 INFO L272 AbstractInterpreter]: Visited 31 different actions 427 times. Merged at 15 different actions 163 times. Widened at 5 different actions 26 times. Found 30 fixpoints after 7 different actions. Largest state had 10 variables. [2018-11-07 05:05:34,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:05:34,902 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 05:05:34,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:05:34,902 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:05:34,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:05:34,918 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:05:34,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:05:34,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:05:35,329 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-07 05:05:35,329 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:05:35,545 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 28 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-07 05:05:35,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:05:35,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 14 [2018-11-07 05:05:35,581 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:05:35,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 05:05:35,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 05:05:35,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-11-07 05:05:35,584 INFO L87 Difference]: Start difference. First operand 94 states and 114 transitions. Second operand 12 states. [2018-11-07 05:05:36,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:05:36,662 INFO L93 Difference]: Finished difference Result 255 states and 327 transitions. [2018-11-07 05:05:36,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 05:05:36,665 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 52 [2018-11-07 05:05:36,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:05:36,668 INFO L225 Difference]: With dead ends: 255 [2018-11-07 05:05:36,668 INFO L226 Difference]: Without dead ends: 161 [2018-11-07 05:05:36,670 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 95 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2018-11-07 05:05:36,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-11-07 05:05:36,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 113. [2018-11-07 05:05:36,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-11-07 05:05:36,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 139 transitions. [2018-11-07 05:05:36,705 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 139 transitions. Word has length 52 [2018-11-07 05:05:36,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:05:36,706 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 139 transitions. [2018-11-07 05:05:36,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 05:05:36,706 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 139 transitions. [2018-11-07 05:05:36,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-07 05:05:36,710 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:05:36,710 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:05:36,710 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:05:36,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:05:36,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1720427988, now seen corresponding path program 1 times [2018-11-07 05:05:36,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:05:36,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:36,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:05:36,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:36,712 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:05:36,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:05:36,859 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 26 proven. 32 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-07 05:05:36,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:05:36,860 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:05:36,860 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 67 with the following transitions: [2018-11-07 05:05:36,860 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [15], [19], [24], [28], [31], [33], [36], [40], [43], [45], [48], [53], [57], [61], [67], [70], [72], [75], [77], [78], [79], [80], [82], [83], [84], [85], [86], [87] [2018-11-07 05:05:36,862 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 05:05:36,862 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 05:05:37,027 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 05:05:37,027 INFO L272 AbstractInterpreter]: Visited 32 different actions 425 times. Merged at 16 different actions 158 times. Widened at 5 different actions 23 times. Found 39 fixpoints after 9 different actions. Largest state had 10 variables. [2018-11-07 05:05:37,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:05:37,054 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 05:05:37,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:05:37,054 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:05:37,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:05:37,073 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 05:05:37,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:05:37,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:05:37,610 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 53 proven. 16 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-07 05:05:37,610 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:05:37,824 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 43 proven. 16 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-07 05:05:37,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 05:05:37,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2018-11-07 05:05:37,844 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 05:05:37,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-07 05:05:37,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-07 05:05:37,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2018-11-07 05:05:37,846 INFO L87 Difference]: Start difference. First operand 113 states and 139 transitions. Second operand 16 states. [2018-11-07 05:05:41,532 WARN L179 SmtUtils]: Spent 1.66 s on a formula simplification. DAG size of input: 22 DAG size of output: 20 [2018-11-07 05:05:42,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:05:42,818 INFO L93 Difference]: Finished difference Result 591 states and 784 transitions. [2018-11-07 05:05:42,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-11-07 05:05:42,819 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 66 [2018-11-07 05:05:42,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:05:42,822 INFO L225 Difference]: With dead ends: 591 [2018-11-07 05:05:42,822 INFO L226 Difference]: Without dead ends: 264 [2018-11-07 05:05:42,827 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 132 SyntacticMatches, 5 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1671 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=864, Invalid=4248, Unknown=0, NotChecked=0, Total=5112 [2018-11-07 05:05:42,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-11-07 05:05:42,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 189. [2018-11-07 05:05:42,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-11-07 05:05:42,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 240 transitions. [2018-11-07 05:05:42,910 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 240 transitions. Word has length 66 [2018-11-07 05:05:42,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:05:42,911 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 240 transitions. [2018-11-07 05:05:42,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-07 05:05:42,911 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 240 transitions. [2018-11-07 05:05:42,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-07 05:05:42,915 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 05:05:42,915 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 7, 6, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 05:05:42,916 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 05:05:42,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 05:05:42,916 INFO L82 PathProgramCache]: Analyzing trace with hash -355759697, now seen corresponding path program 2 times [2018-11-07 05:05:42,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 05:05:42,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:42,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 05:05:42,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 05:05:42,917 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 05:05:42,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 05:05:43,066 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 70 proven. 59 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2018-11-07 05:05:43,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:05:43,066 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 05:05:43,067 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 05:05:43,067 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:05:43,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 05:05:43,067 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:05:43,078 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 05:05:43,078 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 05:05:43,105 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 05:05:43,105 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 05:05:43,111 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 05:05:43,222 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2018-11-07 05:05:43,223 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 05:05:43,518 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-11-07 05:05:43,539 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 05:05:43,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [8] total 8 [2018-11-07 05:05:43,540 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 05:05:43,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 05:05:43,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 05:05:43,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-07 05:05:43,540 INFO L87 Difference]: Start difference. First operand 189 states and 240 transitions. Second operand 4 states. [2018-11-07 05:05:43,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 05:05:43,654 INFO L93 Difference]: Finished difference Result 248 states and 313 transitions. [2018-11-07 05:05:43,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 05:05:43,655 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2018-11-07 05:05:43,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 05:05:43,656 INFO L225 Difference]: With dead ends: 248 [2018-11-07 05:05:43,656 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 05:05:43,657 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 216 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-07 05:05:43,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 05:05:43,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 05:05:43,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 05:05:43,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 05:05:43,658 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 108 [2018-11-07 05:05:43,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 05:05:43,658 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 05:05:43,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 05:05:43,659 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 05:05:43,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 05:05:43,664 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 05:05:43,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 05:05:43,956 WARN L179 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 144 [2018-11-07 05:05:43,985 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 05:05:44,184 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 05:05:44,312 WARN L179 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 177 [2018-11-07 05:05:44,323 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 05:05:44,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 05:05:44,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 05:05:44,531 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 05:05:44,683 WARN L179 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 166 [2018-11-07 05:05:44,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 05:05:44,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 05:05:44,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 05:05:45,082 WARN L179 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 168 [2018-11-07 05:05:45,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 05:05:45,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 05:05:45,141 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 05:05:45,294 WARN L179 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 144 [2018-11-07 05:05:47,633 WARN L179 SmtUtils]: Spent 2.32 s on a formula simplification. DAG size of input: 138 DAG size of output: 26 [2018-11-07 05:05:53,667 WARN L179 SmtUtils]: Spent 6.01 s on a formula simplification. DAG size of input: 175 DAG size of output: 38 [2018-11-07 05:05:54,590 WARN L179 SmtUtils]: Spent 919.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 26 [2018-11-07 05:05:56,979 WARN L179 SmtUtils]: Spent 2.37 s on a formula simplification. DAG size of input: 164 DAG size of output: 26 [2018-11-07 05:05:57,282 WARN L179 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 31 [2018-11-07 05:05:57,934 WARN L179 SmtUtils]: Spent 649.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 26 [2018-11-07 05:05:57,937 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-07 05:05:57,937 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 05:05:57,938 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 05:05:57,938 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-07 05:05:57,938 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 05:05:57,938 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 05:05:57,938 INFO L421 ceAbstractionStarter]: At program point L27(line 27) the Hoare annotation is: (let ((.cse0 (and (let ((.cse1 (* 2 main_~n~0))) (and (<= .cse1 1999998) (and (<= (* 2 main_~i~0) main_~j~0) (<= main_~n~0 main_~k~0)) (<= 0 (+ .cse1 4294967296)))) (<= main_~k~0 main_~n~0)))) (or (and (<= (+ main_~j~0 1) main_~n~0) .cse0) (and .cse0 (<= main_~j~0 main_~i~0)))) [2018-11-07 05:05:57,938 INFO L421 ceAbstractionStarter]: At program point L27-1(line 27) the Hoare annotation is: (let ((.cse0 (and (let ((.cse1 (* 2 main_~n~0))) (and (<= .cse1 1999998) (and (<= (* 2 main_~i~0) main_~j~0) (<= main_~n~0 main_~k~0)) (<= 0 (+ .cse1 4294967296)))) (<= main_~k~0 main_~n~0)))) (or (and (<= (+ main_~j~0 1) main_~n~0) .cse0) (and .cse0 (<= main_~j~0 main_~i~0)))) [2018-11-07 05:05:57,938 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 10 34) no Hoare annotation was computed. [2018-11-07 05:05:57,939 INFO L421 ceAbstractionStarter]: At program point L23(line 23) the Hoare annotation is: (let ((.cse0 (and (let ((.cse1 (* 2 main_~i~0)) (.cse2 (* 2 main_~n~0))) (and (<= .cse1 main_~j~0) (<= .cse2 1999998) (<= .cse1 main_~k~0) (<= 0 (+ .cse2 4294967296)))) (<= (+ main_~k~0 1) main_~n~0)))) (or (and .cse0 (<= (+ main_~j~0 1) main_~n~0)) (and (<= main_~j~0 main_~i~0) .cse0))) [2018-11-07 05:05:57,939 INFO L425 ceAbstractionStarter]: For program point L23-1(lines 22 24) no Hoare annotation was computed. [2018-11-07 05:05:57,939 INFO L425 ceAbstractionStarter]: For program point L19-1(lines 19 31) no Hoare annotation was computed. [2018-11-07 05:05:57,939 INFO L425 ceAbstractionStarter]: For program point L19-3(lines 19 31) no Hoare annotation was computed. [2018-11-07 05:05:57,939 INFO L425 ceAbstractionStarter]: For program point L15(lines 15 18) no Hoare annotation was computed. [2018-11-07 05:05:57,939 INFO L421 ceAbstractionStarter]: At program point L19-4(lines 19 31) the Hoare annotation is: (let ((.cse6 (* 2 main_~n~0))) (let ((.cse0 (* 2 main_~i~0)) (.cse1 (<= .cse6 1999998)) (.cse2 (<= 0 (+ .cse6 4294967296))) (.cse5 (<= main_~k~0 main_~n~0)) (.cse3 (<= main_~n~0 main_~k~0)) (.cse4 (<= main_~n~0 main_~j~0))) (or (and (<= main_~k~0 (+ .cse0 1)) .cse1 .cse2 .cse3 .cse4) (and .cse1 (<= main_~j~0 main_~i~0) .cse2 .cse3 .cse4) (and .cse1 (<= main_~j~0 .cse0) .cse2 .cse3 .cse4) (and .cse3 (<= main_~n~0 (+ main_~i~0 999999)) .cse2 .cse5 (= main_~i~0 0)) (and .cse1 .cse2 .cse5 .cse3 .cse4)))) [2018-11-07 05:05:57,939 INFO L425 ceAbstractionStarter]: For program point L15-1(lines 15 18) no Hoare annotation was computed. [2018-11-07 05:05:57,939 INFO L428 ceAbstractionStarter]: At program point L32(lines 10 34) the Hoare annotation is: true [2018-11-07 05:05:57,939 INFO L425 ceAbstractionStarter]: For program point L28(lines 20 30) no Hoare annotation was computed. [2018-11-07 05:05:57,939 INFO L425 ceAbstractionStarter]: For program point L20-1(lines 20 30) no Hoare annotation was computed. [2018-11-07 05:05:57,940 INFO L421 ceAbstractionStarter]: At program point L20-3(lines 20 30) the Hoare annotation is: (let ((.cse2 (* 2 main_~i~0))) (let ((.cse0 (let ((.cse3 (* 2 main_~n~0))) (and (<= .cse3 1999998) (and (<= .cse2 main_~j~0) (<= main_~n~0 main_~k~0)) (<= 0 (+ .cse3 4294967296))))) (.cse1 (<= main_~k~0 main_~j~0))) (or (and .cse0 (<= main_~k~0 main_~n~0)) (and .cse0 (<= main_~j~0 (+ main_~i~0 1)) .cse1) (and (exists ((main_~i~0 Int) (v_main_~i~0_13 Int)) (and (<= (+ v_main_~i~0_13 1) main_~i~0) (<= (* 2 main_~i~0) main_~j~0) (<= main_~n~0 (+ (* 2 v_main_~i~0_13) 2)))) .cse0 (<= main_~j~0 .cse2)) (and (<= main_~k~0 (+ .cse2 1)) .cse0 .cse1)))) [2018-11-07 05:05:57,940 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 29) no Hoare annotation was computed. [2018-11-07 05:05:57,940 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 10 34) no Hoare annotation was computed. [2018-11-07 05:05:57,940 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 10 34) the Hoare annotation is: true [2018-11-07 05:05:57,940 INFO L425 ceAbstractionStarter]: For program point L22-1(lines 22 24) no Hoare annotation was computed. [2018-11-07 05:05:57,940 INFO L421 ceAbstractionStarter]: At program point L22-3(lines 22 24) the Hoare annotation is: (let ((.cse0 (let ((.cse1 (* 2 main_~i~0)) (.cse2 (* 2 main_~n~0))) (and (<= .cse1 main_~j~0) (<= .cse2 1999998) (<= .cse1 main_~k~0) (<= 0 (+ .cse2 4294967296)))))) (or (and .cse0 (<= main_~j~0 main_~i~0) (<= main_~k~0 main_~j~0)) (and (<= (+ main_~j~0 1) main_~n~0) (and .cse0 (<= main_~k~0 main_~n~0))))) [2018-11-07 05:05:57,941 INFO L425 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2018-11-07 05:05:57,941 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-07 05:05:57,941 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-07 05:05:57,941 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-07 05:05:57,941 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-07 05:05:57,941 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-07 05:05:57,941 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-07 05:05:57,946 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_13,QUANTIFIED] [2018-11-07 05:05:57,947 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-07 05:05:57,947 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-07 05:05:57,947 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_13,QUANTIFIED] [2018-11-07 05:05:57,952 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_13,QUANTIFIED] [2018-11-07 05:05:57,952 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-07 05:05:57,953 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-07 05:05:57,953 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_13,QUANTIFIED] [2018-11-07 05:05:57,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 05:05:57 BoogieIcfgContainer [2018-11-07 05:05:57,960 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 05:05:57,961 INFO L168 Benchmark]: Toolchain (without parser) took 35425.43 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -846.7 MB). Peak memory consumption was 837.6 MB. Max. memory is 7.1 GB. [2018-11-07 05:05:57,967 INFO L168 Benchmark]: CDTParser took 0.52 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 05:05:57,968 INFO L168 Benchmark]: CACSL2BoogieTranslator took 318.23 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:05:57,968 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.75 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:05:57,969 INFO L168 Benchmark]: Boogie Preprocessor took 29.68 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:05:57,970 INFO L168 Benchmark]: RCFGBuilder took 574.21 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 741.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -788.9 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. [2018-11-07 05:05:57,970 INFO L168 Benchmark]: TraceAbstraction took 34469.18 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 331.4 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -68.4 MB). Peak memory consumption was 874.6 MB. Max. memory is 7.1 GB. [2018-11-07 05:05:57,975 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.52 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 318.23 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.75 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 29.68 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 574.21 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 741.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -788.9 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 34469.18 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 331.4 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -68.4 MB). Peak memory consumption was 874.6 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_~i~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_13,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: 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: 20]: Loop Invariant [2018-11-07 05:05:57,990 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_13,QUANTIFIED] [2018-11-07 05:05:57,990 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-07 05:05:57,990 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-07 05:05:57,990 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_13,QUANTIFIED] [2018-11-07 05:05:57,991 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_13,QUANTIFIED] [2018-11-07 05:05:57,991 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-07 05:05:57,992 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-11-07 05:05:57,992 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_13,QUANTIFIED] Derived loop invariant: (((((2 * n <= 1999998 && 2 * i <= j && n <= k) && 0 <= 2 * n + 4294967296) && k <= n) || ((((2 * n <= 1999998 && 2 * i <= j && n <= k) && 0 <= 2 * n + 4294967296) && j <= i + 1) && k <= j)) || (((\exists main_~i~0 : int, v_main_~i~0_13 : int :: (v_main_~i~0_13 + 1 <= main_~i~0 && 2 * main_~i~0 <= j) && n <= 2 * v_main_~i~0_13 + 2) && (2 * n <= 1999998 && 2 * i <= j && n <= k) && 0 <= 2 * n + 4294967296) && j <= 2 * i)) || ((k <= 2 * i + 1 && (2 * n <= 1999998 && 2 * i <= j && n <= k) && 0 <= 2 * n + 4294967296) && k <= j) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: (((((2 * i <= j && 2 * n <= 1999998) && 2 * i <= k) && 0 <= 2 * n + 4294967296) && j <= i) && k <= j) || (j + 1 <= n && (((2 * i <= j && 2 * n <= 1999998) && 2 * i <= k) && 0 <= 2 * n + 4294967296) && k <= n) - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: (((((((k <= 2 * i + 1 && 2 * n <= 1999998) && 0 <= 2 * n + 4294967296) && n <= k) && n <= j) || ((((2 * n <= 1999998 && j <= i) && 0 <= 2 * n + 4294967296) && n <= k) && n <= j)) || ((((2 * n <= 1999998 && j <= 2 * i) && 0 <= 2 * n + 4294967296) && n <= k) && n <= j)) || ((((n <= k && n <= i + 999999) && 0 <= 2 * n + 4294967296) && k <= n) && i == 0)) || ((((2 * n <= 1999998 && 0 <= 2 * n + 4294967296) && k <= n) && n <= k) && n <= j) - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 32 locations, 1 error locations. SAFE Result, 34.3s OverallTime, 9 OverallIterations, 11 TraceHistogramMax, 12.8s AutomataDifference, 0.0s DeadEndRemovalTime, 14.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 305 SDtfs, 760 SDslu, 1160 SDs, 0 SdLazy, 1036 SolverSat, 495 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 3.8s Time, PredicateUnifierStatistics: 6 DeclaredPredicates, 767 GetRequests, 577 SyntacticMatches, 14 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 2038 ImplicationChecksByTransitivity, 7.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=189occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.0s AbstIntTime, 6 AbstIntIterations, 3 AbstIntStrong, 0.9317164809186083 AbsIntWeakeningRatio, 0.43617021276595747 AbsIntAvgWeakeningVarsNumRemoved, 7.24468085106383 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 231 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 126 PreInvPairs, 301 NumberOfFragments, 520 HoareAnnotationTreeSize, 126 FomulaSimplifications, 338607 FormulaSimplificationTreeSizeReduction, 1.6s HoareSimplificationTime, 12 FomulaSimplificationsInter, 116766 FormulaSimplificationTreeSizeReductionInter, 12.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 657 NumberOfCodeBlocks, 587 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 902 ConstructedInterpolants, 6 QuantifiedInterpolants, 123828 SizeOfPredicates, 20 NumberOfNonLiveVariables, 383 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 17 InterpolantComputations, 4 PerfectInterpolantSequences, 1324/1500 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...