java -ea -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_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-new/count_by_1_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:12:53,860 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:12:53,862 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:12:53,874 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:12:53,874 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:12:53,875 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:12:53,877 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:12:53,878 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:12:53,881 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:12:53,883 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:12:53,884 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:12:53,884 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:12:53,886 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:12:53,887 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:12:53,891 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:12:53,892 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:12:53,892 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:12:53,902 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:12:53,905 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:12:53,907 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:12:53,909 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:12:53,910 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:12:53,912 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:12:53,912 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:12:53,912 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:12:53,914 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:12:53,915 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:12:53,915 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:12:53,918 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:12:53,919 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:12:53,920 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:12:53,920 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:12:53,920 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:12:53,921 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:12:53,922 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:12:53,922 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:12:53,923 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 13:12:53,939 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:12:53,939 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:12:53,940 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:12:53,940 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:12:53,941 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:12:53,941 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:12:53,941 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:12:53,941 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:12:53,942 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:12:53,942 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:12:53,942 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:12:53,942 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:12:53,942 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:12:53,943 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:12:53,943 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:12:53,943 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:12:53,943 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:12:53,943 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:12:53,944 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:12:53,944 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:12:53,944 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:12:53,944 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:12:53,944 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:12:53,945 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:12:53,945 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:12:53,945 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:12:53,945 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:12:53,946 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:12:53,946 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:12:53,946 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:12:53,946 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:12:53,992 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:12:54,005 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:12:54,010 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:12:54,011 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:12:54,012 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:12:54,012 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-new/count_by_1_true-unreach-call_true-termination.i [2018-11-23 13:12:54,080 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ffa833e5/767200e7a53144d4b5c8be4df24df900/FLAG611b27ef2 [2018-11-23 13:12:54,554 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:12:54,555 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/count_by_1_true-unreach-call_true-termination.i [2018-11-23 13:12:54,562 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ffa833e5/767200e7a53144d4b5c8be4df24df900/FLAG611b27ef2 [2018-11-23 13:12:54,917 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ffa833e5/767200e7a53144d4b5c8be4df24df900 [2018-11-23 13:12:54,930 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:12:54,932 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:12:54,933 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:12:54,933 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:12:54,937 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:12:54,938 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:12:54" (1/1) ... [2018-11-23 13:12:54,941 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a14f84f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:54, skipping insertion in model container [2018-11-23 13:12:54,941 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:12:54" (1/1) ... [2018-11-23 13:12:54,952 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:12:54,972 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:12:55,187 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:12:55,192 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:12:55,209 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:12:55,225 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:12:55,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:55 WrapperNode [2018-11-23 13:12:55,226 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:12:55,227 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:12:55,227 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:12:55,227 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:12:55,237 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:55" (1/1) ... [2018-11-23 13:12:55,243 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:55" (1/1) ... [2018-11-23 13:12:55,250 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:12:55,251 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:12:55,251 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:12:55,251 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:12:55,261 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:55" (1/1) ... [2018-11-23 13:12:55,261 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:55" (1/1) ... [2018-11-23 13:12:55,262 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:55" (1/1) ... [2018-11-23 13:12:55,262 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:55" (1/1) ... [2018-11-23 13:12:55,268 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:55" (1/1) ... [2018-11-23 13:12:55,274 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:55" (1/1) ... [2018-11-23 13:12:55,274 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:55" (1/1) ... [2018-11-23 13:12:55,276 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:12:55,276 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:12:55,276 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:12:55,277 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:12:55,277 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:55" (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-23 13:12:55,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:12:55,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:12:55,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:12:55,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:12:55,427 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:12:55,427 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:12:55,427 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:12:55,427 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:12:55,853 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:12:55,853 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 13:12:55,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:12:55 BoogieIcfgContainer [2018-11-23 13:12:55,854 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:12:55,855 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:12:55,855 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:12:55,858 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:12:55,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:12:54" (1/3) ... [2018-11-23 13:12:55,859 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a053f49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:12:55, skipping insertion in model container [2018-11-23 13:12:55,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:55" (2/3) ... [2018-11-23 13:12:55,860 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a053f49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:12:55, skipping insertion in model container [2018-11-23 13:12:55,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:12:55" (3/3) ... [2018-11-23 13:12:55,861 INFO L112 eAbstractionObserver]: Analyzing ICFG count_by_1_true-unreach-call_true-termination.i [2018-11-23 13:12:55,871 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:12:55,879 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:12:55,894 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:12:55,924 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:12:55,925 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:12:55,925 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:12:55,925 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:12:55,925 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:12:55,926 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:12:55,926 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:12:55,926 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:12:55,926 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:12:55,944 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-11-23 13:12:55,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 13:12:55,951 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:55,952 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:55,954 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:55,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:55,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1871509567, now seen corresponding path program 1 times [2018-11-23 13:12:55,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:55,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:56,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:56,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:56,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:56,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:56,121 INFO L256 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {22#true} is VALID [2018-11-23 13:12:56,124 INFO L273 TraceCheckUtils]: 1: Hoare triple {22#true} assume true; {22#true} is VALID [2018-11-23 13:12:56,125 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} #33#return; {22#true} is VALID [2018-11-23 13:12:56,125 INFO L256 TraceCheckUtils]: 3: Hoare triple {22#true} call #t~ret2 := main(); {22#true} is VALID [2018-11-23 13:12:56,125 INFO L273 TraceCheckUtils]: 4: Hoare triple {22#true} havoc ~i~0;~i~0 := 0; {22#true} is VALID [2018-11-23 13:12:56,126 INFO L273 TraceCheckUtils]: 5: Hoare triple {22#true} assume !true; {23#false} is VALID [2018-11-23 13:12:56,127 INFO L256 TraceCheckUtils]: 6: Hoare triple {23#false} call __VERIFIER_assert((if 1000000 == ~i~0 then 1 else 0)); {23#false} is VALID [2018-11-23 13:12:56,127 INFO L273 TraceCheckUtils]: 7: Hoare triple {23#false} ~cond := #in~cond; {23#false} is VALID [2018-11-23 13:12:56,127 INFO L273 TraceCheckUtils]: 8: Hoare triple {23#false} assume 0 == ~cond; {23#false} is VALID [2018-11-23 13:12:56,128 INFO L273 TraceCheckUtils]: 9: Hoare triple {23#false} assume !false; {23#false} is VALID [2018-11-23 13:12:56,131 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-23 13:12:56,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:12:56,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:12:56,139 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 13:12:56,143 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:56,146 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 13:12:56,217 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:56,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:12:56,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:12:56,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:12:56,229 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2018-11-23 13:12:56,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:56,330 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-11-23 13:12:56,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:12:56,330 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 13:12:56,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:56,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:12:56,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 34 transitions. [2018-11-23 13:12:56,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:12:56,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 34 transitions. [2018-11-23 13:12:56,345 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 34 transitions. [2018-11-23 13:12:56,580 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:56,591 INFO L225 Difference]: With dead ends: 31 [2018-11-23 13:12:56,591 INFO L226 Difference]: Without dead ends: 12 [2018-11-23 13:12:56,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:12:56,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-23 13:12:56,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-23 13:12:56,648 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:56,649 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2018-11-23 13:12:56,649 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-23 13:12:56,649 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-23 13:12:56,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:56,652 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-23 13:12:56,652 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 13:12:56,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:56,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:56,653 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-23 13:12:56,653 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-23 13:12:56,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:56,656 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-23 13:12:56,657 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 13:12:56,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:56,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:56,657 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:56,658 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:56,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:12:56,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-11-23 13:12:56,661 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-11-23 13:12:56,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:56,662 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-11-23 13:12:56,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:12:56,662 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 13:12:56,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 13:12:56,663 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:56,663 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:56,663 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:56,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:56,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1877050693, now seen corresponding path program 1 times [2018-11-23 13:12:56,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:56,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:56,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:56,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:56,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:56,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:56,773 INFO L256 TraceCheckUtils]: 0: Hoare triple {109#true} call ULTIMATE.init(); {109#true} is VALID [2018-11-23 13:12:56,773 INFO L273 TraceCheckUtils]: 1: Hoare triple {109#true} assume true; {109#true} is VALID [2018-11-23 13:12:56,774 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {109#true} {109#true} #33#return; {109#true} is VALID [2018-11-23 13:12:56,774 INFO L256 TraceCheckUtils]: 3: Hoare triple {109#true} call #t~ret2 := main(); {109#true} is VALID [2018-11-23 13:12:56,783 INFO L273 TraceCheckUtils]: 4: Hoare triple {109#true} havoc ~i~0;~i~0 := 0; {111#(<= main_~i~0 0)} is VALID [2018-11-23 13:12:56,796 INFO L273 TraceCheckUtils]: 5: Hoare triple {111#(<= main_~i~0 0)} assume !(~i~0 < 1000000); {110#false} is VALID [2018-11-23 13:12:56,796 INFO L256 TraceCheckUtils]: 6: Hoare triple {110#false} call __VERIFIER_assert((if 1000000 == ~i~0 then 1 else 0)); {110#false} is VALID [2018-11-23 13:12:56,796 INFO L273 TraceCheckUtils]: 7: Hoare triple {110#false} ~cond := #in~cond; {110#false} is VALID [2018-11-23 13:12:56,797 INFO L273 TraceCheckUtils]: 8: Hoare triple {110#false} assume 0 == ~cond; {110#false} is VALID [2018-11-23 13:12:56,797 INFO L273 TraceCheckUtils]: 9: Hoare triple {110#false} assume !false; {110#false} is VALID [2018-11-23 13:12:56,798 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-23 13:12:56,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:12:56,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:12:56,800 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 13:12:56,800 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:56,800 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 13:12:56,849 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:56,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:12:56,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:12:56,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:12:56,850 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 3 states. [2018-11-23 13:12:56,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:56,926 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-11-23 13:12:56,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:12:56,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 13:12:56,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:56,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:12:56,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2018-11-23 13:12:56,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:12:56,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2018-11-23 13:12:56,933 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 19 transitions. [2018-11-23 13:12:57,007 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:57,008 INFO L225 Difference]: With dead ends: 19 [2018-11-23 13:12:57,008 INFO L226 Difference]: Without dead ends: 14 [2018-11-23 13:12:57,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:12:57,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-23 13:12:57,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-11-23 13:12:57,020 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:57,020 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 13 states. [2018-11-23 13:12:57,021 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 13 states. [2018-11-23 13:12:57,021 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 13 states. [2018-11-23 13:12:57,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:57,022 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-23 13:12:57,022 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 13:12:57,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:57,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:57,023 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 14 states. [2018-11-23 13:12:57,023 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 14 states. [2018-11-23 13:12:57,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:57,025 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-23 13:12:57,025 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 13:12:57,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:57,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:57,026 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:57,026 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:57,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:12:57,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-11-23 13:12:57,027 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-11-23 13:12:57,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:57,028 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-11-23 13:12:57,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:12:57,028 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-23 13:12:57,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 13:12:57,029 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:57,029 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:57,029 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:57,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:57,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1175909113, now seen corresponding path program 1 times [2018-11-23 13:12:57,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:57,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:57,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:57,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:57,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:57,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:57,184 INFO L256 TraceCheckUtils]: 0: Hoare triple {192#true} call ULTIMATE.init(); {192#true} is VALID [2018-11-23 13:12:57,185 INFO L273 TraceCheckUtils]: 1: Hoare triple {192#true} assume true; {192#true} is VALID [2018-11-23 13:12:57,185 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {192#true} {192#true} #33#return; {192#true} is VALID [2018-11-23 13:12:57,185 INFO L256 TraceCheckUtils]: 3: Hoare triple {192#true} call #t~ret2 := main(); {192#true} is VALID [2018-11-23 13:12:57,201 INFO L273 TraceCheckUtils]: 4: Hoare triple {192#true} havoc ~i~0;~i~0 := 0; {194#(<= main_~i~0 0)} is VALID [2018-11-23 13:12:57,216 INFO L273 TraceCheckUtils]: 5: Hoare triple {194#(<= main_~i~0 0)} assume !!(~i~0 < 1000000); {194#(<= main_~i~0 0)} is VALID [2018-11-23 13:12:57,231 INFO L273 TraceCheckUtils]: 6: Hoare triple {194#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {195#(<= main_~i~0 1)} is VALID [2018-11-23 13:12:57,240 INFO L273 TraceCheckUtils]: 7: Hoare triple {195#(<= main_~i~0 1)} assume !(~i~0 < 1000000); {193#false} is VALID [2018-11-23 13:12:57,240 INFO L256 TraceCheckUtils]: 8: Hoare triple {193#false} call __VERIFIER_assert((if 1000000 == ~i~0 then 1 else 0)); {193#false} is VALID [2018-11-23 13:12:57,241 INFO L273 TraceCheckUtils]: 9: Hoare triple {193#false} ~cond := #in~cond; {193#false} is VALID [2018-11-23 13:12:57,241 INFO L273 TraceCheckUtils]: 10: Hoare triple {193#false} assume 0 == ~cond; {193#false} is VALID [2018-11-23 13:12:57,241 INFO L273 TraceCheckUtils]: 11: Hoare triple {193#false} assume !false; {193#false} is VALID [2018-11-23 13:12:57,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:57,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:12:57,245 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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-23 13:12:57,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:57,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:57,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:57,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:57,373 INFO L256 TraceCheckUtils]: 0: Hoare triple {192#true} call ULTIMATE.init(); {192#true} is VALID [2018-11-23 13:12:57,373 INFO L273 TraceCheckUtils]: 1: Hoare triple {192#true} assume true; {192#true} is VALID [2018-11-23 13:12:57,374 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {192#true} {192#true} #33#return; {192#true} is VALID [2018-11-23 13:12:57,374 INFO L256 TraceCheckUtils]: 3: Hoare triple {192#true} call #t~ret2 := main(); {192#true} is VALID [2018-11-23 13:12:57,377 INFO L273 TraceCheckUtils]: 4: Hoare triple {192#true} havoc ~i~0;~i~0 := 0; {194#(<= main_~i~0 0)} is VALID [2018-11-23 13:12:57,377 INFO L273 TraceCheckUtils]: 5: Hoare triple {194#(<= main_~i~0 0)} assume !!(~i~0 < 1000000); {194#(<= main_~i~0 0)} is VALID [2018-11-23 13:12:57,378 INFO L273 TraceCheckUtils]: 6: Hoare triple {194#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {195#(<= main_~i~0 1)} is VALID [2018-11-23 13:12:57,379 INFO L273 TraceCheckUtils]: 7: Hoare triple {195#(<= main_~i~0 1)} assume !(~i~0 < 1000000); {193#false} is VALID [2018-11-23 13:12:57,379 INFO L256 TraceCheckUtils]: 8: Hoare triple {193#false} call __VERIFIER_assert((if 1000000 == ~i~0 then 1 else 0)); {193#false} is VALID [2018-11-23 13:12:57,379 INFO L273 TraceCheckUtils]: 9: Hoare triple {193#false} ~cond := #in~cond; {193#false} is VALID [2018-11-23 13:12:57,380 INFO L273 TraceCheckUtils]: 10: Hoare triple {193#false} assume 0 == ~cond; {193#false} is VALID [2018-11-23 13:12:57,380 INFO L273 TraceCheckUtils]: 11: Hoare triple {193#false} assume !false; {193#false} is VALID [2018-11-23 13:12:57,381 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:57,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:12:57,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-11-23 13:12:57,403 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-23 13:12:57,404 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:57,404 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 13:12:57,430 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:57,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 13:12:57,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 13:12:57,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:12:57,431 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 4 states. [2018-11-23 13:12:57,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:57,507 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-23 13:12:57,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:12:57,507 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-23 13:12:57,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:57,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 13:12:57,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2018-11-23 13:12:57,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 13:12:57,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2018-11-23 13:12:57,513 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 21 transitions. [2018-11-23 13:12:57,673 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:57,674 INFO L225 Difference]: With dead ends: 21 [2018-11-23 13:12:57,674 INFO L226 Difference]: Without dead ends: 16 [2018-11-23 13:12:57,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:12:57,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-23 13:12:57,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-11-23 13:12:57,807 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:57,807 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 15 states. [2018-11-23 13:12:57,807 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 15 states. [2018-11-23 13:12:57,808 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 15 states. [2018-11-23 13:12:57,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:57,809 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-23 13:12:57,812 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-23 13:12:57,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:57,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:57,813 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 16 states. [2018-11-23 13:12:57,813 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 16 states. [2018-11-23 13:12:57,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:57,814 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-23 13:12:57,819 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-23 13:12:57,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:57,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:57,819 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:57,822 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:57,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:12:57,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-11-23 13:12:57,823 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-11-23 13:12:57,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:57,827 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-11-23 13:12:57,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 13:12:57,827 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 13:12:57,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 13:12:57,828 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:57,828 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:57,829 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:57,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:57,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1607619511, now seen corresponding path program 2 times [2018-11-23 13:12:57,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:57,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:57,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:57,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:57,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:57,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:58,033 INFO L256 TraceCheckUtils]: 0: Hoare triple {319#true} call ULTIMATE.init(); {319#true} is VALID [2018-11-23 13:12:58,034 INFO L273 TraceCheckUtils]: 1: Hoare triple {319#true} assume true; {319#true} is VALID [2018-11-23 13:12:58,034 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {319#true} {319#true} #33#return; {319#true} is VALID [2018-11-23 13:12:58,034 INFO L256 TraceCheckUtils]: 3: Hoare triple {319#true} call #t~ret2 := main(); {319#true} is VALID [2018-11-23 13:12:58,035 INFO L273 TraceCheckUtils]: 4: Hoare triple {319#true} havoc ~i~0;~i~0 := 0; {321#(<= main_~i~0 0)} is VALID [2018-11-23 13:12:58,036 INFO L273 TraceCheckUtils]: 5: Hoare triple {321#(<= main_~i~0 0)} assume !!(~i~0 < 1000000); {321#(<= main_~i~0 0)} is VALID [2018-11-23 13:12:58,037 INFO L273 TraceCheckUtils]: 6: Hoare triple {321#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {322#(<= main_~i~0 1)} is VALID [2018-11-23 13:12:58,040 INFO L273 TraceCheckUtils]: 7: Hoare triple {322#(<= main_~i~0 1)} assume !!(~i~0 < 1000000); {322#(<= main_~i~0 1)} is VALID [2018-11-23 13:12:58,042 INFO L273 TraceCheckUtils]: 8: Hoare triple {322#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {323#(<= main_~i~0 2)} is VALID [2018-11-23 13:12:58,051 INFO L273 TraceCheckUtils]: 9: Hoare triple {323#(<= main_~i~0 2)} assume !(~i~0 < 1000000); {320#false} is VALID [2018-11-23 13:12:58,051 INFO L256 TraceCheckUtils]: 10: Hoare triple {320#false} call __VERIFIER_assert((if 1000000 == ~i~0 then 1 else 0)); {320#false} is VALID [2018-11-23 13:12:58,051 INFO L273 TraceCheckUtils]: 11: Hoare triple {320#false} ~cond := #in~cond; {320#false} is VALID [2018-11-23 13:12:58,052 INFO L273 TraceCheckUtils]: 12: Hoare triple {320#false} assume 0 == ~cond; {320#false} is VALID [2018-11-23 13:12:58,052 INFO L273 TraceCheckUtils]: 13: Hoare triple {320#false} assume !false; {320#false} is VALID [2018-11-23 13:12:58,053 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:58,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:12:58,053 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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-23 13:12:58,063 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:12:58,072 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:12:58,072 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:12:58,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:58,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:58,150 INFO L256 TraceCheckUtils]: 0: Hoare triple {319#true} call ULTIMATE.init(); {319#true} is VALID [2018-11-23 13:12:58,151 INFO L273 TraceCheckUtils]: 1: Hoare triple {319#true} assume true; {319#true} is VALID [2018-11-23 13:12:58,151 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {319#true} {319#true} #33#return; {319#true} is VALID [2018-11-23 13:12:58,151 INFO L256 TraceCheckUtils]: 3: Hoare triple {319#true} call #t~ret2 := main(); {319#true} is VALID [2018-11-23 13:12:58,153 INFO L273 TraceCheckUtils]: 4: Hoare triple {319#true} havoc ~i~0;~i~0 := 0; {321#(<= main_~i~0 0)} is VALID [2018-11-23 13:12:58,154 INFO L273 TraceCheckUtils]: 5: Hoare triple {321#(<= main_~i~0 0)} assume !!(~i~0 < 1000000); {321#(<= main_~i~0 0)} is VALID [2018-11-23 13:12:58,155 INFO L273 TraceCheckUtils]: 6: Hoare triple {321#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {322#(<= main_~i~0 1)} is VALID [2018-11-23 13:12:58,158 INFO L273 TraceCheckUtils]: 7: Hoare triple {322#(<= main_~i~0 1)} assume !!(~i~0 < 1000000); {322#(<= main_~i~0 1)} is VALID [2018-11-23 13:12:58,158 INFO L273 TraceCheckUtils]: 8: Hoare triple {322#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {323#(<= main_~i~0 2)} is VALID [2018-11-23 13:12:58,159 INFO L273 TraceCheckUtils]: 9: Hoare triple {323#(<= main_~i~0 2)} assume !(~i~0 < 1000000); {320#false} is VALID [2018-11-23 13:12:58,159 INFO L256 TraceCheckUtils]: 10: Hoare triple {320#false} call __VERIFIER_assert((if 1000000 == ~i~0 then 1 else 0)); {320#false} is VALID [2018-11-23 13:12:58,159 INFO L273 TraceCheckUtils]: 11: Hoare triple {320#false} ~cond := #in~cond; {320#false} is VALID [2018-11-23 13:12:58,160 INFO L273 TraceCheckUtils]: 12: Hoare triple {320#false} assume 0 == ~cond; {320#false} is VALID [2018-11-23 13:12:58,160 INFO L273 TraceCheckUtils]: 13: Hoare triple {320#false} assume !false; {320#false} is VALID [2018-11-23 13:12:58,161 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:58,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:12:58,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-11-23 13:12:58,180 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-23 13:12:58,181 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:58,181 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:12:58,200 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:58,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:12:58,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:12:58,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:12:58,201 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 5 states. [2018-11-23 13:12:58,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:58,295 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-11-23 13:12:58,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:12:58,296 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-23 13:12:58,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:58,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:12:58,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2018-11-23 13:12:58,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:12:58,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2018-11-23 13:12:58,300 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 23 transitions. [2018-11-23 13:12:58,343 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:58,344 INFO L225 Difference]: With dead ends: 23 [2018-11-23 13:12:58,344 INFO L226 Difference]: Without dead ends: 18 [2018-11-23 13:12:58,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:12:58,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-23 13:12:58,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-11-23 13:12:58,357 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:58,357 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 17 states. [2018-11-23 13:12:58,358 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 17 states. [2018-11-23 13:12:58,358 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 17 states. [2018-11-23 13:12:58,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:58,360 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-23 13:12:58,361 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-23 13:12:58,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:58,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:58,361 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 18 states. [2018-11-23 13:12:58,362 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 18 states. [2018-11-23 13:12:58,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:58,363 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-23 13:12:58,364 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-23 13:12:58,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:58,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:58,364 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:58,365 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:58,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:12:58,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-11-23 13:12:58,366 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2018-11-23 13:12:58,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:58,367 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-11-23 13:12:58,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:12:58,367 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-23 13:12:58,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 13:12:58,367 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:12:58,368 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:58,368 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:12:58,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:58,368 INFO L82 PathProgramCache]: Analyzing trace with hash -130515723, now seen corresponding path program 3 times [2018-11-23 13:12:58,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:58,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:58,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:58,370 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:12:58,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:58,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:58,554 INFO L256 TraceCheckUtils]: 0: Hoare triple {463#true} call ULTIMATE.init(); {463#true} is VALID [2018-11-23 13:12:58,554 INFO L273 TraceCheckUtils]: 1: Hoare triple {463#true} assume true; {463#true} is VALID [2018-11-23 13:12:58,555 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {463#true} {463#true} #33#return; {463#true} is VALID [2018-11-23 13:12:58,555 INFO L256 TraceCheckUtils]: 3: Hoare triple {463#true} call #t~ret2 := main(); {463#true} is VALID [2018-11-23 13:12:58,555 INFO L273 TraceCheckUtils]: 4: Hoare triple {463#true} havoc ~i~0;~i~0 := 0; {465#(<= main_~i~0 0)} is VALID [2018-11-23 13:12:58,557 INFO L273 TraceCheckUtils]: 5: Hoare triple {465#(<= main_~i~0 0)} assume !!(~i~0 < 1000000); {465#(<= main_~i~0 0)} is VALID [2018-11-23 13:12:58,557 INFO L273 TraceCheckUtils]: 6: Hoare triple {465#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {466#(<= main_~i~0 1)} is VALID [2018-11-23 13:12:58,558 INFO L273 TraceCheckUtils]: 7: Hoare triple {466#(<= main_~i~0 1)} assume !!(~i~0 < 1000000); {466#(<= main_~i~0 1)} is VALID [2018-11-23 13:12:58,560 INFO L273 TraceCheckUtils]: 8: Hoare triple {466#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {467#(<= main_~i~0 2)} is VALID [2018-11-23 13:12:58,561 INFO L273 TraceCheckUtils]: 9: Hoare triple {467#(<= main_~i~0 2)} assume !!(~i~0 < 1000000); {467#(<= main_~i~0 2)} is VALID [2018-11-23 13:12:58,561 INFO L273 TraceCheckUtils]: 10: Hoare triple {467#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {468#(<= main_~i~0 3)} is VALID [2018-11-23 13:12:58,562 INFO L273 TraceCheckUtils]: 11: Hoare triple {468#(<= main_~i~0 3)} assume !(~i~0 < 1000000); {464#false} is VALID [2018-11-23 13:12:58,562 INFO L256 TraceCheckUtils]: 12: Hoare triple {464#false} call __VERIFIER_assert((if 1000000 == ~i~0 then 1 else 0)); {464#false} is VALID [2018-11-23 13:12:58,562 INFO L273 TraceCheckUtils]: 13: Hoare triple {464#false} ~cond := #in~cond; {464#false} is VALID [2018-11-23 13:12:58,563 INFO L273 TraceCheckUtils]: 14: Hoare triple {464#false} assume 0 == ~cond; {464#false} is VALID [2018-11-23 13:12:58,563 INFO L273 TraceCheckUtils]: 15: Hoare triple {464#false} assume !false; {464#false} is VALID [2018-11-23 13:12:58,564 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:58,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:12:58,565 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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-23 13:12:58,581 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:12:58,602 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 13:12:58,602 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:12:58,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:58,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:58,870 INFO L256 TraceCheckUtils]: 0: Hoare triple {463#true} call ULTIMATE.init(); {463#true} is VALID [2018-11-23 13:12:58,870 INFO L273 TraceCheckUtils]: 1: Hoare triple {463#true} assume true; {463#true} is VALID [2018-11-23 13:12:58,871 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {463#true} {463#true} #33#return; {463#true} is VALID [2018-11-23 13:12:58,871 INFO L256 TraceCheckUtils]: 3: Hoare triple {463#true} call #t~ret2 := main(); {463#true} is VALID [2018-11-23 13:12:58,871 INFO L273 TraceCheckUtils]: 4: Hoare triple {463#true} havoc ~i~0;~i~0 := 0; {463#true} is VALID [2018-11-23 13:12:58,872 INFO L273 TraceCheckUtils]: 5: Hoare triple {463#true} assume !!(~i~0 < 1000000); {463#true} is VALID [2018-11-23 13:12:58,872 INFO L273 TraceCheckUtils]: 6: Hoare triple {463#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {463#true} is VALID [2018-11-23 13:12:58,872 INFO L273 TraceCheckUtils]: 7: Hoare triple {463#true} assume !!(~i~0 < 1000000); {463#true} is VALID [2018-11-23 13:12:58,872 INFO L273 TraceCheckUtils]: 8: Hoare triple {463#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {463#true} is VALID [2018-11-23 13:12:58,873 INFO L273 TraceCheckUtils]: 9: Hoare triple {463#true} assume !!(~i~0 < 1000000); {499#(< main_~i~0 1000000)} is VALID [2018-11-23 13:12:58,874 INFO L273 TraceCheckUtils]: 10: Hoare triple {499#(< main_~i~0 1000000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {503#(<= main_~i~0 1000000)} is VALID [2018-11-23 13:12:58,874 INFO L273 TraceCheckUtils]: 11: Hoare triple {503#(<= main_~i~0 1000000)} assume !(~i~0 < 1000000); {507#(and (<= main_~i~0 1000000) (<= 1000000 main_~i~0))} is VALID [2018-11-23 13:12:58,875 INFO L256 TraceCheckUtils]: 12: Hoare triple {507#(and (<= main_~i~0 1000000) (<= 1000000 main_~i~0))} call __VERIFIER_assert((if 1000000 == ~i~0 then 1 else 0)); {511#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:12:58,876 INFO L273 TraceCheckUtils]: 13: Hoare triple {511#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {515#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:12:58,876 INFO L273 TraceCheckUtils]: 14: Hoare triple {515#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {464#false} is VALID [2018-11-23 13:12:58,877 INFO L273 TraceCheckUtils]: 15: Hoare triple {464#false} assume !false; {464#false} is VALID [2018-11-23 13:12:58,878 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 13:12:58,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:12:58,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2018-11-23 13:12:58,897 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2018-11-23 13:12:58,898 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:12:58,898 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 13:12:58,956 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:58,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 13:12:58,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 13:12:58,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:12:58,957 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 11 states. [2018-11-23 13:12:59,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:59,129 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2018-11-23 13:12:59,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 13:12:59,129 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2018-11-23 13:12:59,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:12:59,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:12:59,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 26 transitions. [2018-11-23 13:12:59,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:12:59,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 26 transitions. [2018-11-23 13:12:59,134 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 26 transitions. [2018-11-23 13:12:59,203 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:12:59,204 INFO L225 Difference]: With dead ends: 24 [2018-11-23 13:12:59,204 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 13:12:59,205 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:12:59,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 13:12:59,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 13:12:59,205 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:12:59,205 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 13:12:59,205 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:12:59,206 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:12:59,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:59,206 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:12:59,206 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:12:59,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:59,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:59,207 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:12:59,207 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:12:59,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:59,207 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:12:59,207 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:12:59,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:59,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:12:59,208 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:12:59,208 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:12:59,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 13:12:59,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 13:12:59,209 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2018-11-23 13:12:59,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:12:59,209 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:12:59,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 13:12:59,209 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:12:59,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:12:59,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 13:12:59,322 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 13:12:59,322 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:12:59,322 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:12:59,322 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 13:12:59,322 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 13:12:59,322 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 13:12:59,323 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 10 15) the Hoare annotation is: true [2018-11-23 13:12:59,323 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 10 15) no Hoare annotation was computed. [2018-11-23 13:12:59,323 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2018-11-23 13:12:59,323 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 10 15) no Hoare annotation was computed. [2018-11-23 13:12:59,323 INFO L448 ceAbstractionStarter]: For program point L12-2(line 12) no Hoare annotation was computed. [2018-11-23 13:12:59,323 INFO L444 ceAbstractionStarter]: At program point L12-3(line 12) the Hoare annotation is: (<= main_~i~0 1000000) [2018-11-23 13:12:59,323 INFO L444 ceAbstractionStarter]: At program point L12-4(line 12) the Hoare annotation is: (and (<= main_~i~0 1000000) (<= 1000000 main_~i~0)) [2018-11-23 13:12:59,323 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-23 13:12:59,324 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-23 13:12:59,324 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-23 13:12:59,324 INFO L448 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-23 13:12:59,324 INFO L448 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-23 13:12:59,324 INFO L448 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-23 13:12:59,325 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:12:59,326 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:12:59,326 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:12:59,326 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:12:59,327 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2018-11-23 13:12:59,327 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:12:59,327 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:12:59,327 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:12:59,327 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2018-11-23 13:12:59,328 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2018-11-23 13:12:59,328 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:12:59,328 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:12:59,328 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-23 13:12:59,328 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2018-11-23 13:12:59,328 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:12:59,328 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 13:12:59,329 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 13:12:59,329 INFO L163 areAnnotationChecker]: CFG has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 13:12:59,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:12:59 BoogieIcfgContainer [2018-11-23 13:12:59,337 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:12:59,337 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:12:59,337 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:12:59,337 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:12:59,338 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:12:55" (3/4) ... [2018-11-23 13:12:59,341 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 13:12:59,346 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 13:12:59,347 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 13:12:59,347 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-23 13:12:59,351 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-23 13:12:59,352 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-23 13:12:59,352 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 13:12:59,393 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loop-new/count_by_1_true-unreach-call_true-termination.i-witness.graphml [2018-11-23 13:12:59,393 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:12:59,394 INFO L168 Benchmark]: Toolchain (without parser) took 4463.73 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 730.3 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -555.3 MB). Peak memory consumption was 175.1 MB. Max. memory is 7.1 GB. [2018-11-23 13:12:59,396 INFO L168 Benchmark]: CDTParser took 0.22 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-23 13:12:59,397 INFO L168 Benchmark]: CACSL2BoogieTranslator took 293.82 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-23 13:12:59,398 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.27 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-23 13:12:59,398 INFO L168 Benchmark]: Boogie Preprocessor took 25.31 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-23 13:12:59,399 INFO L168 Benchmark]: RCFGBuilder took 577.64 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 730.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -777.9 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. [2018-11-23 13:12:59,400 INFO L168 Benchmark]: TraceAbstraction took 3482.13 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 212.1 MB). Peak memory consumption was 212.1 MB. Max. memory is 7.1 GB. [2018-11-23 13:12:59,401 INFO L168 Benchmark]: Witness Printer took 56.07 ms. Allocated memory is still 2.3 GB. Free memory is still 2.0 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:12:59,405 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 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 293.82 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.27 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 25.31 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 577.64 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 730.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -777.9 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3482.13 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 212.1 MB). Peak memory consumption was 212.1 MB. Max. memory is 7.1 GB. * Witness Printer took 56.07 ms. Allocated memory is still 2.3 GB. Free memory is still 2.0 GB. There was no memory consumed. Max. memory is 7.1 GB. * 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: 12]: Loop Invariant Derived loop invariant: i <= 1000000 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. SAFE Result, 3.4s OverallTime, 5 OverallIterations, 3 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 55 SDtfs, 14 SDslu, 79 SDs, 0 SdLazy, 53 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 12 PreInvPairs, 18 NumberOfFragments, 15 HoareAnnotationTreeSize, 12 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 16 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 104 NumberOfCodeBlocks, 102 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 96 ConstructedInterpolants, 0 QuantifiedInterpolants, 2022 SizeOfPredicates, 4 NumberOfNonLiveVariables, 81 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 8 InterpolantComputations, 3 PerfectInterpolantSequences, 9/28 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...