java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/for_bounded_loop1_false-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:01:39,185 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:01:39,187 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:01:39,204 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:01:39,204 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:01:39,205 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:01:39,209 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:01:39,211 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:01:39,214 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:01:39,216 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:01:39,217 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:01:39,218 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:01:39,219 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:01:39,223 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:01:39,224 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:01:39,226 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:01:39,226 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:01:39,231 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:01:39,238 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:01:39,240 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:01:39,247 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:01:39,249 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:01:39,252 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:01:39,252 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:01:39,252 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:01:39,254 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:01:39,255 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:01:39,258 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:01:39,260 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:01:39,261 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:01:39,261 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:01:39,263 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:01:39,264 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:01:39,264 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:01:39,267 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:01:39,268 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:01:39,268 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 13:01:39,285 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:01:39,286 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:01:39,286 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:01:39,287 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:01:39,287 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:01:39,287 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:01:39,288 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:01:39,288 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:01:39,288 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:01:39,288 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:01:39,289 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:01:39,289 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:01:39,289 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:01:39,289 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:01:39,289 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:01:39,289 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:01:39,290 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:01:39,290 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:01:39,290 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:01:39,290 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:01:39,290 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:01:39,291 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:01:39,291 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:01:39,291 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:01:39,291 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:01:39,291 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:01:39,292 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:01:39,292 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:01:39,292 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:01:39,292 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:01:39,292 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:01:39,354 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:01:39,372 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:01:39,377 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:01:39,378 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:01:39,379 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:01:39,379 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/for_bounded_loop1_false-unreach-call_true-termination.i [2018-11-23 13:01:39,445 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81ac0dbff/d53e8cc222694018b4f10a966d00ace5/FLAG1c9341d12 [2018-11-23 13:01:39,937 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:01:39,938 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/for_bounded_loop1_false-unreach-call_true-termination.i [2018-11-23 13:01:39,944 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81ac0dbff/d53e8cc222694018b4f10a966d00ace5/FLAG1c9341d12 [2018-11-23 13:01:40,301 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81ac0dbff/d53e8cc222694018b4f10a966d00ace5 [2018-11-23 13:01:40,310 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:01:40,311 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:01:40,312 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:01:40,312 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:01:40,316 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:01:40,318 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:01:40" (1/1) ... [2018-11-23 13:01:40,321 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76d9d738 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:01:40, skipping insertion in model container [2018-11-23 13:01:40,322 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:01:40" (1/1) ... [2018-11-23 13:01:40,331 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:01:40,357 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:01:40,618 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:01:40,623 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:01:40,644 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:01:40,663 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:01:40,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:01:40 WrapperNode [2018-11-23 13:01:40,664 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:01:40,665 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:01:40,666 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:01:40,666 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:01:40,676 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:01:40" (1/1) ... [2018-11-23 13:01:40,683 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:01:40" (1/1) ... [2018-11-23 13:01:40,691 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:01:40,692 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:01:40,692 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:01:40,692 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:01:40,703 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:01:40" (1/1) ... [2018-11-23 13:01:40,704 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:01:40" (1/1) ... [2018-11-23 13:01:40,705 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:01:40" (1/1) ... [2018-11-23 13:01:40,705 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:01:40" (1/1) ... [2018-11-23 13:01:40,714 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:01:40" (1/1) ... [2018-11-23 13:01:40,721 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:01:40" (1/1) ... [2018-11-23 13:01:40,723 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:01:40" (1/1) ... [2018-11-23 13:01:40,725 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:01:40,726 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:01:40,726 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:01:40,726 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:01:40,727 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:01:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:01:40,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:01:40,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:01:40,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:01:40,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:01:40,860 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:01:40,861 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:01:40,861 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:01:40,861 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:01:41,352 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:01:41,353 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 13:01:41,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:01:41 BoogieIcfgContainer [2018-11-23 13:01:41,353 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:01:41,354 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:01:41,355 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:01:41,358 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:01:41,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:01:40" (1/3) ... [2018-11-23 13:01:41,359 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17278493 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:01:41, skipping insertion in model container [2018-11-23 13:01:41,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:01:40" (2/3) ... [2018-11-23 13:01:41,360 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17278493 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:01:41, skipping insertion in model container [2018-11-23 13:01:41,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:01:41" (3/3) ... [2018-11-23 13:01:41,362 INFO L112 eAbstractionObserver]: Analyzing ICFG for_bounded_loop1_false-unreach-call_true-termination.i [2018-11-23 13:01:41,373 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:01:41,382 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:01:41,400 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:01:41,431 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:01:41,432 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:01:41,432 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:01:41,433 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:01:41,434 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:01:41,434 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:01:41,434 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:01:41,434 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:01:41,435 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:01:41,460 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-11-23 13:01:41,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 13:01:41,467 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:01:41,468 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:01:41,471 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:01:41,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:01:41,478 INFO L82 PathProgramCache]: Analyzing trace with hash 429908039, now seen corresponding path program 1 times [2018-11-23 13:01:41,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:01:41,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:01:41,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:41,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:01:41,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:41,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:01:42,180 INFO L256 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {26#true} is VALID [2018-11-23 13:01:42,184 INFO L273 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID [2018-11-23 13:01:42,185 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #43#return; {26#true} is VALID [2018-11-23 13:01:42,185 INFO L256 TraceCheckUtils]: 3: Hoare triple {26#true} call #t~ret4 := main(); {26#true} is VALID [2018-11-23 13:01:42,187 INFO L273 TraceCheckUtils]: 4: Hoare triple {26#true} ~i~0 := 0;~x~0 := 0;~y~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {28#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} is VALID [2018-11-23 13:01:42,195 INFO L273 TraceCheckUtils]: 5: Hoare triple {28#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} assume !!(~n~0 > 0);~i~0 := 0; {28#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} is VALID [2018-11-23 13:01:42,200 INFO L273 TraceCheckUtils]: 6: Hoare triple {28#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} assume !!(~i~0 < ~n~0);~x~0 := ~x~0 - ~y~0; {29#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:01:42,210 INFO L256 TraceCheckUtils]: 7: Hoare triple {29#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); {30#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:01:42,217 INFO L273 TraceCheckUtils]: 8: Hoare triple {30#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {31#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:01:42,221 INFO L273 TraceCheckUtils]: 9: Hoare triple {31#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {27#false} is VALID [2018-11-23 13:01:42,221 INFO L273 TraceCheckUtils]: 10: Hoare triple {27#false} assume !false; {27#false} is VALID [2018-11-23 13:01:42,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:01:42,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:01:42,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 13:01:42,234 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2018-11-23 13:01:42,238 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:01:42,242 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:01:42,292 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-23 13:01:42,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:01:42,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:01:42,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:01:42,303 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 6 states. [2018-11-23 13:01:43,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:43,332 INFO L93 Difference]: Finished difference Result 50 states and 70 transitions. [2018-11-23 13:01:43,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:01:43,333 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2018-11-23 13:01:43,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:01:43,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:01:43,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 70 transitions. [2018-11-23 13:01:43,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:01:43,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 70 transitions. [2018-11-23 13:01:43,356 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 70 transitions. [2018-11-23 13:01:43,573 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:01:43,585 INFO L225 Difference]: With dead ends: 50 [2018-11-23 13:01:43,586 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 13:01:43,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:01:43,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 13:01:43,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2018-11-23 13:01:43,660 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:01:43,661 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 24 states. [2018-11-23 13:01:43,662 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 24 states. [2018-11-23 13:01:43,662 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 24 states. [2018-11-23 13:01:43,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:43,668 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2018-11-23 13:01:43,668 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-11-23 13:01:43,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:01:43,669 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:01:43,669 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 26 states. [2018-11-23 13:01:43,669 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 26 states. [2018-11-23 13:01:43,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:43,674 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2018-11-23 13:01:43,674 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-11-23 13:01:43,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:01:43,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:01:43,675 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:01:43,676 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:01:43,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 13:01:43,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-11-23 13:01:43,680 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 11 [2018-11-23 13:01:43,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:01:43,681 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-11-23 13:01:43,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:01:43,681 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-23 13:01:43,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 13:01:43,682 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:01:43,682 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:01:43,683 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:01:43,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:01:43,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1060899037, now seen corresponding path program 1 times [2018-11-23 13:01:43,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:01:43,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:01:43,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:43,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:01:43,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:43,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:01:43,986 INFO L256 TraceCheckUtils]: 0: Hoare triple {193#true} call ULTIMATE.init(); {193#true} is VALID [2018-11-23 13:01:43,987 INFO L273 TraceCheckUtils]: 1: Hoare triple {193#true} assume true; {193#true} is VALID [2018-11-23 13:01:43,987 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {193#true} {193#true} #43#return; {193#true} is VALID [2018-11-23 13:01:43,987 INFO L256 TraceCheckUtils]: 3: Hoare triple {193#true} call #t~ret4 := main(); {193#true} is VALID [2018-11-23 13:01:43,988 INFO L273 TraceCheckUtils]: 4: Hoare triple {193#true} ~i~0 := 0;~x~0 := 0;~y~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {193#true} is VALID [2018-11-23 13:01:43,988 INFO L273 TraceCheckUtils]: 5: Hoare triple {193#true} assume !!(~n~0 > 0);~i~0 := 0; {193#true} is VALID [2018-11-23 13:01:43,988 INFO L273 TraceCheckUtils]: 6: Hoare triple {193#true} assume !!(~i~0 < ~n~0);~x~0 := ~x~0 - ~y~0; {193#true} is VALID [2018-11-23 13:01:43,989 INFO L256 TraceCheckUtils]: 7: Hoare triple {193#true} call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); {193#true} is VALID [2018-11-23 13:01:43,990 INFO L273 TraceCheckUtils]: 8: Hoare triple {193#true} ~cond := #in~cond; {195#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-23 13:01:43,990 INFO L273 TraceCheckUtils]: 9: Hoare triple {195#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(0 == ~cond); {196#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:01:43,991 INFO L273 TraceCheckUtils]: 10: Hoare triple {196#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {196#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:01:43,996 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {196#(not (= |__VERIFIER_assert_#in~cond| 0))} {193#true} #47#return; {197#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:01:43,997 INFO L273 TraceCheckUtils]: 12: Hoare triple {197#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~y~0 := #t~nondet3;havoc #t~nondet3; {198#(and (or (<= 0 main_~x~0) (<= main_~y~0 0)) (or (< 0 (+ main_~y~0 1)) (<= main_~x~0 0)))} is VALID [2018-11-23 13:01:43,999 INFO L273 TraceCheckUtils]: 13: Hoare triple {198#(and (or (<= 0 main_~x~0) (<= main_~y~0 0)) (or (< 0 (+ main_~y~0 1)) (<= main_~x~0 0)))} assume !!(0 != ~y~0);~x~0 := ~x~0 + ~y~0; {199#(or (<= (+ main_~x~0 1) 0) (<= 1 main_~x~0))} is VALID [2018-11-23 13:01:44,000 INFO L256 TraceCheckUtils]: 14: Hoare triple {199#(or (<= (+ main_~x~0 1) 0) (<= 1 main_~x~0))} call __VERIFIER_assert((if 0 != ~x~0 then 1 else 0)); {196#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:01:44,002 INFO L273 TraceCheckUtils]: 15: Hoare triple {196#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {200#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-23 13:01:44,005 INFO L273 TraceCheckUtils]: 16: Hoare triple {200#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {194#false} is VALID [2018-11-23 13:01:44,006 INFO L273 TraceCheckUtils]: 17: Hoare triple {194#false} assume !false; {194#false} is VALID [2018-11-23 13:01:44,010 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:01:44,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:01:44,011 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:01:44,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:01:44,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:01:44,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:01:44,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:01:44,457 INFO L256 TraceCheckUtils]: 0: Hoare triple {193#true} call ULTIMATE.init(); {193#true} is VALID [2018-11-23 13:01:44,458 INFO L273 TraceCheckUtils]: 1: Hoare triple {193#true} assume true; {193#true} is VALID [2018-11-23 13:01:44,459 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {193#true} {193#true} #43#return; {193#true} is VALID [2018-11-23 13:01:44,459 INFO L256 TraceCheckUtils]: 3: Hoare triple {193#true} call #t~ret4 := main(); {193#true} is VALID [2018-11-23 13:01:44,460 INFO L273 TraceCheckUtils]: 4: Hoare triple {193#true} ~i~0 := 0;~x~0 := 0;~y~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {216#(and (= main_~y~0 0) (= main_~x~0 0))} is VALID [2018-11-23 13:01:44,460 INFO L273 TraceCheckUtils]: 5: Hoare triple {216#(and (= main_~y~0 0) (= main_~x~0 0))} assume !!(~n~0 > 0);~i~0 := 0; {216#(and (= main_~y~0 0) (= main_~x~0 0))} is VALID [2018-11-23 13:01:44,479 INFO L273 TraceCheckUtils]: 6: Hoare triple {216#(and (= main_~y~0 0) (= main_~x~0 0))} assume !!(~i~0 < ~n~0);~x~0 := ~x~0 - ~y~0; {197#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:01:44,479 INFO L256 TraceCheckUtils]: 7: Hoare triple {197#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); {193#true} is VALID [2018-11-23 13:01:44,494 INFO L273 TraceCheckUtils]: 8: Hoare triple {193#true} ~cond := #in~cond; {195#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-23 13:01:44,501 INFO L273 TraceCheckUtils]: 9: Hoare triple {195#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(0 == ~cond); {196#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:01:44,502 INFO L273 TraceCheckUtils]: 10: Hoare triple {196#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {196#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:01:44,503 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {196#(not (= |__VERIFIER_assert_#in~cond| 0))} {197#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #47#return; {197#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:01:44,503 INFO L273 TraceCheckUtils]: 12: Hoare triple {197#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~y~0 := #t~nondet3;havoc #t~nondet3; {197#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:01:44,504 INFO L273 TraceCheckUtils]: 13: Hoare triple {197#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(0 != ~y~0);~x~0 := ~x~0 + ~y~0; {199#(or (<= (+ main_~x~0 1) 0) (<= 1 main_~x~0))} is VALID [2018-11-23 13:01:44,506 INFO L256 TraceCheckUtils]: 14: Hoare triple {199#(or (<= (+ main_~x~0 1) 0) (<= 1 main_~x~0))} call __VERIFIER_assert((if 0 != ~x~0 then 1 else 0)); {247#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:01:44,524 INFO L273 TraceCheckUtils]: 15: Hoare triple {247#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {251#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:01:44,538 INFO L273 TraceCheckUtils]: 16: Hoare triple {251#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {194#false} is VALID [2018-11-23 13:01:44,538 INFO L273 TraceCheckUtils]: 17: Hoare triple {194#false} assume !false; {194#false} is VALID [2018-11-23 13:01:44,540 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:01:44,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:01:44,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 11 [2018-11-23 13:01:44,569 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-11-23 13:01:44,570 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:01:44,570 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 13:01:44,627 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:01:44,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 13:01:44,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 13:01:44,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:01:44,629 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 11 states. [2018-11-23 13:01:45,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:45,294 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-11-23 13:01:45,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 13:01:45,294 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-11-23 13:01:45,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:01:45,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:01:45,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 30 transitions. [2018-11-23 13:01:45,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:01:45,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 30 transitions. [2018-11-23 13:01:45,301 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 30 transitions. [2018-11-23 13:01:45,363 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-23 13:01:45,365 INFO L225 Difference]: With dead ends: 36 [2018-11-23 13:01:45,367 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 13:01:45,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-11-23 13:01:45,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 13:01:45,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. [2018-11-23 13:01:45,415 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:01:45,415 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 26 states. [2018-11-23 13:01:45,416 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 26 states. [2018-11-23 13:01:45,416 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 26 states. [2018-11-23 13:01:45,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:45,419 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-11-23 13:01:45,419 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-11-23 13:01:45,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:01:45,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:01:45,420 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 32 states. [2018-11-23 13:01:45,421 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 32 states. [2018-11-23 13:01:45,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:45,424 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-11-23 13:01:45,424 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-11-23 13:01:45,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:01:45,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:01:45,425 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:01:45,425 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:01:45,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 13:01:45,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-11-23 13:01:45,427 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 18 [2018-11-23 13:01:45,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:01:45,428 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-11-23 13:01:45,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 13:01:45,428 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-23 13:01:45,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 13:01:45,429 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:01:45,429 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:01:45,430 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:01:45,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:01:45,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1415691032, now seen corresponding path program 1 times [2018-11-23 13:01:45,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:01:45,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:01:45,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:45,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:01:45,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:45,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:01:45,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:01:45,479 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #43#return; [?] CALL call #t~ret4 := main(); [?] ~i~0 := 0;~x~0 := 0;~y~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; VAL [main_~i~0=0, main_~n~0=1, main_~x~0=0, main_~y~0=0] [?] assume !!(~n~0 > 0);~i~0 := 0; VAL [main_~i~0=0, main_~n~0=1, main_~x~0=0, main_~y~0=0] [?] assume !!(~i~0 < ~n~0);~x~0 := ~x~0 - ~y~0; VAL [main_~i~0=0, main_~n~0=1, main_~x~0=0, main_~y~0=0] [?] CALL call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=1] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] assume !(0 == ~cond); VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] assume true; VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] RET #47#return; VAL [main_~i~0=0, main_~n~0=1, main_~x~0=0, main_~y~0=0] [?] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~y~0 := #t~nondet3;havoc #t~nondet3; VAL [main_~i~0=0, main_~n~0=1, main_~x~0=0, main_~y~0=1] [?] assume !!(0 != ~y~0);~x~0 := ~x~0 + ~y~0; VAL [main_~i~0=0, main_~n~0=1, main_~x~0=1, main_~y~0=1] [?] CALL call __VERIFIER_assert((if 0 != ~x~0 then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=1] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] assume !(0 == ~cond); VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] assume true; VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] RET #49#return; VAL [main_~i~0=0, main_~n~0=1, main_~x~0=1, main_~y~0=1] [?] #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; VAL [main_~i~0=1, main_~n~0=1, main_~x~0=1, main_~y~0=1] [?] assume !(~i~0 < ~n~0); VAL [main_~i~0=1, main_~n~0=1, main_~x~0=1, main_~y~0=1] [?] CALL call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=0] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L14] ~i~0 := 0; [L14] ~x~0 := 0; [L14] ~y~0 := 0; [L15] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L15] ~n~0 := #t~nondet1; [L15] havoc #t~nondet1; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L16] assume !!(~n~0 > 0); [L17] ~i~0 := 0; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L17-L25] assume !!(~i~0 < ~n~0); [L19] ~x~0 := ~x~0 - ~y~0; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L20] CALL call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [#in~cond=1] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L5-L7] assume !(0 == ~cond); VAL [#in~cond=1, ~cond=1] [L4-L9] ensures true; VAL [#in~cond=1, ~cond=1] [L20] RET call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L21] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L21] ~y~0 := #t~nondet3; [L21] havoc #t~nondet3; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=1] [L22] assume !!(0 != ~y~0); [L23] ~x~0 := ~x~0 + ~y~0; VAL [~i~0=0, ~n~0=1, ~x~0=1, ~y~0=1] [L24] CALL call __VERIFIER_assert((if 0 != ~x~0 then 1 else 0)); VAL [#in~cond=1] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L5-L7] assume !(0 == ~cond); VAL [#in~cond=1, ~cond=1] [L4-L9] ensures true; VAL [#in~cond=1, ~cond=1] [L24] RET call __VERIFIER_assert((if 0 != ~x~0 then 1 else 0)); VAL [~i~0=0, ~n~0=1, ~x~0=1, ~y~0=1] [L17] #t~post2 := ~i~0; [L17] ~i~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~i~0=1, ~n~0=1, ~x~0=1, ~y~0=1] [L17-L25] assume !(~i~0 < ~n~0); VAL [~i~0=1, ~n~0=1, ~x~0=1, ~y~0=1] [L26] CALL call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [#in~cond=0] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L5-L7] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L6] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L14] ~i~0 := 0; [L14] ~x~0 := 0; [L14] ~y~0 := 0; [L15] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L15] ~n~0 := #t~nondet1; [L15] havoc #t~nondet1; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L16] assume !!(~n~0 > 0); [L17] ~i~0 := 0; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L17-L25] assume !!(~i~0 < ~n~0); [L19] ~x~0 := ~x~0 - ~y~0; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L20] CALL call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [#in~cond=1] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L5-L7] assume !(0 == ~cond); VAL [#in~cond=1, ~cond=1] [L4-L9] ensures true; VAL [#in~cond=1, ~cond=1] [L20] RET call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L21] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L21] ~y~0 := #t~nondet3; [L21] havoc #t~nondet3; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=1] [L22] assume !!(0 != ~y~0); [L23] ~x~0 := ~x~0 + ~y~0; VAL [~i~0=0, ~n~0=1, ~x~0=1, ~y~0=1] [L24] CALL call __VERIFIER_assert((if 0 != ~x~0 then 1 else 0)); VAL [#in~cond=1] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L5-L7] assume !(0 == ~cond); VAL [#in~cond=1, ~cond=1] [L4-L9] ensures true; VAL [#in~cond=1, ~cond=1] [L24] RET call __VERIFIER_assert((if 0 != ~x~0 then 1 else 0)); VAL [~i~0=0, ~n~0=1, ~x~0=1, ~y~0=1] [L17] #t~post2 := ~i~0; [L17] ~i~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~i~0=1, ~n~0=1, ~x~0=1, ~y~0=1] [L17-L25] assume !(~i~0 < ~n~0); VAL [~i~0=1, ~n~0=1, ~x~0=1, ~y~0=1] [L26] CALL call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [#in~cond=0] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L5-L7] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L6] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L14] ~i~0 := 0; [L14] ~x~0 := 0; [L14] ~y~0 := 0; [L15] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L15] ~n~0 := #t~nondet1; [L15] havoc #t~nondet1; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L16] COND FALSE !(!(~n~0 > 0)) [L17] ~i~0 := 0; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L17-L25] COND FALSE !(!(~i~0 < ~n~0)) [L19] ~x~0 := ~x~0 - ~y~0; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L20] CALL call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [#in~cond=1] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L5] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L20] RET call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L21] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L21] ~y~0 := #t~nondet3; [L21] havoc #t~nondet3; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=1] [L22] COND FALSE !(!(0 != ~y~0)) [L23] ~x~0 := ~x~0 + ~y~0; VAL [~i~0=0, ~n~0=1, ~x~0=1, ~y~0=1] [L24] CALL call __VERIFIER_assert((if 0 != ~x~0 then 1 else 0)); VAL [#in~cond=1] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L5] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L24] RET call __VERIFIER_assert((if 0 != ~x~0 then 1 else 0)); VAL [~i~0=0, ~n~0=1, ~x~0=1, ~y~0=1] [L17] #t~post2 := ~i~0; [L17] ~i~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~i~0=1, ~n~0=1, ~x~0=1, ~y~0=1] [L17-L25] COND TRUE !(~i~0 < ~n~0) VAL [~i~0=1, ~n~0=1, ~x~0=1, ~y~0=1] [L26] CALL call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [#in~cond=0] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L5] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L6] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L14] ~i~0 := 0; [L14] ~x~0 := 0; [L14] ~y~0 := 0; [L15] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L15] ~n~0 := #t~nondet1; [L15] havoc #t~nondet1; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L16] COND FALSE !(!(~n~0 > 0)) [L17] ~i~0 := 0; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L17-L25] COND FALSE !(!(~i~0 < ~n~0)) [L19] ~x~0 := ~x~0 - ~y~0; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L20] CALL call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [#in~cond=1] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L5] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L20] RET call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L21] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L21] ~y~0 := #t~nondet3; [L21] havoc #t~nondet3; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=1] [L22] COND FALSE !(!(0 != ~y~0)) [L23] ~x~0 := ~x~0 + ~y~0; VAL [~i~0=0, ~n~0=1, ~x~0=1, ~y~0=1] [L24] CALL call __VERIFIER_assert((if 0 != ~x~0 then 1 else 0)); VAL [#in~cond=1] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L5] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L24] RET call __VERIFIER_assert((if 0 != ~x~0 then 1 else 0)); VAL [~i~0=0, ~n~0=1, ~x~0=1, ~y~0=1] [L17] #t~post2 := ~i~0; [L17] ~i~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~i~0=1, ~n~0=1, ~x~0=1, ~y~0=1] [L17-L25] COND TRUE !(~i~0 < ~n~0) VAL [~i~0=1, ~n~0=1, ~x~0=1, ~y~0=1] [L26] CALL call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [#in~cond=0] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L5] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L6] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L14] ~i~0 := 0; [L14] ~x~0 := 0; [L14] ~y~0 := 0; [L15] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L15] ~n~0 := #t~nondet1; [L15] havoc #t~nondet1; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L16] COND FALSE !(!(~n~0 > 0)) [L17] ~i~0 := 0; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L17-L25] COND FALSE !(!(~i~0 < ~n~0)) [L19] ~x~0 := ~x~0 - ~y~0; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L20] CALL call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [#in~cond=1] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L5] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L20] RET call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L21] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L21] ~y~0 := #t~nondet3; [L21] havoc #t~nondet3; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=1] [L22] COND FALSE !(!(0 != ~y~0)) [L23] ~x~0 := ~x~0 + ~y~0; VAL [~i~0=0, ~n~0=1, ~x~0=1, ~y~0=1] [L24] CALL call __VERIFIER_assert((if 0 != ~x~0 then 1 else 0)); VAL [#in~cond=1] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L5] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L24] RET call __VERIFIER_assert((if 0 != ~x~0 then 1 else 0)); VAL [~i~0=0, ~n~0=1, ~x~0=1, ~y~0=1] [L17] #t~post2 := ~i~0; [L17] ~i~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~i~0=1, ~n~0=1, ~x~0=1, ~y~0=1] [L17-L25] COND TRUE !(~i~0 < ~n~0) VAL [~i~0=1, ~n~0=1, ~x~0=1, ~y~0=1] [L26] CALL call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [#in~cond=0] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L5] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L6] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L14] ~i~0 := 0; [L14] ~x~0 := 0; [L14] ~y~0 := 0; [L15] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L15] ~n~0 := #t~nondet1; [L15] havoc #t~nondet1; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L16] COND FALSE !(!(~n~0 > 0)) [L17] ~i~0 := 0; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L17-L25] COND FALSE !(!(~i~0 < ~n~0)) [L19] ~x~0 := ~x~0 - ~y~0; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L20] CALL call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [#in~cond=1] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L5] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L20] RET call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L21] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L21] ~y~0 := #t~nondet3; [L21] havoc #t~nondet3; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=1] [L22] COND FALSE !(!(0 != ~y~0)) [L23] ~x~0 := ~x~0 + ~y~0; VAL [~i~0=0, ~n~0=1, ~x~0=1, ~y~0=1] [L24] CALL call __VERIFIER_assert((if 0 != ~x~0 then 1 else 0)); VAL [#in~cond=1] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L5] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L24] RET call __VERIFIER_assert((if 0 != ~x~0 then 1 else 0)); VAL [~i~0=0, ~n~0=1, ~x~0=1, ~y~0=1] [L17] #t~post2 := ~i~0; [L17] ~i~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~i~0=1, ~n~0=1, ~x~0=1, ~y~0=1] [L17-L25] COND TRUE !(~i~0 < ~n~0) VAL [~i~0=1, ~n~0=1, ~x~0=1, ~y~0=1] [L26] CALL call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [#in~cond=0] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L5] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L6] assert false; VAL [#in~cond=0, ~cond=0] [L14] int i=0, x=0, y=0; [L15] int n=__VERIFIER_nondet_int(); [L16] COND FALSE !(!(n>0)) [L17] i=0 VAL [i=0, n=1, x=0, y=0] [L17] COND TRUE i 0);~i~0 := 0; VAL [main_~i~0=0, main_~n~0=1, main_~x~0=0, main_~y~0=0] [?] assume !!(~i~0 < ~n~0);~x~0 := ~x~0 - ~y~0; VAL [main_~i~0=0, main_~n~0=1, main_~x~0=0, main_~y~0=0] [?] CALL call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=1] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] assume !(0 == ~cond); VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] assume true; VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] RET #47#return; VAL [main_~i~0=0, main_~n~0=1, main_~x~0=0, main_~y~0=0] [?] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~y~0 := #t~nondet3;havoc #t~nondet3; VAL [main_~i~0=0, main_~n~0=1, main_~x~0=0, main_~y~0=1] [?] assume !!(0 != ~y~0);~x~0 := ~x~0 + ~y~0; VAL [main_~i~0=0, main_~n~0=1, main_~x~0=1, main_~y~0=1] [?] CALL call __VERIFIER_assert((if 0 != ~x~0 then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=1] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] assume !(0 == ~cond); VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] assume true; VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] RET #49#return; VAL [main_~i~0=0, main_~n~0=1, main_~x~0=1, main_~y~0=1] [?] #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; VAL [main_~i~0=1, main_~n~0=1, main_~x~0=1, main_~y~0=1] [?] assume !(~i~0 < ~n~0); VAL [main_~i~0=1, main_~n~0=1, main_~x~0=1, main_~y~0=1] [?] CALL call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=0] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L14] ~i~0 := 0; [L14] ~x~0 := 0; [L14] ~y~0 := 0; [L15] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L15] ~n~0 := #t~nondet1; [L15] havoc #t~nondet1; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L16] assume !!(~n~0 > 0); [L17] ~i~0 := 0; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L17-L25] assume !!(~i~0 < ~n~0); [L19] ~x~0 := ~x~0 - ~y~0; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L20] CALL call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [#in~cond=1] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L5-L7] assume !(0 == ~cond); VAL [#in~cond=1, ~cond=1] [L4-L9] ensures true; VAL [#in~cond=1, ~cond=1] [L20] RET call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L21] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L21] ~y~0 := #t~nondet3; [L21] havoc #t~nondet3; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=1] [L22] assume !!(0 != ~y~0); [L23] ~x~0 := ~x~0 + ~y~0; VAL [~i~0=0, ~n~0=1, ~x~0=1, ~y~0=1] [L24] CALL call __VERIFIER_assert((if 0 != ~x~0 then 1 else 0)); VAL [#in~cond=1] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L5-L7] assume !(0 == ~cond); VAL [#in~cond=1, ~cond=1] [L4-L9] ensures true; VAL [#in~cond=1, ~cond=1] [L24] RET call __VERIFIER_assert((if 0 != ~x~0 then 1 else 0)); VAL [~i~0=0, ~n~0=1, ~x~0=1, ~y~0=1] [L17] #t~post2 := ~i~0; [L17] ~i~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~i~0=1, ~n~0=1, ~x~0=1, ~y~0=1] [L17-L25] assume !(~i~0 < ~n~0); VAL [~i~0=1, ~n~0=1, ~x~0=1, ~y~0=1] [L26] CALL call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [#in~cond=0] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L5-L7] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L6] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L14] ~i~0 := 0; [L14] ~x~0 := 0; [L14] ~y~0 := 0; [L15] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L15] ~n~0 := #t~nondet1; [L15] havoc #t~nondet1; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L16] assume !!(~n~0 > 0); [L17] ~i~0 := 0; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L17-L25] assume !!(~i~0 < ~n~0); [L19] ~x~0 := ~x~0 - ~y~0; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L20] CALL call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [#in~cond=1] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L5-L7] assume !(0 == ~cond); VAL [#in~cond=1, ~cond=1] [L4-L9] ensures true; VAL [#in~cond=1, ~cond=1] [L20] RET call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L21] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L21] ~y~0 := #t~nondet3; [L21] havoc #t~nondet3; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=1] [L22] assume !!(0 != ~y~0); [L23] ~x~0 := ~x~0 + ~y~0; VAL [~i~0=0, ~n~0=1, ~x~0=1, ~y~0=1] [L24] CALL call __VERIFIER_assert((if 0 != ~x~0 then 1 else 0)); VAL [#in~cond=1] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L5-L7] assume !(0 == ~cond); VAL [#in~cond=1, ~cond=1] [L4-L9] ensures true; VAL [#in~cond=1, ~cond=1] [L24] RET call __VERIFIER_assert((if 0 != ~x~0 then 1 else 0)); VAL [~i~0=0, ~n~0=1, ~x~0=1, ~y~0=1] [L17] #t~post2 := ~i~0; [L17] ~i~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~i~0=1, ~n~0=1, ~x~0=1, ~y~0=1] [L17-L25] assume !(~i~0 < ~n~0); VAL [~i~0=1, ~n~0=1, ~x~0=1, ~y~0=1] [L26] CALL call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [#in~cond=0] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L5-L7] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L6] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L14] ~i~0 := 0; [L14] ~x~0 := 0; [L14] ~y~0 := 0; [L15] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L15] ~n~0 := #t~nondet1; [L15] havoc #t~nondet1; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L16] COND FALSE !(!(~n~0 > 0)) [L17] ~i~0 := 0; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L17-L25] COND FALSE !(!(~i~0 < ~n~0)) [L19] ~x~0 := ~x~0 - ~y~0; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L20] CALL call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [#in~cond=1] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L5] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L20] RET call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L21] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L21] ~y~0 := #t~nondet3; [L21] havoc #t~nondet3; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=1] [L22] COND FALSE !(!(0 != ~y~0)) [L23] ~x~0 := ~x~0 + ~y~0; VAL [~i~0=0, ~n~0=1, ~x~0=1, ~y~0=1] [L24] CALL call __VERIFIER_assert((if 0 != ~x~0 then 1 else 0)); VAL [#in~cond=1] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L5] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L24] RET call __VERIFIER_assert((if 0 != ~x~0 then 1 else 0)); VAL [~i~0=0, ~n~0=1, ~x~0=1, ~y~0=1] [L17] #t~post2 := ~i~0; [L17] ~i~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~i~0=1, ~n~0=1, ~x~0=1, ~y~0=1] [L17-L25] COND TRUE !(~i~0 < ~n~0) VAL [~i~0=1, ~n~0=1, ~x~0=1, ~y~0=1] [L26] CALL call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [#in~cond=0] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L5] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L6] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L14] ~i~0 := 0; [L14] ~x~0 := 0; [L14] ~y~0 := 0; [L15] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L15] ~n~0 := #t~nondet1; [L15] havoc #t~nondet1; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L16] COND FALSE !(!(~n~0 > 0)) [L17] ~i~0 := 0; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L17-L25] COND FALSE !(!(~i~0 < ~n~0)) [L19] ~x~0 := ~x~0 - ~y~0; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L20] CALL call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [#in~cond=1] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L5] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L20] RET call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L21] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L21] ~y~0 := #t~nondet3; [L21] havoc #t~nondet3; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=1] [L22] COND FALSE !(!(0 != ~y~0)) [L23] ~x~0 := ~x~0 + ~y~0; VAL [~i~0=0, ~n~0=1, ~x~0=1, ~y~0=1] [L24] CALL call __VERIFIER_assert((if 0 != ~x~0 then 1 else 0)); VAL [#in~cond=1] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L5] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L24] RET call __VERIFIER_assert((if 0 != ~x~0 then 1 else 0)); VAL [~i~0=0, ~n~0=1, ~x~0=1, ~y~0=1] [L17] #t~post2 := ~i~0; [L17] ~i~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~i~0=1, ~n~0=1, ~x~0=1, ~y~0=1] [L17-L25] COND TRUE !(~i~0 < ~n~0) VAL [~i~0=1, ~n~0=1, ~x~0=1, ~y~0=1] [L26] CALL call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [#in~cond=0] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L5] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L6] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L14] ~i~0 := 0; [L14] ~x~0 := 0; [L14] ~y~0 := 0; [L15] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L15] ~n~0 := #t~nondet1; [L15] havoc #t~nondet1; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L16] COND FALSE !(!(~n~0 > 0)) [L17] ~i~0 := 0; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L17-L25] COND FALSE !(!(~i~0 < ~n~0)) [L19] ~x~0 := ~x~0 - ~y~0; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L20] CALL call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [#in~cond=1] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L5] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L20] RET call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L21] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L21] ~y~0 := #t~nondet3; [L21] havoc #t~nondet3; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=1] [L22] COND FALSE !(!(0 != ~y~0)) [L23] ~x~0 := ~x~0 + ~y~0; VAL [~i~0=0, ~n~0=1, ~x~0=1, ~y~0=1] [L24] CALL call __VERIFIER_assert((if 0 != ~x~0 then 1 else 0)); VAL [#in~cond=1] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L5] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L24] RET call __VERIFIER_assert((if 0 != ~x~0 then 1 else 0)); VAL [~i~0=0, ~n~0=1, ~x~0=1, ~y~0=1] [L17] #t~post2 := ~i~0; [L17] ~i~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~i~0=1, ~n~0=1, ~x~0=1, ~y~0=1] [L17-L25] COND TRUE !(~i~0 < ~n~0) VAL [~i~0=1, ~n~0=1, ~x~0=1, ~y~0=1] [L26] CALL call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [#in~cond=0] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L5] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L6] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L14] ~i~0 := 0; [L14] ~x~0 := 0; [L14] ~y~0 := 0; [L15] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L15] ~n~0 := #t~nondet1; [L15] havoc #t~nondet1; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L16] COND FALSE !(!(~n~0 > 0)) [L17] ~i~0 := 0; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L17-L25] COND FALSE !(!(~i~0 < ~n~0)) [L19] ~x~0 := ~x~0 - ~y~0; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L20] CALL call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [#in~cond=1] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L5] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L20] RET call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=0] [L21] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L21] ~y~0 := #t~nondet3; [L21] havoc #t~nondet3; VAL [~i~0=0, ~n~0=1, ~x~0=0, ~y~0=1] [L22] COND FALSE !(!(0 != ~y~0)) [L23] ~x~0 := ~x~0 + ~y~0; VAL [~i~0=0, ~n~0=1, ~x~0=1, ~y~0=1] [L24] CALL call __VERIFIER_assert((if 0 != ~x~0 then 1 else 0)); VAL [#in~cond=1] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L5] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L24] RET call __VERIFIER_assert((if 0 != ~x~0 then 1 else 0)); VAL [~i~0=0, ~n~0=1, ~x~0=1, ~y~0=1] [L17] #t~post2 := ~i~0; [L17] ~i~0 := 1 + #t~post2; [L17] havoc #t~post2; VAL [~i~0=1, ~n~0=1, ~x~0=1, ~y~0=1] [L17-L25] COND TRUE !(~i~0 < ~n~0) VAL [~i~0=1, ~n~0=1, ~x~0=1, ~y~0=1] [L26] CALL call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [#in~cond=0] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L5] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L6] assert false; VAL [#in~cond=0, ~cond=0] [L14] int i=0, x=0, y=0; [L15] int n=__VERIFIER_nondet_int(); [L16] COND FALSE !(!(n>0)) [L17] i=0 VAL [i=0, n=1, x=0, y=0] [L17] COND TRUE i0)) [L17] i=0 VAL [i=0, n=1, x=0, y=0] [L17] COND TRUE i