./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive/BallRajamani-SPIN2000-Fig1_false-unreach-call_true-no-overflow_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e1dbfa53-b574-40b2-9227-004a45d16d8c/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e1dbfa53-b574-40b2-9227-004a45d16d8c/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e1dbfa53-b574-40b2-9227-004a45d16d8c/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e1dbfa53-b574-40b2-9227-004a45d16d8c/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/recursive/BallRajamani-SPIN2000-Fig1_false-unreach-call_true-no-overflow_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_e1dbfa53-b574-40b2-9227-004a45d16d8c/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e1dbfa53-b574-40b2-9227-004a45d16d8c/bin-2019/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ccae6f392e1d87c0b193f39dee91a5c51306cb93 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 02:44:06,981 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 02:44:06,982 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 02:44:06,990 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 02:44:06,990 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 02:44:06,990 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 02:44:06,991 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 02:44:06,992 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 02:44:06,993 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 02:44:06,994 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 02:44:06,995 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 02:44:06,995 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 02:44:06,995 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 02:44:06,996 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 02:44:06,997 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 02:44:06,997 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 02:44:06,998 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 02:44:06,999 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 02:44:07,001 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 02:44:07,002 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 02:44:07,003 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 02:44:07,003 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 02:44:07,005 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 02:44:07,005 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 02:44:07,005 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 02:44:07,006 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 02:44:07,007 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 02:44:07,007 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 02:44:07,008 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 02:44:07,009 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 02:44:07,009 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 02:44:07,009 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 02:44:07,010 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 02:44:07,010 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 02:44:07,010 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 02:44:07,011 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 02:44:07,011 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e1dbfa53-b574-40b2-9227-004a45d16d8c/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-23 02:44:07,021 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 02:44:07,021 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 02:44:07,022 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 02:44:07,022 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-23 02:44:07,022 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 02:44:07,022 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 02:44:07,022 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 02:44:07,023 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 02:44:07,023 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 02:44:07,023 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 02:44:07,023 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 02:44:07,023 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 02:44:07,023 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 02:44:07,023 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 02:44:07,023 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 02:44:07,024 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 02:44:07,024 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 02:44:07,024 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 02:44:07,024 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 02:44:07,024 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 02:44:07,024 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 02:44:07,024 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 02:44:07,025 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 02:44:07,025 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 02:44:07,025 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 02:44:07,025 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 02:44:07,025 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-23 02:44:07,025 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 02:44:07,025 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 02:44:07,025 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_e1dbfa53-b574-40b2-9227-004a45d16d8c/bin-2019/ukojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ccae6f392e1d87c0b193f39dee91a5c51306cb93 [2018-11-23 02:44:07,047 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 02:44:07,055 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 02:44:07,057 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 02:44:07,057 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 02:44:07,058 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 02:44:07,058 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e1dbfa53-b574-40b2-9227-004a45d16d8c/bin-2019/ukojak/../../sv-benchmarks/c/recursive/BallRajamani-SPIN2000-Fig1_false-unreach-call_true-no-overflow_true-termination.c [2018-11-23 02:44:07,095 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e1dbfa53-b574-40b2-9227-004a45d16d8c/bin-2019/ukojak/data/95648e4e7/41f74cee76f945aeb274f48fe6f30188/FLAGc0ccb1112 [2018-11-23 02:44:07,494 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 02:44:07,494 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e1dbfa53-b574-40b2-9227-004a45d16d8c/sv-benchmarks/c/recursive/BallRajamani-SPIN2000-Fig1_false-unreach-call_true-no-overflow_true-termination.c [2018-11-23 02:44:07,498 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e1dbfa53-b574-40b2-9227-004a45d16d8c/bin-2019/ukojak/data/95648e4e7/41f74cee76f945aeb274f48fe6f30188/FLAGc0ccb1112 [2018-11-23 02:44:07,507 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e1dbfa53-b574-40b2-9227-004a45d16d8c/bin-2019/ukojak/data/95648e4e7/41f74cee76f945aeb274f48fe6f30188 [2018-11-23 02:44:07,509 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 02:44:07,510 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 02:44:07,510 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 02:44:07,510 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 02:44:07,513 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 02:44:07,514 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:44:07" (1/1) ... [2018-11-23 02:44:07,516 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dd9ff0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:44:07, skipping insertion in model container [2018-11-23 02:44:07,516 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:44:07" (1/1) ... [2018-11-23 02:44:07,522 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 02:44:07,534 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 02:44:07,634 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:44:07,637 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 02:44:07,645 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:44:07,654 INFO L195 MainTranslator]: Completed translation [2018-11-23 02:44:07,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:44:07 WrapperNode [2018-11-23 02:44:07,654 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 02:44:07,654 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 02:44:07,655 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 02:44:07,655 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 02:44:07,662 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:44:07" (1/1) ... [2018-11-23 02:44:07,667 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:44:07" (1/1) ... [2018-11-23 02:44:07,682 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 02:44:07,682 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 02:44:07,682 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 02:44:07,682 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 02:44:07,688 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:44:07" (1/1) ... [2018-11-23 02:44:07,688 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:44:07" (1/1) ... [2018-11-23 02:44:07,688 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:44:07" (1/1) ... [2018-11-23 02:44:07,689 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:44:07" (1/1) ... [2018-11-23 02:44:07,690 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:44:07" (1/1) ... [2018-11-23 02:44:07,691 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:44:07" (1/1) ... [2018-11-23 02:44:07,692 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:44:07" (1/1) ... [2018-11-23 02:44:07,693 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 02:44:07,693 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 02:44:07,693 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 02:44:07,693 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 02:44:07,694 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:44:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e1dbfa53-b574-40b2-9227-004a45d16d8c/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (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:10000 [2018-11-23 02:44:07,780 INFO L130 BoogieDeclarations]: Found specification of procedure A [2018-11-23 02:44:07,780 INFO L138 BoogieDeclarations]: Found implementation of procedure A [2018-11-23 02:44:07,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 02:44:07,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 02:44:07,916 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 02:44:07,917 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 02:44:07,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:44:07 BoogieIcfgContainer [2018-11-23 02:44:07,917 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 02:44:07,917 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 02:44:07,917 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 02:44:07,928 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 02:44:07,929 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:44:07" (1/1) ... [2018-11-23 02:44:07,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:44:07,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:44:07,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 16 states and 19 transitions. [2018-11-23 02:44:07,977 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2018-11-23 02:44:07,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 02:44:07,982 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:44:08,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:44:08,179 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 02:44:08,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 02:44:08,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 22 states and 26 transitions. [2018-11-23 02:44:08,326 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2018-11-23 02:44:08,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 02:44:08,327 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 02:44:08,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:44:08,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:44:08,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:44:08,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:44:08,416 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 2 iterations. ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] ~g~0 := 0;havoc main_#res;havoc main_#t~nondet1, main_#t~ret2, main_#t~ret3, main_~g~1, main_~h~0;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~g~1 := main_#t~nondet1;havoc main_#t~nondet1;main_~h~0 := (if 0 == main_~g~1 then 1 else 0); VAL [ULTIMATE.start_main_~g~1=(- 1), ULTIMATE.start_main_~h~0=0, ~g~0=0] [?] CALL call main_#t~ret2 := A(main_~g~1, main_~h~0); VAL [|A_#in~a1|=(- 1), |A_#in~a2|=0, |old(~g~0)|=0, ~g~0=0] [?] ~a1 := #in~a1;~a2 := #in~a2; VAL [A_~a1=(- 1), A_~a2=0, |A_#in~a1|=(- 1), |A_#in~a2|=0, |old(~g~0)|=0, ~g~0=0] [?] assume 0 != ~a1; VAL [A_~a1=(- 1), A_~a2=0, |A_#in~a1|=(- 1), |A_#in~a2|=0, |old(~g~0)|=0, ~g~0=0] [?] CALL call #t~ret0 := A(~a2, ~a1); VAL [|A_#in~a1|=0, |A_#in~a2|=(- 1), |old(~g~0)|=0, ~g~0=0] [?] ~a1 := #in~a1;~a2 := #in~a2; VAL [A_~a1=0, A_~a2=(- 1), |A_#in~a1|=0, |A_#in~a2|=(- 1), |old(~g~0)|=0, ~g~0=0] [?] assume !(0 != ~a1);~g~0 := ~a2; VAL [A_~a1=0, A_~a2=(- 1), |A_#in~a1|=0, |A_#in~a2|=(- 1), |old(~g~0)|=0, ~g~0=(- 1)] [?] assume true; VAL [A_~a1=0, A_~a2=(- 1), |A_#in~a1|=0, |A_#in~a2|=(- 1), |old(~g~0)|=0, ~g~0=(- 1)] [?] RET #29#return; VAL [A_~a1=(- 1), A_~a2=0, |A_#in~a1|=(- 1), |A_#in~a2|=0, |A_#t~ret0|=0, |old(~g~0)|=0, ~g~0=(- 1)] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;havoc #t~ret0; VAL [A_~a1=(- 1), A_~a2=0, |A_#in~a1|=(- 1), |A_#in~a2|=0, |old(~g~0)|=0, ~g~0=(- 1)] [?] assume true; VAL [A_~a1=(- 1), A_~a2=0, |A_#in~a1|=(- 1), |A_#in~a2|=0, |old(~g~0)|=0, ~g~0=(- 1)] [?] RET #31#return; VAL [ULTIMATE.start_main_~g~1=(- 1), ULTIMATE.start_main_~h~0=0, |ULTIMATE.start_main_#t~ret2|=0, ~g~0=(- 1)] [?] assume -2147483648 <= main_#t~ret2 && main_#t~ret2 <= 2147483647;havoc main_#t~ret2; VAL [ULTIMATE.start_main_~g~1=(- 1), ULTIMATE.start_main_~h~0=0, ~g~0=(- 1)] [?] CALL call main_#t~ret3 := A(main_~g~1, main_~h~0); VAL [|A_#in~a1|=(- 1), |A_#in~a2|=0, |old(~g~0)|=(- 1), ~g~0=(- 1)] [?] ~a1 := #in~a1;~a2 := #in~a2; VAL [A_~a1=(- 1), A_~a2=0, |A_#in~a1|=(- 1), |A_#in~a2|=0, |old(~g~0)|=(- 1), ~g~0=(- 1)] [?] assume 0 != ~a1; VAL [A_~a1=(- 1), A_~a2=0, |A_#in~a1|=(- 1), |A_#in~a2|=0, |old(~g~0)|=(- 1), ~g~0=(- 1)] [?] CALL call #t~ret0 := A(~a2, ~a1); VAL [|A_#in~a1|=0, |A_#in~a2|=(- 1), |old(~g~0)|=(- 1), ~g~0=(- 1)] [?] ~a1 := #in~a1;~a2 := #in~a2; VAL [A_~a1=0, A_~a2=(- 1), |A_#in~a1|=0, |A_#in~a2|=(- 1), |old(~g~0)|=(- 1), ~g~0=(- 1)] [?] assume !(0 != ~a1);~g~0 := ~a2; VAL [A_~a1=0, A_~a2=(- 1), |A_#in~a1|=0, |A_#in~a2|=(- 1), |old(~g~0)|=(- 1), ~g~0=(- 1)] [?] assume true; VAL [A_~a1=0, A_~a2=(- 1), |A_#in~a1|=0, |A_#in~a2|=(- 1), |old(~g~0)|=(- 1), ~g~0=(- 1)] [?] RET #29#return; VAL [A_~a1=(- 1), A_~a2=0, |A_#in~a1|=(- 1), |A_#in~a2|=0, |A_#t~ret0|=0, |old(~g~0)|=(- 1), ~g~0=(- 1)] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;havoc #t~ret0; VAL [A_~a1=(- 1), A_~a2=0, |A_#in~a1|=(- 1), |A_#in~a2|=0, |old(~g~0)|=(- 1), ~g~0=(- 1)] [?] assume true; VAL [A_~a1=(- 1), A_~a2=0, |A_#in~a1|=(- 1), |A_#in~a2|=0, |old(~g~0)|=(- 1), ~g~0=(- 1)] [?] RET #33#return; VAL [ULTIMATE.start_main_~g~1=(- 1), ULTIMATE.start_main_~h~0=0, |ULTIMATE.start_main_#t~ret3|=0, ~g~0=(- 1)] [?] assume -2147483648 <= main_#t~ret3 && main_#t~ret3 <= 2147483647;havoc main_#t~ret3; VAL [ULTIMATE.start_main_~g~1=(- 1), ULTIMATE.start_main_~h~0=0, ~g~0=(- 1)] [?] assume 0 != main_~g~1; VAL [ULTIMATE.start_main_~g~1=(- 1), ULTIMATE.start_main_~h~0=0, ~g~0=(- 1)] [?] assume !false; VAL [ULTIMATE.start_main_~g~1=(- 1), ULTIMATE.start_main_~h~0=0, ~g~0=(- 1)] [L14] ~g~0 := 0; [?] havoc main_#res; [?] havoc main_#t~nondet1, main_#t~ret2, main_#t~ret3, main_~g~1, main_~h~0; [L26] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; [L26] main_~g~1 := main_#t~nondet1; [L26] havoc main_#t~nondet1; [L27] main_~h~0 := (if 0 == main_~g~1 then 1 else 0); VAL [main_~g~1=-1, main_~h~0=0, ~g~0=0] [L28] CALL call main_#t~ret2 := A(main_~g~1, main_~h~0); VAL [#in~a1=-1, #in~a2=0, old(~g~0)=0, ~g~0=0] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=-1, #in~a2=0, old(~g~0)=0, ~a1=-1, ~a2=0, ~g~0=0] [L17-L21] assume 0 != ~a1; VAL [#in~a1=-1, #in~a2=0, old(~g~0)=0, ~a1=-1, ~a2=0, ~g~0=0] [L18] CALL call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=0, #in~a2=-1, old(~g~0)=0, ~g~0=0] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=0, #in~a2=-1, old(~g~0)=0, ~a1=0, ~a2=-1, ~g~0=0] [L17-L21] assume !(0 != ~a1); [L20] ~g~0 := ~a2; VAL [#in~a1=0, #in~a2=-1, old(~g~0)=0, ~a1=0, ~a2=-1, ~g~0=-1] [L16-L22] ensures true; VAL [#in~a1=0, #in~a2=-1, old(~g~0)=0, ~a1=0, ~a2=-1, ~g~0=-1] [L18] RET call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=-1, #in~a2=0, #t~ret0=0, old(~g~0)=0, ~a1=-1, ~a2=0, ~g~0=-1] [L18] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L18] havoc #t~ret0; VAL [#in~a1=-1, #in~a2=0, old(~g~0)=0, ~a1=-1, ~a2=0, ~g~0=-1] [L16-L22] ensures true; VAL [#in~a1=-1, #in~a2=0, old(~g~0)=0, ~a1=-1, ~a2=0, ~g~0=-1] [L28] RET call main_#t~ret2 := A(main_~g~1, main_~h~0); VAL [main_#t~ret2=0, main_~g~1=-1, main_~h~0=0, ~g~0=-1] [L28] assume -2147483648 <= main_#t~ret2 && main_#t~ret2 <= 2147483647; [L28] havoc main_#t~ret2; VAL [main_~g~1=-1, main_~h~0=0, ~g~0=-1] [L29] CALL call main_#t~ret3 := A(main_~g~1, main_~h~0); VAL [#in~a1=-1, #in~a2=0, old(~g~0)=-1, ~g~0=-1] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=-1, #in~a2=0, old(~g~0)=-1, ~a1=-1, ~a2=0, ~g~0=-1] [L17-L21] assume 0 != ~a1; VAL [#in~a1=-1, #in~a2=0, old(~g~0)=-1, ~a1=-1, ~a2=0, ~g~0=-1] [L18] CALL call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=0, #in~a2=-1, old(~g~0)=-1, ~g~0=-1] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=0, #in~a2=-1, old(~g~0)=-1, ~a1=0, ~a2=-1, ~g~0=-1] [L17-L21] assume !(0 != ~a1); [L20] ~g~0 := ~a2; VAL [#in~a1=0, #in~a2=-1, old(~g~0)=-1, ~a1=0, ~a2=-1, ~g~0=-1] [L16-L22] ensures true; VAL [#in~a1=0, #in~a2=-1, old(~g~0)=-1, ~a1=0, ~a2=-1, ~g~0=-1] [L18] RET call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=-1, #in~a2=0, #t~ret0=0, old(~g~0)=-1, ~a1=-1, ~a2=0, ~g~0=-1] [L18] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L18] havoc #t~ret0; VAL [#in~a1=-1, #in~a2=0, old(~g~0)=-1, ~a1=-1, ~a2=0, ~g~0=-1] [L16-L22] ensures true; VAL [#in~a1=-1, #in~a2=0, old(~g~0)=-1, ~a1=-1, ~a2=0, ~g~0=-1] [L29] RET call main_#t~ret3 := A(main_~g~1, main_~h~0); VAL [main_#t~ret3=0, main_~g~1=-1, main_~h~0=0, ~g~0=-1] [L29] assume -2147483648 <= main_#t~ret3 && main_#t~ret3 <= 2147483647; [L29] havoc main_#t~ret3; VAL [main_~g~1=-1, main_~h~0=0, ~g~0=-1] [L30-L32] assume 0 != main_~g~1; VAL [main_~g~1=-1, main_~h~0=0, ~g~0=-1] [L31] assert false; VAL [main_~g~1=-1, main_~h~0=0, ~g~0=-1] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L14] ~g~0 := 0; [?] havoc main_#res; [?] havoc main_#t~nondet1, main_#t~ret2, main_#t~ret3, main_~g~1, main_~h~0; [L26] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; [L26] main_~g~1 := main_#t~nondet1; [L26] havoc main_#t~nondet1; [L27] main_~h~0 := (if 0 == main_~g~1 then 1 else 0); VAL [main_~g~1=-1, main_~h~0=0, ~g~0=0] [L28] CALL call main_#t~ret2 := A(main_~g~1, main_~h~0); VAL [#in~a1=-1, #in~a2=0, old(~g~0)=0, ~g~0=0] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=-1, #in~a2=0, old(~g~0)=0, ~a1=-1, ~a2=0, ~g~0=0] [L17-L21] assume 0 != ~a1; VAL [#in~a1=-1, #in~a2=0, old(~g~0)=0, ~a1=-1, ~a2=0, ~g~0=0] [L18] CALL call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=0, #in~a2=-1, old(~g~0)=0, ~g~0=0] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=0, #in~a2=-1, old(~g~0)=0, ~a1=0, ~a2=-1, ~g~0=0] [L17-L21] assume !(0 != ~a1); [L20] ~g~0 := ~a2; VAL [#in~a1=0, #in~a2=-1, old(~g~0)=0, ~a1=0, ~a2=-1, ~g~0=-1] [L16-L22] ensures true; VAL [#in~a1=0, #in~a2=-1, old(~g~0)=0, ~a1=0, ~a2=-1, ~g~0=-1] [L18] RET call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=-1, #in~a2=0, #t~ret0=0, old(~g~0)=0, ~a1=-1, ~a2=0, ~g~0=-1] [L18] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L18] havoc #t~ret0; VAL [#in~a1=-1, #in~a2=0, old(~g~0)=0, ~a1=-1, ~a2=0, ~g~0=-1] [L16-L22] ensures true; VAL [#in~a1=-1, #in~a2=0, old(~g~0)=0, ~a1=-1, ~a2=0, ~g~0=-1] [L28] RET call main_#t~ret2 := A(main_~g~1, main_~h~0); VAL [main_#t~ret2=0, main_~g~1=-1, main_~h~0=0, ~g~0=-1] [L28] assume -2147483648 <= main_#t~ret2 && main_#t~ret2 <= 2147483647; [L28] havoc main_#t~ret2; VAL [main_~g~1=-1, main_~h~0=0, ~g~0=-1] [L29] CALL call main_#t~ret3 := A(main_~g~1, main_~h~0); VAL [#in~a1=-1, #in~a2=0, old(~g~0)=-1, ~g~0=-1] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=-1, #in~a2=0, old(~g~0)=-1, ~a1=-1, ~a2=0, ~g~0=-1] [L17-L21] assume 0 != ~a1; VAL [#in~a1=-1, #in~a2=0, old(~g~0)=-1, ~a1=-1, ~a2=0, ~g~0=-1] [L18] CALL call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=0, #in~a2=-1, old(~g~0)=-1, ~g~0=-1] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=0, #in~a2=-1, old(~g~0)=-1, ~a1=0, ~a2=-1, ~g~0=-1] [L17-L21] assume !(0 != ~a1); [L20] ~g~0 := ~a2; VAL [#in~a1=0, #in~a2=-1, old(~g~0)=-1, ~a1=0, ~a2=-1, ~g~0=-1] [L16-L22] ensures true; VAL [#in~a1=0, #in~a2=-1, old(~g~0)=-1, ~a1=0, ~a2=-1, ~g~0=-1] [L18] RET call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=-1, #in~a2=0, #t~ret0=0, old(~g~0)=-1, ~a1=-1, ~a2=0, ~g~0=-1] [L18] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L18] havoc #t~ret0; VAL [#in~a1=-1, #in~a2=0, old(~g~0)=-1, ~a1=-1, ~a2=0, ~g~0=-1] [L16-L22] ensures true; VAL [#in~a1=-1, #in~a2=0, old(~g~0)=-1, ~a1=-1, ~a2=0, ~g~0=-1] [L29] RET call main_#t~ret3 := A(main_~g~1, main_~h~0); VAL [main_#t~ret3=0, main_~g~1=-1, main_~h~0=0, ~g~0=-1] [L29] assume -2147483648 <= main_#t~ret3 && main_#t~ret3 <= 2147483647; [L29] havoc main_#t~ret3; VAL [main_~g~1=-1, main_~h~0=0, ~g~0=-1] [L30-L32] assume 0 != main_~g~1; VAL [main_~g~1=-1, main_~h~0=0, ~g~0=-1] [L31] assert false; VAL [main_~g~1=-1, main_~h~0=0, ~g~0=-1] [L14] ~g~0 := 0; [?] havoc main_#res; [?] havoc main_#t~nondet1, main_#t~ret2, main_#t~ret3, main_~g~1, main_~h~0; [L26] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; [L26] main_~g~1 := main_#t~nondet1; [L26] havoc main_#t~nondet1; [L27] main_~h~0 := (if 0 == main_~g~1 then 1 else 0); VAL [main_~g~1=-1, main_~h~0=0, ~g~0=0] [L28] CALL call main_#t~ret2 := A(main_~g~1, main_~h~0); VAL [#in~a1=-1, #in~a2=0, old(~g~0)=0, ~g~0=0] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=-1, #in~a2=0, old(~g~0)=0, ~a1=-1, ~a2=0, ~g~0=0] [L17-L21] COND TRUE 0 != ~a1 VAL [#in~a1=-1, #in~a2=0, old(~g~0)=0, ~a1=-1, ~a2=0, ~g~0=0] [L18] CALL call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=0, #in~a2=-1, old(~g~0)=0, ~g~0=0] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=0, #in~a2=-1, old(~g~0)=0, ~a1=0, ~a2=-1, ~g~0=0] [L17-L21] COND FALSE !(0 != ~a1) [L20] ~g~0 := ~a2; VAL [#in~a1=0, #in~a2=-1, old(~g~0)=0, ~a1=0, ~a2=-1, ~g~0=-1] [L18] RET call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=-1, #in~a2=0, #t~ret0=0, old(~g~0)=0, ~a1=-1, ~a2=0, ~g~0=-1] [L18] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L18] havoc #t~ret0; VAL [#in~a1=-1, #in~a2=0, old(~g~0)=0, ~a1=-1, ~a2=0, ~g~0=-1] [L28] RET call main_#t~ret2 := A(main_~g~1, main_~h~0); VAL [main_#t~ret2=0, main_~g~1=-1, main_~h~0=0, ~g~0=-1] [L28] assume -2147483648 <= main_#t~ret2 && main_#t~ret2 <= 2147483647; [L28] havoc main_#t~ret2; VAL [main_~g~1=-1, main_~h~0=0, ~g~0=-1] [L29] CALL call main_#t~ret3 := A(main_~g~1, main_~h~0); VAL [#in~a1=-1, #in~a2=0, old(~g~0)=-1, ~g~0=-1] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=-1, #in~a2=0, old(~g~0)=-1, ~a1=-1, ~a2=0, ~g~0=-1] [L17-L21] COND TRUE 0 != ~a1 VAL [#in~a1=-1, #in~a2=0, old(~g~0)=-1, ~a1=-1, ~a2=0, ~g~0=-1] [L18] CALL call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=0, #in~a2=-1, old(~g~0)=-1, ~g~0=-1] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=0, #in~a2=-1, old(~g~0)=-1, ~a1=0, ~a2=-1, ~g~0=-1] [L17-L21] COND FALSE !(0 != ~a1) [L20] ~g~0 := ~a2; VAL [#in~a1=0, #in~a2=-1, old(~g~0)=-1, ~a1=0, ~a2=-1, ~g~0=-1] [L18] RET call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=-1, #in~a2=0, #t~ret0=0, old(~g~0)=-1, ~a1=-1, ~a2=0, ~g~0=-1] [L18] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L18] havoc #t~ret0; VAL [#in~a1=-1, #in~a2=0, old(~g~0)=-1, ~a1=-1, ~a2=0, ~g~0=-1] [L29] RET call main_#t~ret3 := A(main_~g~1, main_~h~0); VAL [main_#t~ret3=0, main_~g~1=-1, main_~h~0=0, ~g~0=-1] [L29] assume -2147483648 <= main_#t~ret3 && main_#t~ret3 <= 2147483647; [L29] havoc main_#t~ret3; VAL [main_~g~1=-1, main_~h~0=0, ~g~0=-1] [L30-L32] COND TRUE 0 != main_~g~1 VAL [main_~g~1=-1, main_~h~0=0, ~g~0=-1] [L31] assert false; VAL [main_~g~1=-1, main_~h~0=0, ~g~0=-1] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L14] ~g~0 := 0; [?] havoc main_#res; [?] havoc main_#t~nondet1, main_#t~ret2, main_#t~ret3, main_~g~1, main_~h~0; [L26] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; [L26] main_~g~1 := main_#t~nondet1; [L26] havoc main_#t~nondet1; [L27] main_~h~0 := (if 0 == main_~g~1 then 1 else 0); VAL [main_~g~1=-1, main_~h~0=0, ~g~0=0] [L28] CALL call main_#t~ret2 := A(main_~g~1, main_~h~0); VAL [#in~a1=-1, #in~a2=0, old(~g~0)=0, ~g~0=0] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=-1, #in~a2=0, old(~g~0)=0, ~a1=-1, ~a2=0, ~g~0=0] [L17-L21] COND TRUE 0 != ~a1 VAL [#in~a1=-1, #in~a2=0, old(~g~0)=0, ~a1=-1, ~a2=0, ~g~0=0] [L18] CALL call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=0, #in~a2=-1, old(~g~0)=0, ~g~0=0] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=0, #in~a2=-1, old(~g~0)=0, ~a1=0, ~a2=-1, ~g~0=0] [L17-L21] COND FALSE !(0 != ~a1) [L20] ~g~0 := ~a2; VAL [#in~a1=0, #in~a2=-1, old(~g~0)=0, ~a1=0, ~a2=-1, ~g~0=-1] [L18] RET call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=-1, #in~a2=0, #t~ret0=0, old(~g~0)=0, ~a1=-1, ~a2=0, ~g~0=-1] [L18] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L18] havoc #t~ret0; VAL [#in~a1=-1, #in~a2=0, old(~g~0)=0, ~a1=-1, ~a2=0, ~g~0=-1] [L28] RET call main_#t~ret2 := A(main_~g~1, main_~h~0); VAL [main_#t~ret2=0, main_~g~1=-1, main_~h~0=0, ~g~0=-1] [L28] assume -2147483648 <= main_#t~ret2 && main_#t~ret2 <= 2147483647; [L28] havoc main_#t~ret2; VAL [main_~g~1=-1, main_~h~0=0, ~g~0=-1] [L29] CALL call main_#t~ret3 := A(main_~g~1, main_~h~0); VAL [#in~a1=-1, #in~a2=0, old(~g~0)=-1, ~g~0=-1] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=-1, #in~a2=0, old(~g~0)=-1, ~a1=-1, ~a2=0, ~g~0=-1] [L17-L21] COND TRUE 0 != ~a1 VAL [#in~a1=-1, #in~a2=0, old(~g~0)=-1, ~a1=-1, ~a2=0, ~g~0=-1] [L18] CALL call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=0, #in~a2=-1, old(~g~0)=-1, ~g~0=-1] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=0, #in~a2=-1, old(~g~0)=-1, ~a1=0, ~a2=-1, ~g~0=-1] [L17-L21] COND FALSE !(0 != ~a1) [L20] ~g~0 := ~a2; VAL [#in~a1=0, #in~a2=-1, old(~g~0)=-1, ~a1=0, ~a2=-1, ~g~0=-1] [L18] RET call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=-1, #in~a2=0, #t~ret0=0, old(~g~0)=-1, ~a1=-1, ~a2=0, ~g~0=-1] [L18] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L18] havoc #t~ret0; VAL [#in~a1=-1, #in~a2=0, old(~g~0)=-1, ~a1=-1, ~a2=0, ~g~0=-1] [L29] RET call main_#t~ret3 := A(main_~g~1, main_~h~0); VAL [main_#t~ret3=0, main_~g~1=-1, main_~h~0=0, ~g~0=-1] [L29] assume -2147483648 <= main_#t~ret3 && main_#t~ret3 <= 2147483647; [L29] havoc main_#t~ret3; VAL [main_~g~1=-1, main_~h~0=0, ~g~0=-1] [L30-L32] COND TRUE 0 != main_~g~1 VAL [main_~g~1=-1, main_~h~0=0, ~g~0=-1] [L31] assert false; VAL [main_~g~1=-1, main_~h~0=0, ~g~0=-1] [L14] ~g~0 := 0; [L26] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L26] ~g~1 := #t~nondet1; [L26] havoc #t~nondet1; [L27] ~h~0 := (if 0 == ~g~1 then 1 else 0); VAL [~g~0=0] [L28] CALL call #t~ret2 := A(~g~1, ~h~0); VAL [#in~a1=-1, #in~a2=0, old(~g~0)=0, ~g~0=0] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=-1, #in~a2=0, old(~g~0)=0, ~a1=-1, ~a2=0, ~g~0=0] [L17-L21] COND TRUE 0 != ~a1 VAL [#in~a1=-1, #in~a2=0, old(~g~0)=0, ~a1=-1, ~a2=0, ~g~0=0] [L18] CALL call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=0, #in~a2=-1, old(~g~0)=0, ~g~0=0] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=0, #in~a2=-1, old(~g~0)=0, ~a1=0, ~a2=-1, ~g~0=0] [L17-L21] COND FALSE !(0 != ~a1) [L20] ~g~0 := ~a2; VAL [#in~a1=0, #in~a2=-1, old(~g~0)=0, ~a1=0, ~a2=-1, ~g~0=-1] [L18] RET call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=-1, #in~a2=0, #t~ret0=0, old(~g~0)=0, ~a1=-1, ~a2=0, ~g~0=-1] [L18] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L18] havoc #t~ret0; VAL [#in~a1=-1, #in~a2=0, old(~g~0)=0, ~a1=-1, ~a2=0, ~g~0=-1] [L28] RET call #t~ret2 := A(~g~1, ~h~0); VAL [~g~0=-1] [L28] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; [L28] havoc #t~ret2; VAL [~g~0=-1] [L29] CALL call #t~ret3 := A(~g~1, ~h~0); VAL [#in~a1=-1, #in~a2=0, old(~g~0)=-1, ~g~0=-1] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=-1, #in~a2=0, old(~g~0)=-1, ~a1=-1, ~a2=0, ~g~0=-1] [L17-L21] COND TRUE 0 != ~a1 VAL [#in~a1=-1, #in~a2=0, old(~g~0)=-1, ~a1=-1, ~a2=0, ~g~0=-1] [L18] CALL call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=0, #in~a2=-1, old(~g~0)=-1, ~g~0=-1] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=0, #in~a2=-1, old(~g~0)=-1, ~a1=0, ~a2=-1, ~g~0=-1] [L17-L21] COND FALSE !(0 != ~a1) [L20] ~g~0 := ~a2; VAL [#in~a1=0, #in~a2=-1, old(~g~0)=-1, ~a1=0, ~a2=-1, ~g~0=-1] [L18] RET call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=-1, #in~a2=0, #t~ret0=0, old(~g~0)=-1, ~a1=-1, ~a2=0, ~g~0=-1] [L18] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L18] havoc #t~ret0; VAL [#in~a1=-1, #in~a2=0, old(~g~0)=-1, ~a1=-1, ~a2=0, ~g~0=-1] [L29] RET call #t~ret3 := A(~g~1, ~h~0); VAL [~g~0=-1] [L29] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L29] havoc #t~ret3; VAL [~g~0=-1] [L30-L32] COND TRUE 0 != ~g~1 VAL [~g~0=-1] [L31] assert false; VAL [~g~0=-1] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L14] ~g~0 := 0; [L26] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L26] ~g~1 := #t~nondet1; [L26] havoc #t~nondet1; [L27] ~h~0 := (if 0 == ~g~1 then 1 else 0); VAL [~g~0=0] [L28] CALL call #t~ret2 := A(~g~1, ~h~0); VAL [#in~a1=-1, #in~a2=0, old(~g~0)=0, ~g~0=0] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=-1, #in~a2=0, old(~g~0)=0, ~a1=-1, ~a2=0, ~g~0=0] [L17-L21] COND TRUE 0 != ~a1 VAL [#in~a1=-1, #in~a2=0, old(~g~0)=0, ~a1=-1, ~a2=0, ~g~0=0] [L18] CALL call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=0, #in~a2=-1, old(~g~0)=0, ~g~0=0] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=0, #in~a2=-1, old(~g~0)=0, ~a1=0, ~a2=-1, ~g~0=0] [L17-L21] COND FALSE !(0 != ~a1) [L20] ~g~0 := ~a2; VAL [#in~a1=0, #in~a2=-1, old(~g~0)=0, ~a1=0, ~a2=-1, ~g~0=-1] [L18] RET call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=-1, #in~a2=0, #t~ret0=0, old(~g~0)=0, ~a1=-1, ~a2=0, ~g~0=-1] [L18] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L18] havoc #t~ret0; VAL [#in~a1=-1, #in~a2=0, old(~g~0)=0, ~a1=-1, ~a2=0, ~g~0=-1] [L28] RET call #t~ret2 := A(~g~1, ~h~0); VAL [~g~0=-1] [L28] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; [L28] havoc #t~ret2; VAL [~g~0=-1] [L29] CALL call #t~ret3 := A(~g~1, ~h~0); VAL [#in~a1=-1, #in~a2=0, old(~g~0)=-1, ~g~0=-1] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=-1, #in~a2=0, old(~g~0)=-1, ~a1=-1, ~a2=0, ~g~0=-1] [L17-L21] COND TRUE 0 != ~a1 VAL [#in~a1=-1, #in~a2=0, old(~g~0)=-1, ~a1=-1, ~a2=0, ~g~0=-1] [L18] CALL call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=0, #in~a2=-1, old(~g~0)=-1, ~g~0=-1] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=0, #in~a2=-1, old(~g~0)=-1, ~a1=0, ~a2=-1, ~g~0=-1] [L17-L21] COND FALSE !(0 != ~a1) [L20] ~g~0 := ~a2; VAL [#in~a1=0, #in~a2=-1, old(~g~0)=-1, ~a1=0, ~a2=-1, ~g~0=-1] [L18] RET call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=-1, #in~a2=0, #t~ret0=0, old(~g~0)=-1, ~a1=-1, ~a2=0, ~g~0=-1] [L18] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L18] havoc #t~ret0; VAL [#in~a1=-1, #in~a2=0, old(~g~0)=-1, ~a1=-1, ~a2=0, ~g~0=-1] [L29] RET call #t~ret3 := A(~g~1, ~h~0); VAL [~g~0=-1] [L29] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L29] havoc #t~ret3; VAL [~g~0=-1] [L30-L32] COND TRUE 0 != ~g~1 VAL [~g~0=-1] [L31] assert false; VAL [~g~0=-1] [L14] int g; [L26] int g = __VERIFIER_nondet_int(); [L27] int h = !g; VAL [g=0] [L28] CALL A(g,h) VAL [\old(a1)=-1, \old(a2)=0, \old(g)=0, g=0] [L17] COND TRUE \read(a1) VAL [\old(a1)=-1, \old(a2)=0, \old(g)=0, a1=-1, a2=0, g=0] [L18] CALL A(a2,a1) VAL [\old(a1)=0, \old(a2)=-1, \old(g)=0, g=0] [L17] COND FALSE !(\read(a1)) [L20] g = a2 VAL [\old(a1)=0, \old(a2)=-1, \old(g)=0, a1=0, a2=-1, g=-1] [L18] RET A(a2,a1) VAL [\old(a1)=-1, \old(a2)=0, \old(g)=0, A(a2,a1)=0, a1=-1, a2=0, g=-1] [L28] RET A(g,h) VAL [g=-1] [L29] CALL A(g,h) VAL [\old(a1)=-1, \old(a2)=0, \old(g)=-1, g=-1] [L17] COND TRUE \read(a1) VAL [\old(a1)=-1, \old(a2)=0, \old(g)=-1, a1=-1, a2=0, g=-1] [L18] CALL A(a2,a1) VAL [\old(a1)=0, \old(a2)=-1, \old(g)=-1, g=-1] [L17] COND FALSE !(\read(a1)) [L20] g = a2 VAL [\old(a1)=0, \old(a2)=-1, \old(g)=-1, a1=0, a2=-1, g=-1] [L18] RET A(a2,a1) VAL [\old(a1)=-1, \old(a2)=0, \old(g)=-1, A(a2,a1)=0, a1=-1, a2=0, g=-1] [L29] RET A(g,h) VAL [g=-1] [L30] COND TRUE \read(g) VAL [g=-1] [L31] __VERIFIER_error() VAL [g=-1] ----- [2018-11-23 02:44:08,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 02:44:08 ImpRootNode [2018-11-23 02:44:08,460 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-23 02:44:08,460 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 02:44:08,461 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 02:44:08,461 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 02:44:08,461 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:44:07" (3/4) ... [2018-11-23 02:44:08,463 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] ~g~0 := 0;havoc main_#res;havoc main_#t~nondet1, main_#t~ret2, main_#t~ret3, main_~g~1, main_~h~0;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~g~1 := main_#t~nondet1;havoc main_#t~nondet1;main_~h~0 := (if 0 == main_~g~1 then 1 else 0); VAL [ULTIMATE.start_main_~g~1=(- 1), ULTIMATE.start_main_~h~0=0, ~g~0=0] [?] CALL call main_#t~ret2 := A(main_~g~1, main_~h~0); VAL [|A_#in~a1|=(- 1), |A_#in~a2|=0, |old(~g~0)|=0, ~g~0=0] [?] ~a1 := #in~a1;~a2 := #in~a2; VAL [A_~a1=(- 1), A_~a2=0, |A_#in~a1|=(- 1), |A_#in~a2|=0, |old(~g~0)|=0, ~g~0=0] [?] assume 0 != ~a1; VAL [A_~a1=(- 1), A_~a2=0, |A_#in~a1|=(- 1), |A_#in~a2|=0, |old(~g~0)|=0, ~g~0=0] [?] CALL call #t~ret0 := A(~a2, ~a1); VAL [|A_#in~a1|=0, |A_#in~a2|=(- 1), |old(~g~0)|=0, ~g~0=0] [?] ~a1 := #in~a1;~a2 := #in~a2; VAL [A_~a1=0, A_~a2=(- 1), |A_#in~a1|=0, |A_#in~a2|=(- 1), |old(~g~0)|=0, ~g~0=0] [?] assume !(0 != ~a1);~g~0 := ~a2; VAL [A_~a1=0, A_~a2=(- 1), |A_#in~a1|=0, |A_#in~a2|=(- 1), |old(~g~0)|=0, ~g~0=(- 1)] [?] assume true; VAL [A_~a1=0, A_~a2=(- 1), |A_#in~a1|=0, |A_#in~a2|=(- 1), |old(~g~0)|=0, ~g~0=(- 1)] [?] RET #29#return; VAL [A_~a1=(- 1), A_~a2=0, |A_#in~a1|=(- 1), |A_#in~a2|=0, |A_#t~ret0|=0, |old(~g~0)|=0, ~g~0=(- 1)] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;havoc #t~ret0; VAL [A_~a1=(- 1), A_~a2=0, |A_#in~a1|=(- 1), |A_#in~a2|=0, |old(~g~0)|=0, ~g~0=(- 1)] [?] assume true; VAL [A_~a1=(- 1), A_~a2=0, |A_#in~a1|=(- 1), |A_#in~a2|=0, |old(~g~0)|=0, ~g~0=(- 1)] [?] RET #31#return; VAL [ULTIMATE.start_main_~g~1=(- 1), ULTIMATE.start_main_~h~0=0, |ULTIMATE.start_main_#t~ret2|=0, ~g~0=(- 1)] [?] assume -2147483648 <= main_#t~ret2 && main_#t~ret2 <= 2147483647;havoc main_#t~ret2; VAL [ULTIMATE.start_main_~g~1=(- 1), ULTIMATE.start_main_~h~0=0, ~g~0=(- 1)] [?] CALL call main_#t~ret3 := A(main_~g~1, main_~h~0); VAL [|A_#in~a1|=(- 1), |A_#in~a2|=0, |old(~g~0)|=(- 1), ~g~0=(- 1)] [?] ~a1 := #in~a1;~a2 := #in~a2; VAL [A_~a1=(- 1), A_~a2=0, |A_#in~a1|=(- 1), |A_#in~a2|=0, |old(~g~0)|=(- 1), ~g~0=(- 1)] [?] assume 0 != ~a1; VAL [A_~a1=(- 1), A_~a2=0, |A_#in~a1|=(- 1), |A_#in~a2|=0, |old(~g~0)|=(- 1), ~g~0=(- 1)] [?] CALL call #t~ret0 := A(~a2, ~a1); VAL [|A_#in~a1|=0, |A_#in~a2|=(- 1), |old(~g~0)|=(- 1), ~g~0=(- 1)] [?] ~a1 := #in~a1;~a2 := #in~a2; VAL [A_~a1=0, A_~a2=(- 1), |A_#in~a1|=0, |A_#in~a2|=(- 1), |old(~g~0)|=(- 1), ~g~0=(- 1)] [?] assume !(0 != ~a1);~g~0 := ~a2; VAL [A_~a1=0, A_~a2=(- 1), |A_#in~a1|=0, |A_#in~a2|=(- 1), |old(~g~0)|=(- 1), ~g~0=(- 1)] [?] assume true; VAL [A_~a1=0, A_~a2=(- 1), |A_#in~a1|=0, |A_#in~a2|=(- 1), |old(~g~0)|=(- 1), ~g~0=(- 1)] [?] RET #29#return; VAL [A_~a1=(- 1), A_~a2=0, |A_#in~a1|=(- 1), |A_#in~a2|=0, |A_#t~ret0|=0, |old(~g~0)|=(- 1), ~g~0=(- 1)] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;havoc #t~ret0; VAL [A_~a1=(- 1), A_~a2=0, |A_#in~a1|=(- 1), |A_#in~a2|=0, |old(~g~0)|=(- 1), ~g~0=(- 1)] [?] assume true; VAL [A_~a1=(- 1), A_~a2=0, |A_#in~a1|=(- 1), |A_#in~a2|=0, |old(~g~0)|=(- 1), ~g~0=(- 1)] [?] RET #33#return; VAL [ULTIMATE.start_main_~g~1=(- 1), ULTIMATE.start_main_~h~0=0, |ULTIMATE.start_main_#t~ret3|=0, ~g~0=(- 1)] [?] assume -2147483648 <= main_#t~ret3 && main_#t~ret3 <= 2147483647;havoc main_#t~ret3; VAL [ULTIMATE.start_main_~g~1=(- 1), ULTIMATE.start_main_~h~0=0, ~g~0=(- 1)] [?] assume 0 != main_~g~1; VAL [ULTIMATE.start_main_~g~1=(- 1), ULTIMATE.start_main_~h~0=0, ~g~0=(- 1)] [?] assume !false; VAL [ULTIMATE.start_main_~g~1=(- 1), ULTIMATE.start_main_~h~0=0, ~g~0=(- 1)] [L14] ~g~0 := 0; [?] havoc main_#res; [?] havoc main_#t~nondet1, main_#t~ret2, main_#t~ret3, main_~g~1, main_~h~0; [L26] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; [L26] main_~g~1 := main_#t~nondet1; [L26] havoc main_#t~nondet1; [L27] main_~h~0 := (if 0 == main_~g~1 then 1 else 0); VAL [main_~g~1=-1, main_~h~0=0, ~g~0=0] [L28] CALL call main_#t~ret2 := A(main_~g~1, main_~h~0); VAL [#in~a1=-1, #in~a2=0, old(~g~0)=0, ~g~0=0] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=-1, #in~a2=0, old(~g~0)=0, ~a1=-1, ~a2=0, ~g~0=0] [L17-L21] assume 0 != ~a1; VAL [#in~a1=-1, #in~a2=0, old(~g~0)=0, ~a1=-1, ~a2=0, ~g~0=0] [L18] CALL call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=0, #in~a2=-1, old(~g~0)=0, ~g~0=0] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=0, #in~a2=-1, old(~g~0)=0, ~a1=0, ~a2=-1, ~g~0=0] [L17-L21] assume !(0 != ~a1); [L20] ~g~0 := ~a2; VAL [#in~a1=0, #in~a2=-1, old(~g~0)=0, ~a1=0, ~a2=-1, ~g~0=-1] [L16-L22] ensures true; VAL [#in~a1=0, #in~a2=-1, old(~g~0)=0, ~a1=0, ~a2=-1, ~g~0=-1] [L18] RET call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=-1, #in~a2=0, #t~ret0=0, old(~g~0)=0, ~a1=-1, ~a2=0, ~g~0=-1] [L18] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L18] havoc #t~ret0; VAL [#in~a1=-1, #in~a2=0, old(~g~0)=0, ~a1=-1, ~a2=0, ~g~0=-1] [L16-L22] ensures true; VAL [#in~a1=-1, #in~a2=0, old(~g~0)=0, ~a1=-1, ~a2=0, ~g~0=-1] [L28] RET call main_#t~ret2 := A(main_~g~1, main_~h~0); VAL [main_#t~ret2=0, main_~g~1=-1, main_~h~0=0, ~g~0=-1] [L28] assume -2147483648 <= main_#t~ret2 && main_#t~ret2 <= 2147483647; [L28] havoc main_#t~ret2; VAL [main_~g~1=-1, main_~h~0=0, ~g~0=-1] [L29] CALL call main_#t~ret3 := A(main_~g~1, main_~h~0); VAL [#in~a1=-1, #in~a2=0, old(~g~0)=-1, ~g~0=-1] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=-1, #in~a2=0, old(~g~0)=-1, ~a1=-1, ~a2=0, ~g~0=-1] [L17-L21] assume 0 != ~a1; VAL [#in~a1=-1, #in~a2=0, old(~g~0)=-1, ~a1=-1, ~a2=0, ~g~0=-1] [L18] CALL call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=0, #in~a2=-1, old(~g~0)=-1, ~g~0=-1] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=0, #in~a2=-1, old(~g~0)=-1, ~a1=0, ~a2=-1, ~g~0=-1] [L17-L21] assume !(0 != ~a1); [L20] ~g~0 := ~a2; VAL [#in~a1=0, #in~a2=-1, old(~g~0)=-1, ~a1=0, ~a2=-1, ~g~0=-1] [L16-L22] ensures true; VAL [#in~a1=0, #in~a2=-1, old(~g~0)=-1, ~a1=0, ~a2=-1, ~g~0=-1] [L18] RET call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=-1, #in~a2=0, #t~ret0=0, old(~g~0)=-1, ~a1=-1, ~a2=0, ~g~0=-1] [L18] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L18] havoc #t~ret0; VAL [#in~a1=-1, #in~a2=0, old(~g~0)=-1, ~a1=-1, ~a2=0, ~g~0=-1] [L16-L22] ensures true; VAL [#in~a1=-1, #in~a2=0, old(~g~0)=-1, ~a1=-1, ~a2=0, ~g~0=-1] [L29] RET call main_#t~ret3 := A(main_~g~1, main_~h~0); VAL [main_#t~ret3=0, main_~g~1=-1, main_~h~0=0, ~g~0=-1] [L29] assume -2147483648 <= main_#t~ret3 && main_#t~ret3 <= 2147483647; [L29] havoc main_#t~ret3; VAL [main_~g~1=-1, main_~h~0=0, ~g~0=-1] [L30-L32] assume 0 != main_~g~1; VAL [main_~g~1=-1, main_~h~0=0, ~g~0=-1] [L31] assert false; VAL [main_~g~1=-1, main_~h~0=0, ~g~0=-1] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L14] ~g~0 := 0; [?] havoc main_#res; [?] havoc main_#t~nondet1, main_#t~ret2, main_#t~ret3, main_~g~1, main_~h~0; [L26] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; [L26] main_~g~1 := main_#t~nondet1; [L26] havoc main_#t~nondet1; [L27] main_~h~0 := (if 0 == main_~g~1 then 1 else 0); VAL [main_~g~1=-1, main_~h~0=0, ~g~0=0] [L28] CALL call main_#t~ret2 := A(main_~g~1, main_~h~0); VAL [#in~a1=-1, #in~a2=0, old(~g~0)=0, ~g~0=0] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=-1, #in~a2=0, old(~g~0)=0, ~a1=-1, ~a2=0, ~g~0=0] [L17-L21] assume 0 != ~a1; VAL [#in~a1=-1, #in~a2=0, old(~g~0)=0, ~a1=-1, ~a2=0, ~g~0=0] [L18] CALL call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=0, #in~a2=-1, old(~g~0)=0, ~g~0=0] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=0, #in~a2=-1, old(~g~0)=0, ~a1=0, ~a2=-1, ~g~0=0] [L17-L21] assume !(0 != ~a1); [L20] ~g~0 := ~a2; VAL [#in~a1=0, #in~a2=-1, old(~g~0)=0, ~a1=0, ~a2=-1, ~g~0=-1] [L16-L22] ensures true; VAL [#in~a1=0, #in~a2=-1, old(~g~0)=0, ~a1=0, ~a2=-1, ~g~0=-1] [L18] RET call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=-1, #in~a2=0, #t~ret0=0, old(~g~0)=0, ~a1=-1, ~a2=0, ~g~0=-1] [L18] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L18] havoc #t~ret0; VAL [#in~a1=-1, #in~a2=0, old(~g~0)=0, ~a1=-1, ~a2=0, ~g~0=-1] [L16-L22] ensures true; VAL [#in~a1=-1, #in~a2=0, old(~g~0)=0, ~a1=-1, ~a2=0, ~g~0=-1] [L28] RET call main_#t~ret2 := A(main_~g~1, main_~h~0); VAL [main_#t~ret2=0, main_~g~1=-1, main_~h~0=0, ~g~0=-1] [L28] assume -2147483648 <= main_#t~ret2 && main_#t~ret2 <= 2147483647; [L28] havoc main_#t~ret2; VAL [main_~g~1=-1, main_~h~0=0, ~g~0=-1] [L29] CALL call main_#t~ret3 := A(main_~g~1, main_~h~0); VAL [#in~a1=-1, #in~a2=0, old(~g~0)=-1, ~g~0=-1] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=-1, #in~a2=0, old(~g~0)=-1, ~a1=-1, ~a2=0, ~g~0=-1] [L17-L21] assume 0 != ~a1; VAL [#in~a1=-1, #in~a2=0, old(~g~0)=-1, ~a1=-1, ~a2=0, ~g~0=-1] [L18] CALL call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=0, #in~a2=-1, old(~g~0)=-1, ~g~0=-1] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=0, #in~a2=-1, old(~g~0)=-1, ~a1=0, ~a2=-1, ~g~0=-1] [L17-L21] assume !(0 != ~a1); [L20] ~g~0 := ~a2; VAL [#in~a1=0, #in~a2=-1, old(~g~0)=-1, ~a1=0, ~a2=-1, ~g~0=-1] [L16-L22] ensures true; VAL [#in~a1=0, #in~a2=-1, old(~g~0)=-1, ~a1=0, ~a2=-1, ~g~0=-1] [L18] RET call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=-1, #in~a2=0, #t~ret0=0, old(~g~0)=-1, ~a1=-1, ~a2=0, ~g~0=-1] [L18] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L18] havoc #t~ret0; VAL [#in~a1=-1, #in~a2=0, old(~g~0)=-1, ~a1=-1, ~a2=0, ~g~0=-1] [L16-L22] ensures true; VAL [#in~a1=-1, #in~a2=0, old(~g~0)=-1, ~a1=-1, ~a2=0, ~g~0=-1] [L29] RET call main_#t~ret3 := A(main_~g~1, main_~h~0); VAL [main_#t~ret3=0, main_~g~1=-1, main_~h~0=0, ~g~0=-1] [L29] assume -2147483648 <= main_#t~ret3 && main_#t~ret3 <= 2147483647; [L29] havoc main_#t~ret3; VAL [main_~g~1=-1, main_~h~0=0, ~g~0=-1] [L30-L32] assume 0 != main_~g~1; VAL [main_~g~1=-1, main_~h~0=0, ~g~0=-1] [L31] assert false; VAL [main_~g~1=-1, main_~h~0=0, ~g~0=-1] [L14] ~g~0 := 0; [?] havoc main_#res; [?] havoc main_#t~nondet1, main_#t~ret2, main_#t~ret3, main_~g~1, main_~h~0; [L26] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; [L26] main_~g~1 := main_#t~nondet1; [L26] havoc main_#t~nondet1; [L27] main_~h~0 := (if 0 == main_~g~1 then 1 else 0); VAL [main_~g~1=-1, main_~h~0=0, ~g~0=0] [L28] CALL call main_#t~ret2 := A(main_~g~1, main_~h~0); VAL [#in~a1=-1, #in~a2=0, old(~g~0)=0, ~g~0=0] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=-1, #in~a2=0, old(~g~0)=0, ~a1=-1, ~a2=0, ~g~0=0] [L17-L21] COND TRUE 0 != ~a1 VAL [#in~a1=-1, #in~a2=0, old(~g~0)=0, ~a1=-1, ~a2=0, ~g~0=0] [L18] CALL call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=0, #in~a2=-1, old(~g~0)=0, ~g~0=0] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=0, #in~a2=-1, old(~g~0)=0, ~a1=0, ~a2=-1, ~g~0=0] [L17-L21] COND FALSE !(0 != ~a1) [L20] ~g~0 := ~a2; VAL [#in~a1=0, #in~a2=-1, old(~g~0)=0, ~a1=0, ~a2=-1, ~g~0=-1] [L18] RET call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=-1, #in~a2=0, #t~ret0=0, old(~g~0)=0, ~a1=-1, ~a2=0, ~g~0=-1] [L18] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L18] havoc #t~ret0; VAL [#in~a1=-1, #in~a2=0, old(~g~0)=0, ~a1=-1, ~a2=0, ~g~0=-1] [L28] RET call main_#t~ret2 := A(main_~g~1, main_~h~0); VAL [main_#t~ret2=0, main_~g~1=-1, main_~h~0=0, ~g~0=-1] [L28] assume -2147483648 <= main_#t~ret2 && main_#t~ret2 <= 2147483647; [L28] havoc main_#t~ret2; VAL [main_~g~1=-1, main_~h~0=0, ~g~0=-1] [L29] CALL call main_#t~ret3 := A(main_~g~1, main_~h~0); VAL [#in~a1=-1, #in~a2=0, old(~g~0)=-1, ~g~0=-1] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=-1, #in~a2=0, old(~g~0)=-1, ~a1=-1, ~a2=0, ~g~0=-1] [L17-L21] COND TRUE 0 != ~a1 VAL [#in~a1=-1, #in~a2=0, old(~g~0)=-1, ~a1=-1, ~a2=0, ~g~0=-1] [L18] CALL call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=0, #in~a2=-1, old(~g~0)=-1, ~g~0=-1] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=0, #in~a2=-1, old(~g~0)=-1, ~a1=0, ~a2=-1, ~g~0=-1] [L17-L21] COND FALSE !(0 != ~a1) [L20] ~g~0 := ~a2; VAL [#in~a1=0, #in~a2=-1, old(~g~0)=-1, ~a1=0, ~a2=-1, ~g~0=-1] [L18] RET call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=-1, #in~a2=0, #t~ret0=0, old(~g~0)=-1, ~a1=-1, ~a2=0, ~g~0=-1] [L18] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L18] havoc #t~ret0; VAL [#in~a1=-1, #in~a2=0, old(~g~0)=-1, ~a1=-1, ~a2=0, ~g~0=-1] [L29] RET call main_#t~ret3 := A(main_~g~1, main_~h~0); VAL [main_#t~ret3=0, main_~g~1=-1, main_~h~0=0, ~g~0=-1] [L29] assume -2147483648 <= main_#t~ret3 && main_#t~ret3 <= 2147483647; [L29] havoc main_#t~ret3; VAL [main_~g~1=-1, main_~h~0=0, ~g~0=-1] [L30-L32] COND TRUE 0 != main_~g~1 VAL [main_~g~1=-1, main_~h~0=0, ~g~0=-1] [L31] assert false; VAL [main_~g~1=-1, main_~h~0=0, ~g~0=-1] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L14] ~g~0 := 0; [?] havoc main_#res; [?] havoc main_#t~nondet1, main_#t~ret2, main_#t~ret3, main_~g~1, main_~h~0; [L26] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; [L26] main_~g~1 := main_#t~nondet1; [L26] havoc main_#t~nondet1; [L27] main_~h~0 := (if 0 == main_~g~1 then 1 else 0); VAL [main_~g~1=-1, main_~h~0=0, ~g~0=0] [L28] CALL call main_#t~ret2 := A(main_~g~1, main_~h~0); VAL [#in~a1=-1, #in~a2=0, old(~g~0)=0, ~g~0=0] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=-1, #in~a2=0, old(~g~0)=0, ~a1=-1, ~a2=0, ~g~0=0] [L17-L21] COND TRUE 0 != ~a1 VAL [#in~a1=-1, #in~a2=0, old(~g~0)=0, ~a1=-1, ~a2=0, ~g~0=0] [L18] CALL call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=0, #in~a2=-1, old(~g~0)=0, ~g~0=0] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=0, #in~a2=-1, old(~g~0)=0, ~a1=0, ~a2=-1, ~g~0=0] [L17-L21] COND FALSE !(0 != ~a1) [L20] ~g~0 := ~a2; VAL [#in~a1=0, #in~a2=-1, old(~g~0)=0, ~a1=0, ~a2=-1, ~g~0=-1] [L18] RET call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=-1, #in~a2=0, #t~ret0=0, old(~g~0)=0, ~a1=-1, ~a2=0, ~g~0=-1] [L18] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L18] havoc #t~ret0; VAL [#in~a1=-1, #in~a2=0, old(~g~0)=0, ~a1=-1, ~a2=0, ~g~0=-1] [L28] RET call main_#t~ret2 := A(main_~g~1, main_~h~0); VAL [main_#t~ret2=0, main_~g~1=-1, main_~h~0=0, ~g~0=-1] [L28] assume -2147483648 <= main_#t~ret2 && main_#t~ret2 <= 2147483647; [L28] havoc main_#t~ret2; VAL [main_~g~1=-1, main_~h~0=0, ~g~0=-1] [L29] CALL call main_#t~ret3 := A(main_~g~1, main_~h~0); VAL [#in~a1=-1, #in~a2=0, old(~g~0)=-1, ~g~0=-1] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=-1, #in~a2=0, old(~g~0)=-1, ~a1=-1, ~a2=0, ~g~0=-1] [L17-L21] COND TRUE 0 != ~a1 VAL [#in~a1=-1, #in~a2=0, old(~g~0)=-1, ~a1=-1, ~a2=0, ~g~0=-1] [L18] CALL call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=0, #in~a2=-1, old(~g~0)=-1, ~g~0=-1] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=0, #in~a2=-1, old(~g~0)=-1, ~a1=0, ~a2=-1, ~g~0=-1] [L17-L21] COND FALSE !(0 != ~a1) [L20] ~g~0 := ~a2; VAL [#in~a1=0, #in~a2=-1, old(~g~0)=-1, ~a1=0, ~a2=-1, ~g~0=-1] [L18] RET call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=-1, #in~a2=0, #t~ret0=0, old(~g~0)=-1, ~a1=-1, ~a2=0, ~g~0=-1] [L18] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L18] havoc #t~ret0; VAL [#in~a1=-1, #in~a2=0, old(~g~0)=-1, ~a1=-1, ~a2=0, ~g~0=-1] [L29] RET call main_#t~ret3 := A(main_~g~1, main_~h~0); VAL [main_#t~ret3=0, main_~g~1=-1, main_~h~0=0, ~g~0=-1] [L29] assume -2147483648 <= main_#t~ret3 && main_#t~ret3 <= 2147483647; [L29] havoc main_#t~ret3; VAL [main_~g~1=-1, main_~h~0=0, ~g~0=-1] [L30-L32] COND TRUE 0 != main_~g~1 VAL [main_~g~1=-1, main_~h~0=0, ~g~0=-1] [L31] assert false; VAL [main_~g~1=-1, main_~h~0=0, ~g~0=-1] [L14] ~g~0 := 0; [L26] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L26] ~g~1 := #t~nondet1; [L26] havoc #t~nondet1; [L27] ~h~0 := (if 0 == ~g~1 then 1 else 0); VAL [~g~0=0] [L28] CALL call #t~ret2 := A(~g~1, ~h~0); VAL [#in~a1=-1, #in~a2=0, old(~g~0)=0, ~g~0=0] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=-1, #in~a2=0, old(~g~0)=0, ~a1=-1, ~a2=0, ~g~0=0] [L17-L21] COND TRUE 0 != ~a1 VAL [#in~a1=-1, #in~a2=0, old(~g~0)=0, ~a1=-1, ~a2=0, ~g~0=0] [L18] CALL call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=0, #in~a2=-1, old(~g~0)=0, ~g~0=0] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=0, #in~a2=-1, old(~g~0)=0, ~a1=0, ~a2=-1, ~g~0=0] [L17-L21] COND FALSE !(0 != ~a1) [L20] ~g~0 := ~a2; VAL [#in~a1=0, #in~a2=-1, old(~g~0)=0, ~a1=0, ~a2=-1, ~g~0=-1] [L18] RET call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=-1, #in~a2=0, #t~ret0=0, old(~g~0)=0, ~a1=-1, ~a2=0, ~g~0=-1] [L18] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L18] havoc #t~ret0; VAL [#in~a1=-1, #in~a2=0, old(~g~0)=0, ~a1=-1, ~a2=0, ~g~0=-1] [L28] RET call #t~ret2 := A(~g~1, ~h~0); VAL [~g~0=-1] [L28] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; [L28] havoc #t~ret2; VAL [~g~0=-1] [L29] CALL call #t~ret3 := A(~g~1, ~h~0); VAL [#in~a1=-1, #in~a2=0, old(~g~0)=-1, ~g~0=-1] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=-1, #in~a2=0, old(~g~0)=-1, ~a1=-1, ~a2=0, ~g~0=-1] [L17-L21] COND TRUE 0 != ~a1 VAL [#in~a1=-1, #in~a2=0, old(~g~0)=-1, ~a1=-1, ~a2=0, ~g~0=-1] [L18] CALL call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=0, #in~a2=-1, old(~g~0)=-1, ~g~0=-1] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=0, #in~a2=-1, old(~g~0)=-1, ~a1=0, ~a2=-1, ~g~0=-1] [L17-L21] COND FALSE !(0 != ~a1) [L20] ~g~0 := ~a2; VAL [#in~a1=0, #in~a2=-1, old(~g~0)=-1, ~a1=0, ~a2=-1, ~g~0=-1] [L18] RET call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=-1, #in~a2=0, #t~ret0=0, old(~g~0)=-1, ~a1=-1, ~a2=0, ~g~0=-1] [L18] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L18] havoc #t~ret0; VAL [#in~a1=-1, #in~a2=0, old(~g~0)=-1, ~a1=-1, ~a2=0, ~g~0=-1] [L29] RET call #t~ret3 := A(~g~1, ~h~0); VAL [~g~0=-1] [L29] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L29] havoc #t~ret3; VAL [~g~0=-1] [L30-L32] COND TRUE 0 != ~g~1 VAL [~g~0=-1] [L31] assert false; VAL [~g~0=-1] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L14] ~g~0 := 0; [L26] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L26] ~g~1 := #t~nondet1; [L26] havoc #t~nondet1; [L27] ~h~0 := (if 0 == ~g~1 then 1 else 0); VAL [~g~0=0] [L28] CALL call #t~ret2 := A(~g~1, ~h~0); VAL [#in~a1=-1, #in~a2=0, old(~g~0)=0, ~g~0=0] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=-1, #in~a2=0, old(~g~0)=0, ~a1=-1, ~a2=0, ~g~0=0] [L17-L21] COND TRUE 0 != ~a1 VAL [#in~a1=-1, #in~a2=0, old(~g~0)=0, ~a1=-1, ~a2=0, ~g~0=0] [L18] CALL call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=0, #in~a2=-1, old(~g~0)=0, ~g~0=0] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=0, #in~a2=-1, old(~g~0)=0, ~a1=0, ~a2=-1, ~g~0=0] [L17-L21] COND FALSE !(0 != ~a1) [L20] ~g~0 := ~a2; VAL [#in~a1=0, #in~a2=-1, old(~g~0)=0, ~a1=0, ~a2=-1, ~g~0=-1] [L18] RET call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=-1, #in~a2=0, #t~ret0=0, old(~g~0)=0, ~a1=-1, ~a2=0, ~g~0=-1] [L18] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L18] havoc #t~ret0; VAL [#in~a1=-1, #in~a2=0, old(~g~0)=0, ~a1=-1, ~a2=0, ~g~0=-1] [L28] RET call #t~ret2 := A(~g~1, ~h~0); VAL [~g~0=-1] [L28] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; [L28] havoc #t~ret2; VAL [~g~0=-1] [L29] CALL call #t~ret3 := A(~g~1, ~h~0); VAL [#in~a1=-1, #in~a2=0, old(~g~0)=-1, ~g~0=-1] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=-1, #in~a2=0, old(~g~0)=-1, ~a1=-1, ~a2=0, ~g~0=-1] [L17-L21] COND TRUE 0 != ~a1 VAL [#in~a1=-1, #in~a2=0, old(~g~0)=-1, ~a1=-1, ~a2=0, ~g~0=-1] [L18] CALL call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=0, #in~a2=-1, old(~g~0)=-1, ~g~0=-1] [L16-L22] ~a1 := #in~a1; [L16-L22] ~a2 := #in~a2; VAL [#in~a1=0, #in~a2=-1, old(~g~0)=-1, ~a1=0, ~a2=-1, ~g~0=-1] [L17-L21] COND FALSE !(0 != ~a1) [L20] ~g~0 := ~a2; VAL [#in~a1=0, #in~a2=-1, old(~g~0)=-1, ~a1=0, ~a2=-1, ~g~0=-1] [L18] RET call #t~ret0 := A(~a2, ~a1); VAL [#in~a1=-1, #in~a2=0, #t~ret0=0, old(~g~0)=-1, ~a1=-1, ~a2=0, ~g~0=-1] [L18] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L18] havoc #t~ret0; VAL [#in~a1=-1, #in~a2=0, old(~g~0)=-1, ~a1=-1, ~a2=0, ~g~0=-1] [L29] RET call #t~ret3 := A(~g~1, ~h~0); VAL [~g~0=-1] [L29] assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; [L29] havoc #t~ret3; VAL [~g~0=-1] [L30-L32] COND TRUE 0 != ~g~1 VAL [~g~0=-1] [L31] assert false; VAL [~g~0=-1] [L14] int g; [L26] int g = __VERIFIER_nondet_int(); [L27] int h = !g; VAL [g=0] [L28] CALL A(g,h) VAL [\old(a1)=-1, \old(a2)=0, \old(g)=0, g=0] [L17] COND TRUE \read(a1) VAL [\old(a1)=-1, \old(a2)=0, \old(g)=0, a1=-1, a2=0, g=0] [L18] CALL A(a2,a1) VAL [\old(a1)=0, \old(a2)=-1, \old(g)=0, g=0] [L17] COND FALSE !(\read(a1)) [L20] g = a2 VAL [\old(a1)=0, \old(a2)=-1, \old(g)=0, a1=0, a2=-1, g=-1] [L18] RET A(a2,a1) VAL [\old(a1)=-1, \old(a2)=0, \old(g)=0, A(a2,a1)=0, a1=-1, a2=0, g=-1] [L28] RET A(g,h) VAL [g=-1] [L29] CALL A(g,h) VAL [\old(a1)=-1, \old(a2)=0, \old(g)=-1, g=-1] [L17] COND TRUE \read(a1) VAL [\old(a1)=-1, \old(a2)=0, \old(g)=-1, a1=-1, a2=0, g=-1] [L18] CALL A(a2,a1) VAL [\old(a1)=0, \old(a2)=-1, \old(g)=-1, g=-1] [L17] COND FALSE !(\read(a1)) [L20] g = a2 VAL [\old(a1)=0, \old(a2)=-1, \old(g)=-1, a1=0, a2=-1, g=-1] [L18] RET A(a2,a1) VAL [\old(a1)=-1, \old(a2)=0, \old(g)=-1, A(a2,a1)=0, a1=-1, a2=0, g=-1] [L29] RET A(g,h) VAL [g=-1] [L30] COND TRUE \read(g) VAL [g=-1] [L31] __VERIFIER_error() VAL [g=-1] ----- [2018-11-23 02:44:08,519 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_e1dbfa53-b574-40b2-9227-004a45d16d8c/bin-2019/ukojak/witness.graphml [2018-11-23 02:44:08,519 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 02:44:08,520 INFO L168 Benchmark]: Toolchain (without parser) took 1010.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 959.1 MB in the beginning and 1.1 GB in the end (delta: -113.1 MB). Peak memory consumption was 16.9 MB. Max. memory is 11.5 GB. [2018-11-23 02:44:08,521 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:44:08,521 INFO L168 Benchmark]: CACSL2BoogieTranslator took 144.08 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 947.3 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2018-11-23 02:44:08,522 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.24 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 944.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 02:44:08,522 INFO L168 Benchmark]: Boogie Preprocessor took 10.88 ms. Allocated memory is still 1.0 GB. Free memory is still 944.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:44:08,523 INFO L168 Benchmark]: RCFGBuilder took 224.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -167.7 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2018-11-23 02:44:08,523 INFO L168 Benchmark]: CodeCheck took 542.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 36.6 MB). Peak memory consumption was 36.6 MB. Max. memory is 11.5 GB. [2018-11-23 02:44:08,524 INFO L168 Benchmark]: Witness Printer took 58.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-11-23 02:44:08,526 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 2 procedures, 18 locations, 1 error locations. UNSAFE Result, 0.4s OverallTime, 2 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 15 SDtfs, 6 SDslu, 8 SDs, 0 SdLazy, 21 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 42 NumberOfCodeBlocks, 42 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 14 ConstructedInterpolants, 0 QuantifiedInterpolants, 560 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 0 PerfectInterpolantSequences, 1/4 InterpolantCoveringCapability, 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: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 31]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L14] int g; [L26] int g = __VERIFIER_nondet_int(); [L27] int h = !g; VAL [g=0] [L28] CALL A(g,h) VAL [\old(a1)=-1, \old(a2)=0, \old(g)=0, g=0] [L17] COND TRUE \read(a1) VAL [\old(a1)=-1, \old(a2)=0, \old(g)=0, a1=-1, a2=0, g=0] [L18] CALL A(a2,a1) VAL [\old(a1)=0, \old(a2)=-1, \old(g)=0, g=0] [L17] COND FALSE !(\read(a1)) [L20] g = a2 VAL [\old(a1)=0, \old(a2)=-1, \old(g)=0, a1=0, a2=-1, g=-1] [L18] RET A(a2,a1) VAL [\old(a1)=-1, \old(a2)=0, \old(g)=0, A(a2,a1)=0, a1=-1, a2=0, g=-1] [L28] RET A(g,h) VAL [g=-1] [L29] CALL A(g,h) VAL [\old(a1)=-1, \old(a2)=0, \old(g)=-1, g=-1] [L17] COND TRUE \read(a1) VAL [\old(a1)=-1, \old(a2)=0, \old(g)=-1, a1=-1, a2=0, g=-1] [L18] CALL A(a2,a1) VAL [\old(a1)=0, \old(a2)=-1, \old(g)=-1, g=-1] [L17] COND FALSE !(\read(a1)) [L20] g = a2 VAL [\old(a1)=0, \old(a2)=-1, \old(g)=-1, a1=0, a2=-1, g=-1] [L18] RET A(a2,a1) VAL [\old(a1)=-1, \old(a2)=0, \old(g)=-1, A(a2,a1)=0, a1=-1, a2=0, g=-1] [L29] RET A(g,h) VAL [g=-1] [L30] COND TRUE \read(g) VAL [g=-1] [L31] __VERIFIER_error() VAL [g=-1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 144.08 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 947.3 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.24 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 944.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.88 ms. Allocated memory is still 1.0 GB. Free memory is still 944.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 224.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -167.7 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * CodeCheck took 542.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 36.6 MB). Peak memory consumption was 36.6 MB. Max. memory is 11.5 GB. * Witness Printer took 58.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...