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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf -i ../../../trunk/examples/svcomp/loop-lit/gsv2008_true-unreach-call.c.i.p+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 19:22:49,876 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 19:22:49,878 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 19:22:49,890 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 19:22:49,891 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 19:22:49,892 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 19:22:49,893 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 19:22:49,895 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 19:22:49,897 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 19:22:49,898 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 19:22:49,899 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 19:22:49,899 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 19:22:49,900 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 19:22:49,901 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 19:22:49,902 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 19:22:49,903 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 19:22:49,905 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 19:22:49,910 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 19:22:49,915 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 19:22:49,917 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 19:22:49,918 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 19:22:49,923 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 19:22:49,928 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 19:22:49,929 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 19:22:49,929 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 19:22:49,931 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 19:22:49,932 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 19:22:49,936 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 19:22:49,937 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 19:22:49,940 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 19:22:49,940 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 19:22:49,942 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 19:22:49,942 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 19:22:49,942 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 19:22:49,943 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 19:22:49,945 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 19:22:49,946 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf [2018-11-14 19:22:49,972 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 19:22:49,972 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 19:22:49,973 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 19:22:49,973 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 19:22:49,974 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 19:22:49,974 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 19:22:49,974 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 19:22:49,975 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 19:22:49,975 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 19:22:49,975 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 19:22:49,975 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 19:22:49,975 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 19:22:49,976 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 19:22:49,976 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 19:22:49,976 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 19:22:49,976 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 19:22:49,976 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 19:22:49,978 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 19:22:49,978 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 19:22:49,978 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 19:22:49,978 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 19:22:49,978 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 19:22:49,979 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 19:22:49,979 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 19:22:49,979 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 19:22:49,980 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 19:22:49,980 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 19:22:49,980 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 19:22:49,980 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 19:22:49,980 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 19:22:49,981 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 19:22:50,026 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 19:22:50,038 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 19:22:50,042 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 19:22:50,044 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 19:22:50,044 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 19:22:50,045 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gsv2008_true-unreach-call.c.i.p+cfa-reducer.c [2018-11-14 19:22:50,103 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6edadd12/80c84b26bd294e4aad771cf52495230e/FLAG31dbe95a6 [2018-11-14 19:22:50,597 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 19:22:50,598 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gsv2008_true-unreach-call.c.i.p+cfa-reducer.c [2018-11-14 19:22:50,604 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6edadd12/80c84b26bd294e4aad771cf52495230e/FLAG31dbe95a6 [2018-11-14 19:22:50,618 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6edadd12/80c84b26bd294e4aad771cf52495230e [2018-11-14 19:22:50,627 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 19:22:50,629 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 19:22:50,630 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 19:22:50,630 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 19:22:50,634 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 19:22:50,636 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:22:50" (1/1) ... [2018-11-14 19:22:50,638 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@733483a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:22:50, skipping insertion in model container [2018-11-14 19:22:50,639 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:22:50" (1/1) ... [2018-11-14 19:22:50,649 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 19:22:50,670 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 19:22:50,869 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 19:22:50,875 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 19:22:50,895 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 19:22:50,912 INFO L195 MainTranslator]: Completed translation [2018-11-14 19:22:50,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:22:50 WrapperNode [2018-11-14 19:22:50,913 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 19:22:50,913 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 19:22:50,914 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 19:22:50,914 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 19:22:50,929 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:22:50" (1/1) ... [2018-11-14 19:22:50,929 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:22:50" (1/1) ... [2018-11-14 19:22:50,935 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:22:50" (1/1) ... [2018-11-14 19:22:50,935 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:22:50" (1/1) ... [2018-11-14 19:22:50,941 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:22:50" (1/1) ... [2018-11-14 19:22:50,944 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:22:50" (1/1) ... [2018-11-14 19:22:50,945 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:22:50" (1/1) ... [2018-11-14 19:22:50,946 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 19:22:50,947 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 19:22:50,947 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 19:22:50,947 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 19:22:50,948 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:22:50" (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-14 19:22:51,072 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 19:22:51,072 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 19:22:51,072 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 19:22:51,072 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 19:22:51,072 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-14 19:22:51,073 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 19:22:51,073 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 19:22:51,073 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 19:22:51,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 19:22:51,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 19:22:51,502 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 19:22:51,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:22:51 BoogieIcfgContainer [2018-11-14 19:22:51,503 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 19:22:51,503 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 19:22:51,504 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 19:22:51,508 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 19:22:51,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 07:22:50" (1/3) ... [2018-11-14 19:22:51,510 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1322802c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:22:51, skipping insertion in model container [2018-11-14 19:22:51,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:22:50" (2/3) ... [2018-11-14 19:22:51,511 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1322802c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:22:51, skipping insertion in model container [2018-11-14 19:22:51,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:22:51" (3/3) ... [2018-11-14 19:22:51,514 INFO L112 eAbstractionObserver]: Analyzing ICFG gsv2008_true-unreach-call.c.i.p+cfa-reducer.c [2018-11-14 19:22:51,529 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 19:22:51,540 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 19:22:51,555 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 19:22:51,582 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 19:22:51,583 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 19:22:51,583 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 19:22:51,584 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 19:22:51,584 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 19:22:51,584 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 19:22:51,584 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 19:22:51,584 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 19:22:51,584 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 19:22:51,603 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2018-11-14 19:22:51,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-14 19:22:51,610 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:22:51,611 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:22:51,613 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:22:51,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:22:51,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1277702393, now seen corresponding path program 1 times [2018-11-14 19:22:51,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:22:51,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:22:51,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:22:51,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:22:51,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:22:51,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:22:51,840 INFO L256 TraceCheckUtils]: 0: Hoare triple {19#true} call ULTIMATE.init(); {19#true} is VALID [2018-11-14 19:22:51,844 INFO L273 TraceCheckUtils]: 1: Hoare triple {19#true} ~__return_main~0 := 0;~__return_144~0 := 0; {19#true} is VALID [2018-11-14 19:22:51,844 INFO L273 TraceCheckUtils]: 2: Hoare triple {19#true} assume true; {19#true} is VALID [2018-11-14 19:22:51,845 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19#true} {19#true} #28#return; {19#true} is VALID [2018-11-14 19:22:51,845 INFO L256 TraceCheckUtils]: 4: Hoare triple {19#true} call #t~ret2 := main(); {19#true} is VALID [2018-11-14 19:22:51,850 INFO L273 TraceCheckUtils]: 5: Hoare triple {19#true} havoc ~main__x~0;havoc ~main__y~0;~main__x~0 := -50;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__y~0 := #t~nondet1;havoc #t~nondet1; {21#(<= (+ main_~main__x~0 50) 0)} is VALID [2018-11-14 19:22:51,853 INFO L273 TraceCheckUtils]: 6: Hoare triple {21#(<= (+ main_~main__x~0 50) 0)} assume !!(-1000 < ~main__y~0); {21#(<= (+ main_~main__x~0 50) 0)} is VALID [2018-11-14 19:22:51,859 INFO L273 TraceCheckUtils]: 7: Hoare triple {21#(<= (+ main_~main__x~0 50) 0)} assume !!(~main__y~0 < 1000000); {21#(<= (+ main_~main__x~0 50) 0)} is VALID [2018-11-14 19:22:51,860 INFO L273 TraceCheckUtils]: 8: Hoare triple {21#(<= (+ main_~main__x~0 50) 0)} assume !(~main__x~0 < 0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__y~0 > 0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {20#false} is VALID [2018-11-14 19:22:51,861 INFO L273 TraceCheckUtils]: 9: Hoare triple {20#false} assume ~__VERIFIER_assert__cond~0 == 0; {20#false} is VALID [2018-11-14 19:22:51,861 INFO L273 TraceCheckUtils]: 10: Hoare triple {20#false} assume !false; {20#false} is VALID [2018-11-14 19:22:51,864 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-14 19:22:51,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:22:51,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 19:22:51,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-14 19:22:51,875 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:22:51,878 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 19:22:51,928 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:22:51,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 19:22:51,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 19:22:51,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 19:22:51,945 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 3 states. [2018-11-14 19:22:52,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:52,081 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2018-11-14 19:22:52,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 19:22:52,082 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-14 19:22:52,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:22:52,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 19:22:52,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2018-11-14 19:22:52,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 19:22:52,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2018-11-14 19:22:52,100 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 30 transitions. [2018-11-14 19:22:52,395 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:22:52,407 INFO L225 Difference]: With dead ends: 26 [2018-11-14 19:22:52,407 INFO L226 Difference]: Without dead ends: 13 [2018-11-14 19:22:52,411 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 19:22:52,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-14 19:22:52,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-14 19:22:52,535 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:22:52,536 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand 13 states. [2018-11-14 19:22:52,537 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-14 19:22:52,537 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-14 19:22:52,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:52,540 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-11-14 19:22:52,541 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-14 19:22:52,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:52,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:52,542 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-14 19:22:52,542 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-14 19:22:52,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:52,545 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-11-14 19:22:52,545 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-14 19:22:52,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:52,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:52,546 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:22:52,547 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:22:52,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 19:22:52,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-11-14 19:22:52,551 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-11-14 19:22:52,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:22:52,551 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-11-14 19:22:52,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 19:22:52,551 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-14 19:22:52,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-14 19:22:52,552 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:22:52,552 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:22:52,553 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:22:52,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:22:52,553 INFO L82 PathProgramCache]: Analyzing trace with hash -954130992, now seen corresponding path program 1 times [2018-11-14 19:22:52,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:22:52,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:22:52,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:22:52,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:22:52,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:22:52,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:22:52,835 INFO L256 TraceCheckUtils]: 0: Hoare triple {101#true} call ULTIMATE.init(); {101#true} is VALID [2018-11-14 19:22:52,836 INFO L273 TraceCheckUtils]: 1: Hoare triple {101#true} ~__return_main~0 := 0;~__return_144~0 := 0; {101#true} is VALID [2018-11-14 19:22:52,836 INFO L273 TraceCheckUtils]: 2: Hoare triple {101#true} assume true; {101#true} is VALID [2018-11-14 19:22:52,836 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {101#true} {101#true} #28#return; {101#true} is VALID [2018-11-14 19:22:52,837 INFO L256 TraceCheckUtils]: 4: Hoare triple {101#true} call #t~ret2 := main(); {101#true} is VALID [2018-11-14 19:22:52,846 INFO L273 TraceCheckUtils]: 5: Hoare triple {101#true} havoc ~main__x~0;havoc ~main__y~0;~main__x~0 := -50;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__y~0 := #t~nondet1;havoc #t~nondet1; {103#(<= (+ main_~main__x~0 50) 0)} is VALID [2018-11-14 19:22:52,861 INFO L273 TraceCheckUtils]: 6: Hoare triple {103#(<= (+ main_~main__x~0 50) 0)} assume !!(-1000 < ~main__y~0); {103#(<= (+ main_~main__x~0 50) 0)} is VALID [2018-11-14 19:22:52,863 INFO L273 TraceCheckUtils]: 7: Hoare triple {103#(<= (+ main_~main__x~0 50) 0)} assume !!(~main__y~0 < 1000000); {103#(<= (+ main_~main__x~0 50) 0)} is VALID [2018-11-14 19:22:52,866 INFO L273 TraceCheckUtils]: 8: Hoare triple {103#(<= (+ main_~main__x~0 50) 0)} assume ~main__x~0 < 0;~main__x~0 := ~main__x~0 + ~main__y~0;~main____CPAchecker_TMP_0~0 := ~main__y~0;~main__y~0 := ~main__y~0 + 1; {104#(<= (+ main_~main__x~0 51) main_~main__y~0)} is VALID [2018-11-14 19:22:52,867 INFO L273 TraceCheckUtils]: 9: Hoare triple {104#(<= (+ main_~main__x~0 51) main_~main__y~0)} assume !(~main__x~0 < 0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__y~0 > 0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {105#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 19:22:52,868 INFO L273 TraceCheckUtils]: 10: Hoare triple {105#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {102#false} is VALID [2018-11-14 19:22:52,868 INFO L273 TraceCheckUtils]: 11: Hoare triple {102#false} assume !false; {102#false} is VALID [2018-11-14 19:22:52,872 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-14 19:22:52,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:22:52,872 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-14 19:22:52,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:22:52,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:22:52,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:22:52,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:22:53,207 INFO L256 TraceCheckUtils]: 0: Hoare triple {101#true} call ULTIMATE.init(); {101#true} is VALID [2018-11-14 19:22:53,207 INFO L273 TraceCheckUtils]: 1: Hoare triple {101#true} ~__return_main~0 := 0;~__return_144~0 := 0; {101#true} is VALID [2018-11-14 19:22:53,207 INFO L273 TraceCheckUtils]: 2: Hoare triple {101#true} assume true; {101#true} is VALID [2018-11-14 19:22:53,208 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {101#true} {101#true} #28#return; {101#true} is VALID [2018-11-14 19:22:53,208 INFO L256 TraceCheckUtils]: 4: Hoare triple {101#true} call #t~ret2 := main(); {101#true} is VALID [2018-11-14 19:22:53,208 INFO L273 TraceCheckUtils]: 5: Hoare triple {101#true} havoc ~main__x~0;havoc ~main__y~0;~main__x~0 := -50;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__y~0 := #t~nondet1;havoc #t~nondet1; {101#true} is VALID [2018-11-14 19:22:53,209 INFO L273 TraceCheckUtils]: 6: Hoare triple {101#true} assume !!(-1000 < ~main__y~0); {101#true} is VALID [2018-11-14 19:22:53,209 INFO L273 TraceCheckUtils]: 7: Hoare triple {101#true} assume !!(~main__y~0 < 1000000); {101#true} is VALID [2018-11-14 19:22:53,210 INFO L273 TraceCheckUtils]: 8: Hoare triple {101#true} assume ~main__x~0 < 0;~main__x~0 := ~main__x~0 + ~main__y~0;~main____CPAchecker_TMP_0~0 := ~main__y~0;~main__y~0 := ~main__y~0 + 1; {133#(<= (+ main_~main__x~0 2) main_~main__y~0)} is VALID [2018-11-14 19:22:53,212 INFO L273 TraceCheckUtils]: 9: Hoare triple {133#(<= (+ main_~main__x~0 2) main_~main__y~0)} assume !(~main__x~0 < 0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__y~0 > 0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {105#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 19:22:53,212 INFO L273 TraceCheckUtils]: 10: Hoare triple {105#(= main_~__VERIFIER_assert__cond~0 1)} assume ~__VERIFIER_assert__cond~0 == 0; {102#false} is VALID [2018-11-14 19:22:53,213 INFO L273 TraceCheckUtils]: 11: Hoare triple {102#false} assume !false; {102#false} is VALID [2018-11-14 19:22:53,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:22:53,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-14 19:22:53,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2018-11-14 19:22:53,238 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-11-14 19:22:53,238 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:22:53,238 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 19:22:53,271 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:22:53,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 19:22:53,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 19:22:53,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-14 19:22:53,272 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 6 states. [2018-11-14 19:22:53,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:53,735 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2018-11-14 19:22:53,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 19:22:53,736 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-11-14 19:22:53,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:22:53,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:22:53,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2018-11-14 19:22:53,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:22:53,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2018-11-14 19:22:53,746 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 16 transitions. [2018-11-14 19:22:53,899 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:22:53,899 INFO L225 Difference]: With dead ends: 15 [2018-11-14 19:22:53,899 INFO L226 Difference]: Without dead ends: 0 [2018-11-14 19:22:53,900 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-14 19:22:53,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-14 19:22:53,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-14 19:22:53,901 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:22:53,901 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-14 19:22:53,901 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 19:22:53,901 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 19:22:53,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:53,902 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 19:22:53,902 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 19:22:53,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:53,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:53,902 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 19:22:53,902 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 19:22:53,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:22:53,903 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 19:22:53,903 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 19:22:53,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:53,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:22:53,903 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:22:53,904 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:22:53,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-14 19:22:53,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-14 19:22:53,904 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2018-11-14 19:22:53,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:22:53,904 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-14 19:22:53,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 19:22:53,905 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 19:22:53,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:22:53,909 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-14 19:22:54,031 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-14 19:22:54,031 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-14 19:22:54,031 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-14 19:22:54,031 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-14 19:22:54,031 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-14 19:22:54,032 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-14 19:22:54,032 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-14 19:22:54,032 INFO L421 ceAbstractionStarter]: At program point L32(lines 25 53) the Hoare annotation is: (or (<= (+ main_~main__x~0 2) main_~main__y~0) (<= (+ main_~main__x~0 50) 0)) [2018-11-14 19:22:54,032 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 8 55) the Hoare annotation is: true [2018-11-14 19:22:54,032 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 43) no Hoare annotation was computed. [2018-11-14 19:22:54,033 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 8 55) no Hoare annotation was computed. [2018-11-14 19:22:54,033 INFO L425 ceAbstractionStarter]: For program point L20(lines 20 53) no Hoare annotation was computed. [2018-11-14 19:22:54,033 INFO L425 ceAbstractionStarter]: For program point L14(lines 14 54) no Hoare annotation was computed. [2018-11-14 19:22:54,033 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 8 55) no Hoare annotation was computed. [2018-11-14 19:22:54,033 INFO L425 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-11-14 19:22:54,033 INFO L425 ceAbstractionStarter]: For program point L41(lines 41 50) no Hoare annotation was computed. [2018-11-14 19:22:54,035 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-14 19:22:54,035 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-14 19:22:54,035 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-14 19:22:54,035 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 19:22:54,035 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-14 19:22:54,036 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-14 19:22:54,036 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 19:22:54,036 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 19:22:54,036 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 19:22:54,036 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2018-11-14 19:22:54,036 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2018-11-14 19:22:54,036 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-14 19:22:54,038 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2018-11-14 19:22:54,038 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2018-11-14 19:22:54,038 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2018-11-14 19:22:54,038 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2018-11-14 19:22:54,038 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2018-11-14 19:22:54,038 INFO L163 areAnnotationChecker]: CFG has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-14 19:22:54,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 07:22:54 BoogieIcfgContainer [2018-11-14 19:22:54,047 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-14 19:22:54,048 INFO L168 Benchmark]: Toolchain (without parser) took 3420.34 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 757.6 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -677.6 MB). Peak memory consumption was 80.0 MB. Max. memory is 7.1 GB. [2018-11-14 19:22:54,051 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 19:22:54,051 INFO L168 Benchmark]: CACSL2BoogieTranslator took 283.09 ms. Allocated memory is still 1.6 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-14 19:22:54,052 INFO L168 Benchmark]: Boogie Preprocessor took 32.85 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 19:22:54,053 INFO L168 Benchmark]: RCFGBuilder took 556.22 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 757.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -805.1 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2018-11-14 19:22:54,054 INFO L168 Benchmark]: TraceAbstraction took 2543.48 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 117.0 MB). Peak memory consumption was 117.0 MB. Max. memory is 7.1 GB. [2018-11-14 19:22:54,059 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.20 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 283.09 ms. Allocated memory is still 1.6 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 Preprocessor took 32.85 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 556.22 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 757.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -805.1 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2543.48 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 117.0 MB). Peak memory consumption was 117.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 43]: 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: 25]: Loop Invariant Derived loop invariant: main__x + 2 <= main__y || main__x + 50 <= 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 16 locations, 1 error locations. SAFE Result, 2.4s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 25 SDtfs, 6 SDslu, 29 SDs, 0 SdLazy, 16 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred 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.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 7 NumberOfFragments, 15 HoareAnnotationTreeSize, 5 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 5 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 35 NumberOfCodeBlocks, 35 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 32 ConstructedInterpolants, 0 QuantifiedInterpolants, 726 SizeOfPredicates, 4 NumberOfNonLiveVariables, 45 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 1/2 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...