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.epf -i ../../../trunk/examples/svcomp/loop-lit/afnp2014_true-unreach-call_true-termination.c.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:35:09,207 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:35:09,209 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:35:09,229 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:35:09,229 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:35:09,231 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:35:09,232 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:35:09,237 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:35:09,244 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:35:09,245 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:35:09,245 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:35:09,246 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:35:09,247 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:35:09,248 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:35:09,249 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:35:09,250 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:35:09,250 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:35:09,252 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:35:09,254 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:35:09,256 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:35:09,257 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:35:09,258 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:35:09,260 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:35:09,261 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:35:09,261 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:35:09,262 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:35:09,263 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:35:09,264 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:35:09,265 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:35:09,266 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:35:09,266 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:35:09,267 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:35:09,267 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:35:09,267 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:35:09,268 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:35:09,269 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:35:09,269 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-14 17:35:09,293 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:35:09,294 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:35:09,295 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:35:09,296 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:35:09,296 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:35:09,296 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:35:09,300 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:35:09,300 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:35:09,300 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:35:09,301 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 17:35:09,301 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:35:09,301 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:35:09,301 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:35:09,301 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:35:09,302 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:35:09,302 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:35:09,302 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:35:09,302 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:35:09,302 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:35:09,303 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:35:09,303 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:35:09,304 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:35:09,304 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:35:09,304 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:35:09,304 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:35:09,304 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:35:09,305 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 17:35:09,305 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:35:09,305 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 17:35:09,305 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:35:09,370 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:35:09,388 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:35:09,393 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:35:09,395 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:35:09,395 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:35:09,396 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/afnp2014_true-unreach-call_true-termination.c.i [2018-11-14 17:35:09,469 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15b42a98e/a9267ec8bda14d24ada62f10393ba185/FLAG45ffde502 [2018-11-14 17:35:09,901 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:35:09,901 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/afnp2014_true-unreach-call_true-termination.c.i [2018-11-14 17:35:09,907 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15b42a98e/a9267ec8bda14d24ada62f10393ba185/FLAG45ffde502 [2018-11-14 17:35:09,928 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15b42a98e/a9267ec8bda14d24ada62f10393ba185 [2018-11-14 17:35:09,939 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:35:09,940 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:35:09,942 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:35:09,942 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:35:09,945 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:35:09,947 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:35:09" (1/1) ... [2018-11-14 17:35:09,950 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cb1323e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:09, skipping insertion in model container [2018-11-14 17:35:09,950 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:35:09" (1/1) ... [2018-11-14 17:35:09,961 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:35:09,983 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:35:10,227 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:35:10,232 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:35:10,252 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:35:10,268 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:35:10,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:10 WrapperNode [2018-11-14 17:35:10,269 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:35:10,270 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:35:10,270 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:35:10,270 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:35:10,284 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:10" (1/1) ... [2018-11-14 17:35:10,285 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:10" (1/1) ... [2018-11-14 17:35:10,290 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:10" (1/1) ... [2018-11-14 17:35:10,290 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:10" (1/1) ... [2018-11-14 17:35:10,295 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:10" (1/1) ... [2018-11-14 17:35:10,300 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:10" (1/1) ... [2018-11-14 17:35:10,300 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:10" (1/1) ... [2018-11-14 17:35:10,302 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:35:10,302 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:35:10,302 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:35:10,303 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:35:10,303 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:10" (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 17:35:10,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:35:10,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:35:10,431 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 17:35:10,431 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:35:10,431 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:35:10,431 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-14 17:35:10,433 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 17:35:10,434 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 17:35:10,434 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:35:10,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:35:10,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:35:10,852 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:35:10,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:35:10 BoogieIcfgContainer [2018-11-14 17:35:10,854 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:35:10,855 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:35:10,855 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:35:10,858 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:35:10,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:35:09" (1/3) ... [2018-11-14 17:35:10,860 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54e017c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:35:10, skipping insertion in model container [2018-11-14 17:35:10,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:35:10" (2/3) ... [2018-11-14 17:35:10,860 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54e017c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:35:10, skipping insertion in model container [2018-11-14 17:35:10,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:35:10" (3/3) ... [2018-11-14 17:35:10,862 INFO L112 eAbstractionObserver]: Analyzing ICFG afnp2014_true-unreach-call_true-termination.c.i [2018-11-14 17:35:10,873 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:35:10,882 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 17:35:10,899 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 17:35:10,931 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:35:10,932 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:35:10,932 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:35:10,932 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:35:10,933 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:35:10,933 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:35:10,933 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:35:10,933 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:35:10,933 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:35:10,953 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-11-14 17:35:10,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-14 17:35:10,959 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:35:10,960 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:35:10,963 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:35:10,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:35:10,969 INFO L82 PathProgramCache]: Analyzing trace with hash -2008095039, now seen corresponding path program 1 times [2018-11-14 17:35:10,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:35:10,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:35:11,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:11,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:35:11,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:11,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:35:11,099 INFO L256 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {24#true} is VALID [2018-11-14 17:35:11,103 INFO L273 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2018-11-14 17:35:11,103 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #40#return; {24#true} is VALID [2018-11-14 17:35:11,103 INFO L256 TraceCheckUtils]: 3: Hoare triple {24#true} call #t~ret3 := main(); {24#true} is VALID [2018-11-14 17:35:11,104 INFO L273 TraceCheckUtils]: 4: Hoare triple {24#true} ~x~0 := 1;~y~0 := 0; {24#true} is VALID [2018-11-14 17:35:11,106 INFO L273 TraceCheckUtils]: 5: Hoare triple {24#true} assume !true; {25#false} is VALID [2018-11-14 17:35:11,106 INFO L256 TraceCheckUtils]: 6: Hoare triple {25#false} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {25#false} is VALID [2018-11-14 17:35:11,107 INFO L273 TraceCheckUtils]: 7: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2018-11-14 17:35:11,107 INFO L273 TraceCheckUtils]: 8: Hoare triple {25#false} assume ~cond == 0; {25#false} is VALID [2018-11-14 17:35:11,107 INFO L273 TraceCheckUtils]: 9: Hoare triple {25#false} assume !false; {25#false} is VALID [2018-11-14 17:35:11,110 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 17:35:11,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:35:11,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 17:35:11,119 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-14 17:35:11,122 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:35:11,126 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 17:35:11,165 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-14 17:35:11,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 17:35:11,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 17:35:11,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:35:11,179 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2018-11-14 17:35:11,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:11,270 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-11-14 17:35:11,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 17:35:11,270 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-14 17:35:11,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:35:11,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:35:11,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 37 transitions. [2018-11-14 17:35:11,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:35:11,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 37 transitions. [2018-11-14 17:35:11,287 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 37 transitions. [2018-11-14 17:35:11,589 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:35:11,601 INFO L225 Difference]: With dead ends: 33 [2018-11-14 17:35:11,601 INFO L226 Difference]: Without dead ends: 14 [2018-11-14 17:35:11,605 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:35:11,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-14 17:35:11,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-14 17:35:11,727 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:35:11,728 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2018-11-14 17:35:11,728 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-14 17:35:11,729 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-14 17:35:11,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:11,733 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2018-11-14 17:35:11,734 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-14 17:35:11,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:11,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:11,735 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-14 17:35:11,735 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-14 17:35:11,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:11,738 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2018-11-14 17:35:11,739 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-14 17:35:11,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:11,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:11,739 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:35:11,740 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:35:11,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 17:35:11,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-11-14 17:35:11,744 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2018-11-14 17:35:11,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:35:11,744 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2018-11-14 17:35:11,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 17:35:11,745 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-14 17:35:11,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-14 17:35:11,746 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:35:11,746 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:35:11,746 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:35:11,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:35:11,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1404763780, now seen corresponding path program 1 times [2018-11-14 17:35:11,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:35:11,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:35:11,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:11,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:35:11,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:11,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:35:12,070 INFO L256 TraceCheckUtils]: 0: Hoare triple {119#true} call ULTIMATE.init(); {119#true} is VALID [2018-11-14 17:35:12,071 INFO L273 TraceCheckUtils]: 1: Hoare triple {119#true} assume true; {119#true} is VALID [2018-11-14 17:35:12,072 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {119#true} {119#true} #40#return; {119#true} is VALID [2018-11-14 17:35:12,072 INFO L256 TraceCheckUtils]: 3: Hoare triple {119#true} call #t~ret3 := main(); {119#true} is VALID [2018-11-14 17:35:12,089 INFO L273 TraceCheckUtils]: 4: Hoare triple {119#true} ~x~0 := 1;~y~0 := 0; {121#(<= (+ main_~y~0 1) main_~x~0)} is VALID [2018-11-14 17:35:12,100 INFO L273 TraceCheckUtils]: 5: Hoare triple {121#(<= (+ main_~y~0 1) main_~x~0)} assume true; {121#(<= (+ main_~y~0 1) main_~x~0)} is VALID [2018-11-14 17:35:12,101 INFO L273 TraceCheckUtils]: 6: Hoare triple {121#(<= (+ main_~y~0 1) main_~x~0)} #t~short2 := ~y~0 < 1000; {121#(<= (+ main_~y~0 1) main_~x~0)} is VALID [2018-11-14 17:35:12,101 INFO L273 TraceCheckUtils]: 7: Hoare triple {121#(<= (+ main_~y~0 1) main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := #t~nondet1 != 0; {121#(<= (+ main_~y~0 1) main_~x~0)} is VALID [2018-11-14 17:35:12,102 INFO L273 TraceCheckUtils]: 8: Hoare triple {121#(<= (+ main_~y~0 1) main_~x~0)} assume !#t~short2;havoc #t~short2;havoc #t~nondet1; {121#(<= (+ main_~y~0 1) main_~x~0)} is VALID [2018-11-14 17:35:12,105 INFO L256 TraceCheckUtils]: 9: Hoare triple {121#(<= (+ main_~y~0 1) main_~x~0)} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {122#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 17:35:12,106 INFO L273 TraceCheckUtils]: 10: Hoare triple {122#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {123#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-14 17:35:12,107 INFO L273 TraceCheckUtils]: 11: Hoare triple {123#(= __VERIFIER_assert_~cond 1)} assume ~cond == 0; {120#false} is VALID [2018-11-14 17:35:12,107 INFO L273 TraceCheckUtils]: 12: Hoare triple {120#false} assume !false; {120#false} is VALID [2018-11-14 17:35:12,109 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 17:35:12,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:35:12,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 17:35:12,112 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-14 17:35:12,112 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:35:12,112 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 17:35:12,162 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:35:12,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 17:35:12,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 17:35:12,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:35:12,163 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 5 states. [2018-11-14 17:35:12,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:12,523 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2018-11-14 17:35:12,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 17:35:12,523 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-14 17:35:12,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:35:12,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:35:12,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2018-11-14 17:35:12,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:35:12,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2018-11-14 17:35:12,529 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 25 transitions. [2018-11-14 17:35:12,586 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-14 17:35:12,589 INFO L225 Difference]: With dead ends: 23 [2018-11-14 17:35:12,589 INFO L226 Difference]: Without dead ends: 18 [2018-11-14 17:35:12,590 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:35:12,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-14 17:35:12,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-14 17:35:12,605 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:35:12,605 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2018-11-14 17:35:12,606 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-14 17:35:12,606 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-14 17:35:12,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:12,609 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2018-11-14 17:35:12,609 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2018-11-14 17:35:12,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:12,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:12,610 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-14 17:35:12,610 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-14 17:35:12,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:12,612 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2018-11-14 17:35:12,612 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2018-11-14 17:35:12,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:12,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:12,613 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:35:12,613 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:35:12,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 17:35:12,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-11-14 17:35:12,616 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 13 [2018-11-14 17:35:12,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:35:12,616 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-11-14 17:35:12,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 17:35:12,616 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2018-11-14 17:35:12,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-14 17:35:12,617 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:35:12,617 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:35:12,618 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:35:12,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:35:12,618 INFO L82 PathProgramCache]: Analyzing trace with hash 108470830, now seen corresponding path program 1 times [2018-11-14 17:35:12,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:35:12,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:35:12,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:12,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:35:12,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:12,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:35:13,055 INFO L256 TraceCheckUtils]: 0: Hoare triple {223#true} call ULTIMATE.init(); {223#true} is VALID [2018-11-14 17:35:13,055 INFO L273 TraceCheckUtils]: 1: Hoare triple {223#true} assume true; {223#true} is VALID [2018-11-14 17:35:13,055 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {223#true} {223#true} #40#return; {223#true} is VALID [2018-11-14 17:35:13,056 INFO L256 TraceCheckUtils]: 3: Hoare triple {223#true} call #t~ret3 := main(); {223#true} is VALID [2018-11-14 17:35:13,069 INFO L273 TraceCheckUtils]: 4: Hoare triple {223#true} ~x~0 := 1;~y~0 := 0; {225#(<= 1 main_~x~0)} is VALID [2018-11-14 17:35:13,082 INFO L273 TraceCheckUtils]: 5: Hoare triple {225#(<= 1 main_~x~0)} assume true; {225#(<= 1 main_~x~0)} is VALID [2018-11-14 17:35:13,095 INFO L273 TraceCheckUtils]: 6: Hoare triple {225#(<= 1 main_~x~0)} #t~short2 := ~y~0 < 1000; {225#(<= 1 main_~x~0)} is VALID [2018-11-14 17:35:13,106 INFO L273 TraceCheckUtils]: 7: Hoare triple {225#(<= 1 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := #t~nondet1 != 0; {225#(<= 1 main_~x~0)} is VALID [2018-11-14 17:35:13,108 INFO L273 TraceCheckUtils]: 8: Hoare triple {225#(<= 1 main_~x~0)} assume !!#t~short2;havoc #t~short2;havoc #t~nondet1;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + 1; {226#(<= main_~y~0 main_~x~0)} is VALID [2018-11-14 17:35:13,112 INFO L273 TraceCheckUtils]: 9: Hoare triple {226#(<= main_~y~0 main_~x~0)} assume true; {226#(<= main_~y~0 main_~x~0)} is VALID [2018-11-14 17:35:13,112 INFO L273 TraceCheckUtils]: 10: Hoare triple {226#(<= main_~y~0 main_~x~0)} #t~short2 := ~y~0 < 1000; {226#(<= main_~y~0 main_~x~0)} is VALID [2018-11-14 17:35:13,114 INFO L273 TraceCheckUtils]: 11: Hoare triple {226#(<= main_~y~0 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := #t~nondet1 != 0; {226#(<= main_~y~0 main_~x~0)} is VALID [2018-11-14 17:35:13,117 INFO L273 TraceCheckUtils]: 12: Hoare triple {226#(<= main_~y~0 main_~x~0)} assume !#t~short2;havoc #t~short2;havoc #t~nondet1; {226#(<= main_~y~0 main_~x~0)} is VALID [2018-11-14 17:35:13,121 INFO L256 TraceCheckUtils]: 13: Hoare triple {226#(<= main_~y~0 main_~x~0)} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {227#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 17:35:13,122 INFO L273 TraceCheckUtils]: 14: Hoare triple {227#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {228#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-14 17:35:13,123 INFO L273 TraceCheckUtils]: 15: Hoare triple {228#(= __VERIFIER_assert_~cond 1)} assume ~cond == 0; {224#false} is VALID [2018-11-14 17:35:13,124 INFO L273 TraceCheckUtils]: 16: Hoare triple {224#false} assume !false; {224#false} is VALID [2018-11-14 17:35:13,127 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-14 17:35:13,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:35:13,127 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 17:35:13,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:35:13,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:35:13,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:35:13,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:35:13,366 INFO L256 TraceCheckUtils]: 0: Hoare triple {223#true} call ULTIMATE.init(); {223#true} is VALID [2018-11-14 17:35:13,367 INFO L273 TraceCheckUtils]: 1: Hoare triple {223#true} assume true; {223#true} is VALID [2018-11-14 17:35:13,367 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {223#true} {223#true} #40#return; {223#true} is VALID [2018-11-14 17:35:13,367 INFO L256 TraceCheckUtils]: 3: Hoare triple {223#true} call #t~ret3 := main(); {223#true} is VALID [2018-11-14 17:35:13,373 INFO L273 TraceCheckUtils]: 4: Hoare triple {223#true} ~x~0 := 1;~y~0 := 0; {225#(<= 1 main_~x~0)} is VALID [2018-11-14 17:35:13,373 INFO L273 TraceCheckUtils]: 5: Hoare triple {225#(<= 1 main_~x~0)} assume true; {225#(<= 1 main_~x~0)} is VALID [2018-11-14 17:35:13,374 INFO L273 TraceCheckUtils]: 6: Hoare triple {225#(<= 1 main_~x~0)} #t~short2 := ~y~0 < 1000; {225#(<= 1 main_~x~0)} is VALID [2018-11-14 17:35:13,378 INFO L273 TraceCheckUtils]: 7: Hoare triple {225#(<= 1 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := #t~nondet1 != 0; {225#(<= 1 main_~x~0)} is VALID [2018-11-14 17:35:13,379 INFO L273 TraceCheckUtils]: 8: Hoare triple {225#(<= 1 main_~x~0)} assume !!#t~short2;havoc #t~short2;havoc #t~nondet1;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + 1; {226#(<= main_~y~0 main_~x~0)} is VALID [2018-11-14 17:35:13,379 INFO L273 TraceCheckUtils]: 9: Hoare triple {226#(<= main_~y~0 main_~x~0)} assume true; {226#(<= main_~y~0 main_~x~0)} is VALID [2018-11-14 17:35:13,380 INFO L273 TraceCheckUtils]: 10: Hoare triple {226#(<= main_~y~0 main_~x~0)} #t~short2 := ~y~0 < 1000; {226#(<= main_~y~0 main_~x~0)} is VALID [2018-11-14 17:35:13,383 INFO L273 TraceCheckUtils]: 11: Hoare triple {226#(<= main_~y~0 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := #t~nondet1 != 0; {226#(<= main_~y~0 main_~x~0)} is VALID [2018-11-14 17:35:13,384 INFO L273 TraceCheckUtils]: 12: Hoare triple {226#(<= main_~y~0 main_~x~0)} assume !#t~short2;havoc #t~short2;havoc #t~nondet1; {226#(<= main_~y~0 main_~x~0)} is VALID [2018-11-14 17:35:13,386 INFO L256 TraceCheckUtils]: 13: Hoare triple {226#(<= main_~y~0 main_~x~0)} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {227#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 17:35:13,389 INFO L273 TraceCheckUtils]: 14: Hoare triple {227#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {228#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-14 17:35:13,390 INFO L273 TraceCheckUtils]: 15: Hoare triple {228#(= __VERIFIER_assert_~cond 1)} assume ~cond == 0; {224#false} is VALID [2018-11-14 17:35:13,390 INFO L273 TraceCheckUtils]: 16: Hoare triple {224#false} assume !false; {224#false} is VALID [2018-11-14 17:35:13,392 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-14 17:35:13,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:35:13,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-14 17:35:13,414 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-14 17:35:13,414 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:35:13,414 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:35:13,438 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 17:35:13,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:35:13,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:35:13,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:35:13,439 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 6 states. [2018-11-14 17:35:13,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:13,850 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-11-14 17:35:13,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 17:35:13,850 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-14 17:35:13,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:35:13,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:35:13,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2018-11-14 17:35:13,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:35:13,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2018-11-14 17:35:13,856 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 30 transitions. [2018-11-14 17:35:13,928 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 17:35:13,929 INFO L225 Difference]: With dead ends: 27 [2018-11-14 17:35:13,930 INFO L226 Difference]: Without dead ends: 22 [2018-11-14 17:35:13,931 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-14 17:35:13,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-14 17:35:13,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-14 17:35:13,960 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:35:13,960 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2018-11-14 17:35:13,961 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-14 17:35:13,961 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-14 17:35:13,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:13,963 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2018-11-14 17:35:13,963 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2018-11-14 17:35:13,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:13,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:13,964 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-14 17:35:13,964 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-14 17:35:13,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:13,966 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2018-11-14 17:35:13,967 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2018-11-14 17:35:13,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:13,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:13,968 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:35:13,968 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:35:13,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 17:35:13,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2018-11-14 17:35:13,970 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 17 [2018-11-14 17:35:13,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:35:13,970 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-11-14 17:35:13,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:35:13,971 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2018-11-14 17:35:13,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-14 17:35:13,971 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:35:13,972 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:35:13,972 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:35:13,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:35:13,972 INFO L82 PathProgramCache]: Analyzing trace with hash -238722856, now seen corresponding path program 2 times [2018-11-14 17:35:13,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:35:13,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:35:13,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:13,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:35:13,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:13,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:35:14,182 INFO L256 TraceCheckUtils]: 0: Hoare triple {396#true} call ULTIMATE.init(); {396#true} is VALID [2018-11-14 17:35:14,183 INFO L273 TraceCheckUtils]: 1: Hoare triple {396#true} assume true; {396#true} is VALID [2018-11-14 17:35:14,184 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {396#true} {396#true} #40#return; {396#true} is VALID [2018-11-14 17:35:14,184 INFO L256 TraceCheckUtils]: 3: Hoare triple {396#true} call #t~ret3 := main(); {396#true} is VALID [2018-11-14 17:35:14,185 INFO L273 TraceCheckUtils]: 4: Hoare triple {396#true} ~x~0 := 1;~y~0 := 0; {398#(<= 1 (+ main_~x~0 main_~y~0))} is VALID [2018-11-14 17:35:14,187 INFO L273 TraceCheckUtils]: 5: Hoare triple {398#(<= 1 (+ main_~x~0 main_~y~0))} assume true; {398#(<= 1 (+ main_~x~0 main_~y~0))} is VALID [2018-11-14 17:35:14,192 INFO L273 TraceCheckUtils]: 6: Hoare triple {398#(<= 1 (+ main_~x~0 main_~y~0))} #t~short2 := ~y~0 < 1000; {398#(<= 1 (+ main_~x~0 main_~y~0))} is VALID [2018-11-14 17:35:14,192 INFO L273 TraceCheckUtils]: 7: Hoare triple {398#(<= 1 (+ main_~x~0 main_~y~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := #t~nondet1 != 0; {398#(<= 1 (+ main_~x~0 main_~y~0))} is VALID [2018-11-14 17:35:14,193 INFO L273 TraceCheckUtils]: 8: Hoare triple {398#(<= 1 (+ main_~x~0 main_~y~0))} assume !!#t~short2;havoc #t~short2;havoc #t~nondet1;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + 1; {399#(<= 1 main_~x~0)} is VALID [2018-11-14 17:35:14,194 INFO L273 TraceCheckUtils]: 9: Hoare triple {399#(<= 1 main_~x~0)} assume true; {399#(<= 1 main_~x~0)} is VALID [2018-11-14 17:35:14,194 INFO L273 TraceCheckUtils]: 10: Hoare triple {399#(<= 1 main_~x~0)} #t~short2 := ~y~0 < 1000; {399#(<= 1 main_~x~0)} is VALID [2018-11-14 17:35:14,195 INFO L273 TraceCheckUtils]: 11: Hoare triple {399#(<= 1 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := #t~nondet1 != 0; {399#(<= 1 main_~x~0)} is VALID [2018-11-14 17:35:14,196 INFO L273 TraceCheckUtils]: 12: Hoare triple {399#(<= 1 main_~x~0)} assume !!#t~short2;havoc #t~short2;havoc #t~nondet1;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + 1; {400#(<= main_~y~0 main_~x~0)} is VALID [2018-11-14 17:35:14,197 INFO L273 TraceCheckUtils]: 13: Hoare triple {400#(<= main_~y~0 main_~x~0)} assume true; {400#(<= main_~y~0 main_~x~0)} is VALID [2018-11-14 17:35:14,198 INFO L273 TraceCheckUtils]: 14: Hoare triple {400#(<= main_~y~0 main_~x~0)} #t~short2 := ~y~0 < 1000; {400#(<= main_~y~0 main_~x~0)} is VALID [2018-11-14 17:35:14,199 INFO L273 TraceCheckUtils]: 15: Hoare triple {400#(<= main_~y~0 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := #t~nondet1 != 0; {400#(<= main_~y~0 main_~x~0)} is VALID [2018-11-14 17:35:14,199 INFO L273 TraceCheckUtils]: 16: Hoare triple {400#(<= main_~y~0 main_~x~0)} assume !#t~short2;havoc #t~short2;havoc #t~nondet1; {400#(<= main_~y~0 main_~x~0)} is VALID [2018-11-14 17:35:14,201 INFO L256 TraceCheckUtils]: 17: Hoare triple {400#(<= main_~y~0 main_~x~0)} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {401#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 17:35:14,202 INFO L273 TraceCheckUtils]: 18: Hoare triple {401#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {402#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-14 17:35:14,203 INFO L273 TraceCheckUtils]: 19: Hoare triple {402#(= __VERIFIER_assert_~cond 1)} assume ~cond == 0; {397#false} is VALID [2018-11-14 17:35:14,203 INFO L273 TraceCheckUtils]: 20: Hoare triple {397#false} assume !false; {397#false} is VALID [2018-11-14 17:35:14,205 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:35:14,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:35:14,205 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-14 17:35:14,216 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:35:14,249 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:35:14,250 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:35:14,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:35:14,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:35:14,435 INFO L256 TraceCheckUtils]: 0: Hoare triple {396#true} call ULTIMATE.init(); {396#true} is VALID [2018-11-14 17:35:14,435 INFO L273 TraceCheckUtils]: 1: Hoare triple {396#true} assume true; {396#true} is VALID [2018-11-14 17:35:14,435 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {396#true} {396#true} #40#return; {396#true} is VALID [2018-11-14 17:35:14,436 INFO L256 TraceCheckUtils]: 3: Hoare triple {396#true} call #t~ret3 := main(); {396#true} is VALID [2018-11-14 17:35:14,436 INFO L273 TraceCheckUtils]: 4: Hoare triple {396#true} ~x~0 := 1;~y~0 := 0; {418#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} is VALID [2018-11-14 17:35:14,437 INFO L273 TraceCheckUtils]: 5: Hoare triple {418#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} assume true; {418#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} is VALID [2018-11-14 17:35:14,438 INFO L273 TraceCheckUtils]: 6: Hoare triple {418#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} #t~short2 := ~y~0 < 1000; {418#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} is VALID [2018-11-14 17:35:14,439 INFO L273 TraceCheckUtils]: 7: Hoare triple {418#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := #t~nondet1 != 0; {418#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} is VALID [2018-11-14 17:35:14,440 INFO L273 TraceCheckUtils]: 8: Hoare triple {418#(and (<= 0 main_~y~0) (<= 1 main_~x~0))} assume !!#t~short2;havoc #t~short2;havoc #t~nondet1;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + 1; {399#(<= 1 main_~x~0)} is VALID [2018-11-14 17:35:14,442 INFO L273 TraceCheckUtils]: 9: Hoare triple {399#(<= 1 main_~x~0)} assume true; {399#(<= 1 main_~x~0)} is VALID [2018-11-14 17:35:14,442 INFO L273 TraceCheckUtils]: 10: Hoare triple {399#(<= 1 main_~x~0)} #t~short2 := ~y~0 < 1000; {399#(<= 1 main_~x~0)} is VALID [2018-11-14 17:35:14,443 INFO L273 TraceCheckUtils]: 11: Hoare triple {399#(<= 1 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := #t~nondet1 != 0; {399#(<= 1 main_~x~0)} is VALID [2018-11-14 17:35:14,444 INFO L273 TraceCheckUtils]: 12: Hoare triple {399#(<= 1 main_~x~0)} assume !!#t~short2;havoc #t~short2;havoc #t~nondet1;~x~0 := ~x~0 + ~y~0;~y~0 := ~y~0 + 1; {400#(<= main_~y~0 main_~x~0)} is VALID [2018-11-14 17:35:14,445 INFO L273 TraceCheckUtils]: 13: Hoare triple {400#(<= main_~y~0 main_~x~0)} assume true; {400#(<= main_~y~0 main_~x~0)} is VALID [2018-11-14 17:35:14,446 INFO L273 TraceCheckUtils]: 14: Hoare triple {400#(<= main_~y~0 main_~x~0)} #t~short2 := ~y~0 < 1000; {400#(<= main_~y~0 main_~x~0)} is VALID [2018-11-14 17:35:14,447 INFO L273 TraceCheckUtils]: 15: Hoare triple {400#(<= main_~y~0 main_~x~0)} assume #t~short2;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;#t~short2 := #t~nondet1 != 0; {400#(<= main_~y~0 main_~x~0)} is VALID [2018-11-14 17:35:14,447 INFO L273 TraceCheckUtils]: 16: Hoare triple {400#(<= main_~y~0 main_~x~0)} assume !#t~short2;havoc #t~short2;havoc #t~nondet1; {400#(<= main_~y~0 main_~x~0)} is VALID [2018-11-14 17:35:14,450 INFO L256 TraceCheckUtils]: 17: Hoare triple {400#(<= main_~y~0 main_~x~0)} call __VERIFIER_assert((if ~x~0 >= ~y~0 then 1 else 0)); {401#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 17:35:14,450 INFO L273 TraceCheckUtils]: 18: Hoare triple {401#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {402#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-14 17:35:14,451 INFO L273 TraceCheckUtils]: 19: Hoare triple {402#(= __VERIFIER_assert_~cond 1)} assume ~cond == 0; {397#false} is VALID [2018-11-14 17:35:14,452 INFO L273 TraceCheckUtils]: 20: Hoare triple {397#false} assume !false; {397#false} is VALID [2018-11-14 17:35:14,454 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:35:14,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:35:14,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-14 17:35:14,475 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-11-14 17:35:14,475 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:35:14,475 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 17:35:14,555 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-14 17:35:14,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 17:35:14,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 17:35:14,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-14 17:35:14,557 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 8 states. [2018-11-14 17:35:14,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:14,705 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2018-11-14 17:35:14,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 17:35:14,705 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-11-14 17:35:14,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:35:14,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 17:35:14,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2018-11-14 17:35:14,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 17:35:14,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2018-11-14 17:35:14,709 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 15 transitions. [2018-11-14 17:35:14,731 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:35:14,731 INFO L225 Difference]: With dead ends: 22 [2018-11-14 17:35:14,731 INFO L226 Difference]: Without dead ends: 0 [2018-11-14 17:35:14,732 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-14 17:35:14,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-14 17:35:14,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-14 17:35:14,732 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:35:14,733 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-14 17:35:14,733 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 17:35:14,733 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 17:35:14,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:14,734 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 17:35:14,734 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 17:35:14,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:14,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:14,735 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 17:35:14,735 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 17:35:14,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:14,735 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 17:35:14,735 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 17:35:14,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:14,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:14,736 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:35:14,736 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:35:14,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-14 17:35:14,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-14 17:35:14,736 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2018-11-14 17:35:14,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:35:14,736 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-14 17:35:14,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 17:35:14,737 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 17:35:14,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:14,742 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-14 17:35:14,824 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-14 17:35:14,824 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-14 17:35:14,824 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-14 17:35:14,824 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-14 17:35:14,824 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-14 17:35:14,824 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-14 17:35:14,825 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 10 19) the Hoare annotation is: true [2018-11-14 17:35:14,825 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 10 19) no Hoare annotation was computed. [2018-11-14 17:35:14,825 INFO L425 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2018-11-14 17:35:14,825 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 10 19) no Hoare annotation was computed. [2018-11-14 17:35:14,825 INFO L425 ceAbstractionStarter]: For program point L13-1(lines 13 16) no Hoare annotation was computed. [2018-11-14 17:35:14,825 INFO L425 ceAbstractionStarter]: For program point L13-2(line 13) no Hoare annotation was computed. [2018-11-14 17:35:14,825 INFO L425 ceAbstractionStarter]: For program point L13-4(lines 13 16) no Hoare annotation was computed. [2018-11-14 17:35:14,825 INFO L421 ceAbstractionStarter]: At program point L13-6(lines 13 16) the Hoare annotation is: (and (<= main_~y~0 main_~x~0) (<= 0 main_~y~0) (<= 1 main_~x~0)) [2018-11-14 17:35:14,826 INFO L421 ceAbstractionStarter]: At program point L13-7(lines 13 16) the Hoare annotation is: (<= main_~y~0 main_~x~0) [2018-11-14 17:35:14,826 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-14 17:35:14,826 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-14 17:35:14,826 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-14 17:35:14,826 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-14 17:35:14,826 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-14 17:35:14,827 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-14 17:35:14,828 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 17:35:14,830 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-14 17:35:14,830 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 17:35:14,830 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 17:35:14,830 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2018-11-14 17:35:14,850 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-14 17:35:14,850 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-14 17:35:14,850 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 17:35:14,850 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2018-11-14 17:35:14,850 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2018-11-14 17:35:14,851 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-14 17:35:14,851 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-14 17:35:14,851 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-14 17:35:14,851 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2018-11-14 17:35:14,851 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2018-11-14 17:35:14,851 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2018-11-14 17:35:14,851 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-14 17:35:14,852 WARN L170 areAnnotationChecker]: L13-4 has no Hoare annotation [2018-11-14 17:35:14,852 WARN L170 areAnnotationChecker]: L13-4 has no Hoare annotation [2018-11-14 17:35:14,852 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 17:35:14,852 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-14 17:35:14,852 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-14 17:35:14,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 05:35:14 BoogieIcfgContainer [2018-11-14 17:35:14,862 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-14 17:35:14,863 INFO L168 Benchmark]: Toolchain (without parser) took 4923.59 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 741.9 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -564.5 MB). Peak memory consumption was 177.3 MB. Max. memory is 7.1 GB. [2018-11-14 17:35:14,865 INFO L168 Benchmark]: CDTParser took 0.19 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-14 17:35:14,866 INFO L168 Benchmark]: CACSL2BoogieTranslator took 327.62 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-14 17:35:14,867 INFO L168 Benchmark]: Boogie Preprocessor took 32.37 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 17:35:14,868 INFO L168 Benchmark]: RCFGBuilder took 551.90 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 741.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -791.9 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2018-11-14 17:35:14,869 INFO L168 Benchmark]: TraceAbstraction took 4006.95 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: 216.8 MB). Peak memory consumption was 216.8 MB. Max. memory is 7.1 GB. [2018-11-14 17:35:14,873 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.19 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 327.62 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 Preprocessor took 32.37 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 551.90 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 741.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -791.9 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4006.95 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: 216.8 MB). Peak memory consumption was 216.8 MB. 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: 13]: Loop Invariant Derived loop invariant: (y <= x && 0 <= y) && 1 <= x - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 21 locations, 1 error locations. SAFE Result, 3.9s OverallTime, 4 OverallIterations, 3 TraceHistogramMax, 1.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 56 SDtfs, 10 SDslu, 116 SDs, 0 SdLazy, 42 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=3, 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, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 10 PreInvPairs, 14 NumberOfFragments, 18 HoareAnnotationTreeSize, 10 FomulaSimplifications, 26 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 6 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 99 NumberOfCodeBlocks, 99 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 93 ConstructedInterpolants, 0 QuantifiedInterpolants, 4209 SizeOfPredicates, 4 NumberOfNonLiveVariables, 93 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 0/32 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...