./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/bitvector-loops/diamond_false-unreach-call2.i --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_3c4d5b22-1680-4691-a4c2-b71c5f008d46/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3c4d5b22-1680-4691-a4c2-b71c5f008d46/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3c4d5b22-1680-4691-a4c2-b71c5f008d46/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3c4d5b22-1680-4691-a4c2-b71c5f008d46/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/bitvector-loops/diamond_false-unreach-call2.i -s /tmp/vcloud-vcloud-master/worker/working_dir_3c4d5b22-1680-4691-a4c2-b71c5f008d46/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3c4d5b22-1680-4691-a4c2-b71c5f008d46/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 dee4f98e3deb83265bbf70c3b5c0f3c1ff37b06c ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 13:47:27,809 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:47:27,810 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:47:27,818 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:47:27,818 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:47:27,819 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:47:27,820 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:47:27,821 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:47:27,822 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:47:27,823 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:47:27,824 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:47:27,824 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:47:27,825 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:47:27,825 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:47:27,826 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:47:27,827 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:47:27,828 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:47:27,829 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:47:27,830 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:47:27,831 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:47:27,832 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:47:27,833 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:47:27,835 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:47:27,835 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:47:27,835 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:47:27,836 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:47:27,837 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:47:27,837 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:47:27,838 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:47:27,839 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:47:27,839 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:47:27,839 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:47:27,840 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:47:27,840 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:47:27,841 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:47:27,841 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:47:27,841 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3c4d5b22-1680-4691-a4c2-b71c5f008d46/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-23 13:47:27,852 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:47:27,853 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:47:27,853 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:47:27,854 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-23 13:47:27,854 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:47:27,854 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:47:27,855 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:47:27,855 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:47:27,855 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:47:27,855 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:47:27,855 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:47:27,855 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:47:27,856 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:47:27,856 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:47:27,856 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:47:27,856 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:47:27,856 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:47:27,856 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:47:27,856 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 13:47:27,857 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 13:47:27,857 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:47:27,857 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:47:27,857 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 13:47:27,857 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:47:27,857 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:47:27,858 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:47:27,858 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-23 13:47:27,858 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:47:27,858 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:47:27,858 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_3c4d5b22-1680-4691-a4c2-b71c5f008d46/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 -> dee4f98e3deb83265bbf70c3b5c0f3c1ff37b06c [2018-11-23 13:47:27,881 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:47:27,890 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:47:27,892 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:47:27,893 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:47:27,893 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:47:27,894 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3c4d5b22-1680-4691-a4c2-b71c5f008d46/bin-2019/ukojak/../../sv-benchmarks/c/bitvector-loops/diamond_false-unreach-call2.i [2018-11-23 13:47:27,934 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3c4d5b22-1680-4691-a4c2-b71c5f008d46/bin-2019/ukojak/data/2c96f6907/ef875a8ef28e4aa48b94959c97709493/FLAG62b394456 [2018-11-23 13:47:28,275 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:47:28,276 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3c4d5b22-1680-4691-a4c2-b71c5f008d46/sv-benchmarks/c/bitvector-loops/diamond_false-unreach-call2.i [2018-11-23 13:47:28,280 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3c4d5b22-1680-4691-a4c2-b71c5f008d46/bin-2019/ukojak/data/2c96f6907/ef875a8ef28e4aa48b94959c97709493/FLAG62b394456 [2018-11-23 13:47:28,702 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3c4d5b22-1680-4691-a4c2-b71c5f008d46/bin-2019/ukojak/data/2c96f6907/ef875a8ef28e4aa48b94959c97709493 [2018-11-23 13:47:28,705 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:47:28,706 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:47:28,706 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:47:28,706 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:47:28,709 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:47:28,709 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:47:28" (1/1) ... [2018-11-23 13:47:28,711 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76b02929 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:47:28, skipping insertion in model container [2018-11-23 13:47:28,712 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:47:28" (1/1) ... [2018-11-23 13:47:28,718 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:47:28,733 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:47:28,858 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:47:28,861 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:47:28,877 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:47:28,886 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:47:28,887 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:47:28 WrapperNode [2018-11-23 13:47:28,887 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:47:28,887 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:47:28,887 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:47:28,887 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:47:28,893 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:47:28" (1/1) ... [2018-11-23 13:47:28,896 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:47:28" (1/1) ... [2018-11-23 13:47:28,915 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:47:28,915 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:47:28,915 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:47:28,915 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:47:28,923 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:47:28" (1/1) ... [2018-11-23 13:47:28,923 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:47:28" (1/1) ... [2018-11-23 13:47:28,924 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:47:28" (1/1) ... [2018-11-23 13:47:28,924 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:47:28" (1/1) ... [2018-11-23 13:47:28,926 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:47:28" (1/1) ... [2018-11-23 13:47:28,930 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:47:28" (1/1) ... [2018-11-23 13:47:28,931 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:47:28" (1/1) ... [2018-11-23 13:47:28,933 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:47:28,933 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:47:28,933 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:47:28,933 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:47:28,934 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:47:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3c4d5b22-1680-4691-a4c2-b71c5f008d46/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 13:47:29,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:47:29,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:47:29,381 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:47:29,381 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-11-23 13:47:29,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:47:29 BoogieIcfgContainer [2018-11-23 13:47:29,382 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:47:29,382 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 13:47:29,382 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 13:47:29,389 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 13:47:29,389 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:47:29" (1/1) ... [2018-11-23 13:47:29,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:47:29,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:47:29,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 7 states and 8 transitions. [2018-11-23 13:47:29,421 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-11-23 13:47:29,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-11-23 13:47:29,424 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:47:29,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:47:29,558 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:47:29,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:47:29,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 8 states and 9 transitions. [2018-11-23 13:47:29,593 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2018-11-23 13:47:29,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-11-23 13:47:29,593 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:47:29,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:47:29,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:47:29,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:47:29,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:47:29,672 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 2 iterations. ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~x~0, main_~y~0;main_~x~0 := 0;main_~y~0 := main_#t~nondet0;havoc main_#t~nondet0; VAL [ULTIMATE.start_main_~x~0=0] [?] assume !!(main_~x~0 % 4294967296 < 99);BeginParallelComposition{ParallelCodeBlock0: assume 0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296;main_#t~post1 := main_~x~0;main_~x~0 := 1 + main_#t~post1;havoc main_#t~post1;ParallelCodeBlock1: assume !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296);main_~x~0 := 2 + main_~x~0;}EndParallelCompositionBeginParallelComposition{ParallelCodeBlock0: assume 0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296;main_~x~0 := 2 + main_~x~0;ParallelCodeBlock1: assume !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296);main_~x~0 := main_~x~0 - 2;}EndParallelCompositionBeginParallelComposition{ParallelCodeBlock0: assume 0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296;main_~x~0 := 2 + main_~x~0;ParallelCodeBlock1: assume !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296);main_~x~0 := 2 + main_~x~0;}EndParallelCompositionBeginParallelComposition{ParallelCodeBlock0: assume 0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296;main_~x~0 := 2 + main_~x~0;ParallelCodeBlock1: assume !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296);main_~x~0 := main_~x~0 - 2;}EndParallelCompositionBeginParallelComposition{ParallelCodeBlock0: assume 0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296;main_~x~0 := 2 + main_~x~0;ParallelCodeBlock1: assume !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296);main_~x~0 := 2 + main_~x~0;}EndParallelCompositionBeginParallelComposition{ParallelCodeBlock0: assume 0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296;main_~x~0 := 2 + main_~x~0;ParallelCodeBlock1: assume !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296);main_~x~0 := main_~x~0 - 4;}EndParallelCompositionBeginParallelComposition{ParallelCodeBlock0: assume 0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296;main_~x~0 := 2 + main_~x~0;ParallelCodeBlock1: assume !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296);main_~x~0 := 4 + main_~x~0;}EndParallelCompositionBeginParallelComposition{ParallelCodeBlock0: assume 0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296;main_~x~0 := 2 + main_~x~0;ParallelCodeBlock1: assume !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296);main_~x~0 := 2 + main_~x~0;}EndParallelCompositionBeginParallelComposition{ParallelCodeBlock0: assume 0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296;main_~x~0 := 2 + main_~x~0;ParallelCodeBlock1: assume !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296);main_~x~0 := main_~x~0 - 4;}EndParallelCompositionBeginParallelComposition{ParallelCodeBlock0: assume 0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296;main_~x~0 := 2 + main_~x~0;ParallelCodeBlock1: assume !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296);main_~x~0 := main_~x~0 - 4;}EndParallelComposition VAL [ULTIMATE.start_main_~x~0=(- 4), ULTIMATE.start_main_~y~0=1, |ULTIMATE.start_main_#t~post1|=11] [?] BeginParallelComposition{ParallelCodeBlock0: assume !true;ParallelCodeBlock1: assume !(main_~x~0 % 4294967296 < 99);}EndParallelComposition__VERIFIER_assert_#in~cond := (if (if main_~x~0 % 4294967296 < 0 && 0 != main_~x~0 % 4294967296 % 2 then main_~x~0 % 4294967296 % 2 - 2 else main_~x~0 % 4294967296 % 2) % 4294967296 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [ULTIMATE.start___VERIFIER_assert_~cond=0, ULTIMATE.start_main_~x~0=(- 4), ULTIMATE.start_main_~y~0=1, |ULTIMATE.start___VERIFIER_assert_#in~cond|=0, |ULTIMATE.start_main_#t~post1|=11] [?] assume 0 == __VERIFIER_assert_~cond; VAL [ULTIMATE.start___VERIFIER_assert_~cond=0, ULTIMATE.start_main_~x~0=(- 4), ULTIMATE.start_main_~y~0=1, |ULTIMATE.start___VERIFIER_assert_#in~cond|=0, |ULTIMATE.start_main_#t~post1|=11] [?] assume !false; VAL [ULTIMATE.start___VERIFIER_assert_~cond=0, ULTIMATE.start_main_~x~0=(- 4), ULTIMATE.start_main_~y~0=1, |ULTIMATE.start___VERIFIER_assert_#in~cond|=0, |ULTIMATE.start_main_#t~post1|=11] [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~post1, main_~x~0, main_~y~0; [L10] main_~x~0 := 0; [L11] main_~y~0 := main_#t~nondet0; [L11] havoc main_#t~nondet0; VAL [main_~x~0=0] [L12-L33] assume !!(main_~x~0 % 4294967296 < 99); [L13-L14] assume !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296); [L14] main_~x~0 := 2 + main_~x~0; [L15-L16] assume !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296); [L16] main_~x~0 := main_~x~0 - 2; [L17-L18] assume !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296); [L18] main_~x~0 := 2 + main_~x~0; [L19-L20] assume !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296); [L20] main_~x~0 := main_~x~0 - 2; [L21-L22] assume !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296); [L22] main_~x~0 := 2 + main_~x~0; [L23-L24] assume !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296); [L24] main_~x~0 := main_~x~0 - 4; [L25-L26] assume !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296); [L26] main_~x~0 := 4 + main_~x~0; [L27-L28] assume !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296); [L28] main_~x~0 := 2 + main_~x~0; [L29-L30] assume !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296); [L30] main_~x~0 := main_~x~0 - 4; [L31-L32] assume !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296); [L32] main_~x~0 := main_~x~0 - 4; VAL [main_#t~post1=11, main_~x~0=-4, main_~y~0=1] [L12-L33] assume !(main_~x~0 % 4294967296 < 99); [L34] __VERIFIER_assert_#in~cond := (if (if main_~x~0 % 4294967296 < 0 && 0 != main_~x~0 % 4294967296 % 2 then main_~x~0 % 4294967296 % 2 - 2 else main_~x~0 % 4294967296 % 2) % 4294967296 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0); [L34] havoc __VERIFIER_assert_~cond; [L3-L8] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_#t~post1=11, main_~x~0=-4, main_~y~0=1] [L4-L6] assume 0 == __VERIFIER_assert_~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_#t~post1=11, main_~x~0=-4, main_~y~0=1] [L5] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_#t~post1=11, main_~x~0=-4, main_~y~0=1] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~post1, main_~x~0, main_~y~0; [L10] main_~x~0 := 0; [L11] main_~y~0 := main_#t~nondet0; [L11] havoc main_#t~nondet0; VAL [main_~x~0=0] [L12-L33] assume !!(main_~x~0 % 4294967296 < 99); [L13-L14] assume !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296); [L14] main_~x~0 := 2 + main_~x~0; [L15-L16] assume !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296); [L16] main_~x~0 := main_~x~0 - 2; [L17-L18] assume !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296); [L18] main_~x~0 := 2 + main_~x~0; [L19-L20] assume !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296); [L20] main_~x~0 := main_~x~0 - 2; [L21-L22] assume !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296); [L22] main_~x~0 := 2 + main_~x~0; [L23-L24] assume !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296); [L24] main_~x~0 := main_~x~0 - 4; [L25-L26] assume !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296); [L26] main_~x~0 := 4 + main_~x~0; [L27-L28] assume !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296); [L28] main_~x~0 := 2 + main_~x~0; [L29-L30] assume !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296); [L30] main_~x~0 := main_~x~0 - 4; [L31-L32] assume !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296); [L32] main_~x~0 := main_~x~0 - 4; VAL [main_#t~post1=11, main_~x~0=-4, main_~y~0=1] [L12-L33] assume !(main_~x~0 % 4294967296 < 99); [L34] __VERIFIER_assert_#in~cond := (if (if main_~x~0 % 4294967296 < 0 && 0 != main_~x~0 % 4294967296 % 2 then main_~x~0 % 4294967296 % 2 - 2 else main_~x~0 % 4294967296 % 2) % 4294967296 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0); [L34] havoc __VERIFIER_assert_~cond; [L3-L8] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_#t~post1=11, main_~x~0=-4, main_~y~0=1] [L4-L6] assume 0 == __VERIFIER_assert_~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_#t~post1=11, main_~x~0=-4, main_~y~0=1] [L5] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_#t~post1=11, main_~x~0=-4, main_~y~0=1] [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~post1, main_~x~0, main_~y~0; [L10] main_~x~0 := 0; [L11] main_~y~0 := main_#t~nondet0; [L11] havoc main_#t~nondet0; VAL [main_~x~0=0] [L12-L33] COND FALSE !(!(main_~x~0 % 4294967296 < 99)) [L13] COND FALSE !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296) [L14] main_~x~0 := 2 + main_~x~0; [L15] COND FALSE !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296) [L16] main_~x~0 := main_~x~0 - 2; [L17] COND FALSE !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296) [L18] main_~x~0 := 2 + main_~x~0; [L19] COND FALSE !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296) [L20] main_~x~0 := main_~x~0 - 2; [L21] COND FALSE !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296) [L22] main_~x~0 := 2 + main_~x~0; [L23] COND FALSE !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296) [L24] main_~x~0 := main_~x~0 - 4; [L25] COND FALSE !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296) [L26] main_~x~0 := 4 + main_~x~0; [L27] COND FALSE !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296) [L28] main_~x~0 := 2 + main_~x~0; [L29] COND FALSE !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296) [L30] main_~x~0 := main_~x~0 - 4; [L31] COND FALSE !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296) [L32] main_~x~0 := main_~x~0 - 4; VAL [main_#t~post1=11, main_~x~0=-4, main_~y~0=1] [L12-L33] COND TRUE !(main_~x~0 % 4294967296 < 99) [L34] __VERIFIER_assert_#in~cond := (if (if main_~x~0 % 4294967296 < 0 && 0 != main_~x~0 % 4294967296 % 2 then main_~x~0 % 4294967296 % 2 - 2 else main_~x~0 % 4294967296 % 2) % 4294967296 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0); [L34] havoc __VERIFIER_assert_~cond; [L3-L8] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_#t~post1=11, main_~x~0=-4, main_~y~0=1] [L4] COND TRUE 0 == __VERIFIER_assert_~cond VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_#t~post1=11, main_~x~0=-4, main_~y~0=1] [L5] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_#t~post1=11, main_~x~0=-4, main_~y~0=1] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~post1, main_~x~0, main_~y~0; [L10] main_~x~0 := 0; [L11] main_~y~0 := main_#t~nondet0; [L11] havoc main_#t~nondet0; VAL [main_~x~0=0] [L12-L33] COND FALSE !(!(main_~x~0 % 4294967296 < 99)) [L13] COND FALSE !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296) [L14] main_~x~0 := 2 + main_~x~0; [L15] COND FALSE !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296) [L16] main_~x~0 := main_~x~0 - 2; [L17] COND FALSE !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296) [L18] main_~x~0 := 2 + main_~x~0; [L19] COND FALSE !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296) [L20] main_~x~0 := main_~x~0 - 2; [L21] COND FALSE !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296) [L22] main_~x~0 := 2 + main_~x~0; [L23] COND FALSE !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296) [L24] main_~x~0 := main_~x~0 - 4; [L25] COND FALSE !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296) [L26] main_~x~0 := 4 + main_~x~0; [L27] COND FALSE !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296) [L28] main_~x~0 := 2 + main_~x~0; [L29] COND FALSE !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296) [L30] main_~x~0 := main_~x~0 - 4; [L31] COND FALSE !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296) [L32] main_~x~0 := main_~x~0 - 4; VAL [main_#t~post1=11, main_~x~0=-4, main_~y~0=1] [L12-L33] COND TRUE !(main_~x~0 % 4294967296 < 99) [L34] __VERIFIER_assert_#in~cond := (if (if main_~x~0 % 4294967296 < 0 && 0 != main_~x~0 % 4294967296 % 2 then main_~x~0 % 4294967296 % 2 - 2 else main_~x~0 % 4294967296 % 2) % 4294967296 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0); [L34] havoc __VERIFIER_assert_~cond; [L3-L8] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_#t~post1=11, main_~x~0=-4, main_~y~0=1] [L4] COND TRUE 0 == __VERIFIER_assert_~cond VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_#t~post1=11, main_~x~0=-4, main_~y~0=1] [L5] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_#t~post1=11, main_~x~0=-4, main_~y~0=1] [L10] ~x~0 := 0; [L11] ~y~0 := #t~nondet0; [L11] havoc #t~nondet0; [L12-L33] COND FALSE !(!(~x~0 % 4294967296 < 99)) [L13] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L14] ~x~0 := 2 + ~x~0; [L15] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L16] ~x~0 := ~x~0 - 2; [L17] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L18] ~x~0 := 2 + ~x~0; [L19] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L20] ~x~0 := ~x~0 - 2; [L21] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L22] ~x~0 := 2 + ~x~0; [L23] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L24] ~x~0 := ~x~0 - 4; [L25] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L26] ~x~0 := 4 + ~x~0; [L27] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L28] ~x~0 := 2 + ~x~0; [L29] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L30] ~x~0 := ~x~0 - 4; [L31] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L32] ~x~0 := ~x~0 - 4; [L12-L33] COND TRUE !(~x~0 % 4294967296 < 99) [L3-L8] ~cond := #in~cond; [L4] COND TRUE 0 == ~cond [L5] assert false; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L10] ~x~0 := 0; [L11] ~y~0 := #t~nondet0; [L11] havoc #t~nondet0; [L12-L33] COND FALSE !(!(~x~0 % 4294967296 < 99)) [L13] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L14] ~x~0 := 2 + ~x~0; [L15] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L16] ~x~0 := ~x~0 - 2; [L17] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L18] ~x~0 := 2 + ~x~0; [L19] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L20] ~x~0 := ~x~0 - 2; [L21] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L22] ~x~0 := 2 + ~x~0; [L23] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L24] ~x~0 := ~x~0 - 4; [L25] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L26] ~x~0 := 4 + ~x~0; [L27] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L28] ~x~0 := 2 + ~x~0; [L29] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L30] ~x~0 := ~x~0 - 4; [L31] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L32] ~x~0 := ~x~0 - 4; [L12-L33] COND TRUE !(~x~0 % 4294967296 < 99) [L3-L8] ~cond := #in~cond; [L4] COND TRUE 0 == ~cond [L5] assert false; [L10] unsigned int x = 0; [L11] unsigned int y = __VERIFIER_nondet_uint(); [L12] COND TRUE x < 99 [L13] COND FALSE !(y % 2 == 0) [L14] x += 2 [L15] COND FALSE !(y % 2 == 0) [L16] x -= 2 [L17] COND FALSE !(y % 2 == 0) [L18] x += 2 [L19] COND FALSE !(y % 2 == 0) [L20] x -= 2 [L21] COND FALSE !(y % 2 == 0) [L22] x += 2 [L23] COND FALSE !(y % 2 == 0) [L24] x -= 4 [L25] COND FALSE !(y % 2 == 0) [L26] x += 4 [L27] COND FALSE !(y % 2 == 0) [L28] x += 2 [L29] COND FALSE !(y % 2 == 0) [L30] x -= 4 [L31] COND FALSE !(y % 2 == 0) [L32] x -= 4 [L12] COND FALSE !(x < 99) [L4] COND TRUE !(cond) [L5] __VERIFIER_error() ----- [2018-11-23 13:47:29,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 01:47:29 ImpRootNode [2018-11-23 13:47:29,701 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-23 13:47:29,701 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:47:29,702 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:47:29,702 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:47:29,702 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:47:29" (3/4) ... [2018-11-23 13:47:29,704 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~x~0, main_~y~0;main_~x~0 := 0;main_~y~0 := main_#t~nondet0;havoc main_#t~nondet0; VAL [ULTIMATE.start_main_~x~0=0] [?] assume !!(main_~x~0 % 4294967296 < 99);BeginParallelComposition{ParallelCodeBlock0: assume 0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296;main_#t~post1 := main_~x~0;main_~x~0 := 1 + main_#t~post1;havoc main_#t~post1;ParallelCodeBlock1: assume !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296);main_~x~0 := 2 + main_~x~0;}EndParallelCompositionBeginParallelComposition{ParallelCodeBlock0: assume 0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296;main_~x~0 := 2 + main_~x~0;ParallelCodeBlock1: assume !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296);main_~x~0 := main_~x~0 - 2;}EndParallelCompositionBeginParallelComposition{ParallelCodeBlock0: assume 0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296;main_~x~0 := 2 + main_~x~0;ParallelCodeBlock1: assume !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296);main_~x~0 := 2 + main_~x~0;}EndParallelCompositionBeginParallelComposition{ParallelCodeBlock0: assume 0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296;main_~x~0 := 2 + main_~x~0;ParallelCodeBlock1: assume !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296);main_~x~0 := main_~x~0 - 2;}EndParallelCompositionBeginParallelComposition{ParallelCodeBlock0: assume 0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296;main_~x~0 := 2 + main_~x~0;ParallelCodeBlock1: assume !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296);main_~x~0 := 2 + main_~x~0;}EndParallelCompositionBeginParallelComposition{ParallelCodeBlock0: assume 0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296;main_~x~0 := 2 + main_~x~0;ParallelCodeBlock1: assume !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296);main_~x~0 := main_~x~0 - 4;}EndParallelCompositionBeginParallelComposition{ParallelCodeBlock0: assume 0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296;main_~x~0 := 2 + main_~x~0;ParallelCodeBlock1: assume !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296);main_~x~0 := 4 + main_~x~0;}EndParallelCompositionBeginParallelComposition{ParallelCodeBlock0: assume 0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296;main_~x~0 := 2 + main_~x~0;ParallelCodeBlock1: assume !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296);main_~x~0 := 2 + main_~x~0;}EndParallelCompositionBeginParallelComposition{ParallelCodeBlock0: assume 0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296;main_~x~0 := 2 + main_~x~0;ParallelCodeBlock1: assume !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296);main_~x~0 := main_~x~0 - 4;}EndParallelCompositionBeginParallelComposition{ParallelCodeBlock0: assume 0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296;main_~x~0 := 2 + main_~x~0;ParallelCodeBlock1: assume !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296);main_~x~0 := main_~x~0 - 4;}EndParallelComposition VAL [ULTIMATE.start_main_~x~0=(- 4), ULTIMATE.start_main_~y~0=1, |ULTIMATE.start_main_#t~post1|=11] [?] BeginParallelComposition{ParallelCodeBlock0: assume !true;ParallelCodeBlock1: assume !(main_~x~0 % 4294967296 < 99);}EndParallelComposition__VERIFIER_assert_#in~cond := (if (if main_~x~0 % 4294967296 < 0 && 0 != main_~x~0 % 4294967296 % 2 then main_~x~0 % 4294967296 % 2 - 2 else main_~x~0 % 4294967296 % 2) % 4294967296 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [ULTIMATE.start___VERIFIER_assert_~cond=0, ULTIMATE.start_main_~x~0=(- 4), ULTIMATE.start_main_~y~0=1, |ULTIMATE.start___VERIFIER_assert_#in~cond|=0, |ULTIMATE.start_main_#t~post1|=11] [?] assume 0 == __VERIFIER_assert_~cond; VAL [ULTIMATE.start___VERIFIER_assert_~cond=0, ULTIMATE.start_main_~x~0=(- 4), ULTIMATE.start_main_~y~0=1, |ULTIMATE.start___VERIFIER_assert_#in~cond|=0, |ULTIMATE.start_main_#t~post1|=11] [?] assume !false; VAL [ULTIMATE.start___VERIFIER_assert_~cond=0, ULTIMATE.start_main_~x~0=(- 4), ULTIMATE.start_main_~y~0=1, |ULTIMATE.start___VERIFIER_assert_#in~cond|=0, |ULTIMATE.start_main_#t~post1|=11] [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~post1, main_~x~0, main_~y~0; [L10] main_~x~0 := 0; [L11] main_~y~0 := main_#t~nondet0; [L11] havoc main_#t~nondet0; VAL [main_~x~0=0] [L12-L33] assume !!(main_~x~0 % 4294967296 < 99); [L13-L14] assume !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296); [L14] main_~x~0 := 2 + main_~x~0; [L15-L16] assume !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296); [L16] main_~x~0 := main_~x~0 - 2; [L17-L18] assume !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296); [L18] main_~x~0 := 2 + main_~x~0; [L19-L20] assume !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296); [L20] main_~x~0 := main_~x~0 - 2; [L21-L22] assume !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296); [L22] main_~x~0 := 2 + main_~x~0; [L23-L24] assume !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296); [L24] main_~x~0 := main_~x~0 - 4; [L25-L26] assume !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296); [L26] main_~x~0 := 4 + main_~x~0; [L27-L28] assume !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296); [L28] main_~x~0 := 2 + main_~x~0; [L29-L30] assume !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296); [L30] main_~x~0 := main_~x~0 - 4; [L31-L32] assume !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296); [L32] main_~x~0 := main_~x~0 - 4; VAL [main_#t~post1=11, main_~x~0=-4, main_~y~0=1] [L12-L33] assume !(main_~x~0 % 4294967296 < 99); [L34] __VERIFIER_assert_#in~cond := (if (if main_~x~0 % 4294967296 < 0 && 0 != main_~x~0 % 4294967296 % 2 then main_~x~0 % 4294967296 % 2 - 2 else main_~x~0 % 4294967296 % 2) % 4294967296 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0); [L34] havoc __VERIFIER_assert_~cond; [L3-L8] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_#t~post1=11, main_~x~0=-4, main_~y~0=1] [L4-L6] assume 0 == __VERIFIER_assert_~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_#t~post1=11, main_~x~0=-4, main_~y~0=1] [L5] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_#t~post1=11, main_~x~0=-4, main_~y~0=1] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~post1, main_~x~0, main_~y~0; [L10] main_~x~0 := 0; [L11] main_~y~0 := main_#t~nondet0; [L11] havoc main_#t~nondet0; VAL [main_~x~0=0] [L12-L33] assume !!(main_~x~0 % 4294967296 < 99); [L13-L14] assume !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296); [L14] main_~x~0 := 2 + main_~x~0; [L15-L16] assume !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296); [L16] main_~x~0 := main_~x~0 - 2; [L17-L18] assume !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296); [L18] main_~x~0 := 2 + main_~x~0; [L19-L20] assume !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296); [L20] main_~x~0 := main_~x~0 - 2; [L21-L22] assume !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296); [L22] main_~x~0 := 2 + main_~x~0; [L23-L24] assume !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296); [L24] main_~x~0 := main_~x~0 - 4; [L25-L26] assume !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296); [L26] main_~x~0 := 4 + main_~x~0; [L27-L28] assume !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296); [L28] main_~x~0 := 2 + main_~x~0; [L29-L30] assume !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296); [L30] main_~x~0 := main_~x~0 - 4; [L31-L32] assume !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296); [L32] main_~x~0 := main_~x~0 - 4; VAL [main_#t~post1=11, main_~x~0=-4, main_~y~0=1] [L12-L33] assume !(main_~x~0 % 4294967296 < 99); [L34] __VERIFIER_assert_#in~cond := (if (if main_~x~0 % 4294967296 < 0 && 0 != main_~x~0 % 4294967296 % 2 then main_~x~0 % 4294967296 % 2 - 2 else main_~x~0 % 4294967296 % 2) % 4294967296 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0); [L34] havoc __VERIFIER_assert_~cond; [L3-L8] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_#t~post1=11, main_~x~0=-4, main_~y~0=1] [L4-L6] assume 0 == __VERIFIER_assert_~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_#t~post1=11, main_~x~0=-4, main_~y~0=1] [L5] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_#t~post1=11, main_~x~0=-4, main_~y~0=1] [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~post1, main_~x~0, main_~y~0; [L10] main_~x~0 := 0; [L11] main_~y~0 := main_#t~nondet0; [L11] havoc main_#t~nondet0; VAL [main_~x~0=0] [L12-L33] COND FALSE !(!(main_~x~0 % 4294967296 < 99)) [L13] COND FALSE !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296) [L14] main_~x~0 := 2 + main_~x~0; [L15] COND FALSE !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296) [L16] main_~x~0 := main_~x~0 - 2; [L17] COND FALSE !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296) [L18] main_~x~0 := 2 + main_~x~0; [L19] COND FALSE !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296) [L20] main_~x~0 := main_~x~0 - 2; [L21] COND FALSE !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296) [L22] main_~x~0 := 2 + main_~x~0; [L23] COND FALSE !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296) [L24] main_~x~0 := main_~x~0 - 4; [L25] COND FALSE !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296) [L26] main_~x~0 := 4 + main_~x~0; [L27] COND FALSE !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296) [L28] main_~x~0 := 2 + main_~x~0; [L29] COND FALSE !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296) [L30] main_~x~0 := main_~x~0 - 4; [L31] COND FALSE !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296) [L32] main_~x~0 := main_~x~0 - 4; VAL [main_#t~post1=11, main_~x~0=-4, main_~y~0=1] [L12-L33] COND TRUE !(main_~x~0 % 4294967296 < 99) [L34] __VERIFIER_assert_#in~cond := (if (if main_~x~0 % 4294967296 < 0 && 0 != main_~x~0 % 4294967296 % 2 then main_~x~0 % 4294967296 % 2 - 2 else main_~x~0 % 4294967296 % 2) % 4294967296 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0); [L34] havoc __VERIFIER_assert_~cond; [L3-L8] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_#t~post1=11, main_~x~0=-4, main_~y~0=1] [L4] COND TRUE 0 == __VERIFIER_assert_~cond VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_#t~post1=11, main_~x~0=-4, main_~y~0=1] [L5] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_#t~post1=11, main_~x~0=-4, main_~y~0=1] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~post1, main_~x~0, main_~y~0; [L10] main_~x~0 := 0; [L11] main_~y~0 := main_#t~nondet0; [L11] havoc main_#t~nondet0; VAL [main_~x~0=0] [L12-L33] COND FALSE !(!(main_~x~0 % 4294967296 < 99)) [L13] COND FALSE !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296) [L14] main_~x~0 := 2 + main_~x~0; [L15] COND FALSE !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296) [L16] main_~x~0 := main_~x~0 - 2; [L17] COND FALSE !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296) [L18] main_~x~0 := 2 + main_~x~0; [L19] COND FALSE !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296) [L20] main_~x~0 := main_~x~0 - 2; [L21] COND FALSE !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296) [L22] main_~x~0 := 2 + main_~x~0; [L23] COND FALSE !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296) [L24] main_~x~0 := main_~x~0 - 4; [L25] COND FALSE !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296) [L26] main_~x~0 := 4 + main_~x~0; [L27] COND FALSE !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296) [L28] main_~x~0 := 2 + main_~x~0; [L29] COND FALSE !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296) [L30] main_~x~0 := main_~x~0 - 4; [L31] COND FALSE !(0 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296) [L32] main_~x~0 := main_~x~0 - 4; VAL [main_#t~post1=11, main_~x~0=-4, main_~y~0=1] [L12-L33] COND TRUE !(main_~x~0 % 4294967296 < 99) [L34] __VERIFIER_assert_#in~cond := (if (if main_~x~0 % 4294967296 < 0 && 0 != main_~x~0 % 4294967296 % 2 then main_~x~0 % 4294967296 % 2 - 2 else main_~x~0 % 4294967296 % 2) % 4294967296 == (if main_~y~0 % 4294967296 < 0 && 0 != main_~y~0 % 4294967296 % 2 then main_~y~0 % 4294967296 % 2 - 2 else main_~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0); [L34] havoc __VERIFIER_assert_~cond; [L3-L8] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_#t~post1=11, main_~x~0=-4, main_~y~0=1] [L4] COND TRUE 0 == __VERIFIER_assert_~cond VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_#t~post1=11, main_~x~0=-4, main_~y~0=1] [L5] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_#t~post1=11, main_~x~0=-4, main_~y~0=1] [L10] ~x~0 := 0; [L11] ~y~0 := #t~nondet0; [L11] havoc #t~nondet0; [L12-L33] COND FALSE !(!(~x~0 % 4294967296 < 99)) [L13] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L14] ~x~0 := 2 + ~x~0; [L15] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L16] ~x~0 := ~x~0 - 2; [L17] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L18] ~x~0 := 2 + ~x~0; [L19] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L20] ~x~0 := ~x~0 - 2; [L21] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L22] ~x~0 := 2 + ~x~0; [L23] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L24] ~x~0 := ~x~0 - 4; [L25] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L26] ~x~0 := 4 + ~x~0; [L27] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L28] ~x~0 := 2 + ~x~0; [L29] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L30] ~x~0 := ~x~0 - 4; [L31] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L32] ~x~0 := ~x~0 - 4; [L12-L33] COND TRUE !(~x~0 % 4294967296 < 99) [L3-L8] ~cond := #in~cond; [L4] COND TRUE 0 == ~cond [L5] assert false; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L10] ~x~0 := 0; [L11] ~y~0 := #t~nondet0; [L11] havoc #t~nondet0; [L12-L33] COND FALSE !(!(~x~0 % 4294967296 < 99)) [L13] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L14] ~x~0 := 2 + ~x~0; [L15] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L16] ~x~0 := ~x~0 - 2; [L17] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L18] ~x~0 := 2 + ~x~0; [L19] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L20] ~x~0 := ~x~0 - 2; [L21] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L22] ~x~0 := 2 + ~x~0; [L23] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L24] ~x~0 := ~x~0 - 4; [L25] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L26] ~x~0 := 4 + ~x~0; [L27] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L28] ~x~0 := 2 + ~x~0; [L29] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L30] ~x~0 := ~x~0 - 4; [L31] COND FALSE !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296) [L32] ~x~0 := ~x~0 - 4; [L12-L33] COND TRUE !(~x~0 % 4294967296 < 99) [L3-L8] ~cond := #in~cond; [L4] COND TRUE 0 == ~cond [L5] assert false; [L10] unsigned int x = 0; [L11] unsigned int y = __VERIFIER_nondet_uint(); [L12] COND TRUE x < 99 [L13] COND FALSE !(y % 2 == 0) [L14] x += 2 [L15] COND FALSE !(y % 2 == 0) [L16] x -= 2 [L17] COND FALSE !(y % 2 == 0) [L18] x += 2 [L19] COND FALSE !(y % 2 == 0) [L20] x -= 2 [L21] COND FALSE !(y % 2 == 0) [L22] x += 2 [L23] COND FALSE !(y % 2 == 0) [L24] x -= 4 [L25] COND FALSE !(y % 2 == 0) [L26] x += 4 [L27] COND FALSE !(y % 2 == 0) [L28] x += 2 [L29] COND FALSE !(y % 2 == 0) [L30] x -= 4 [L31] COND FALSE !(y % 2 == 0) [L32] x -= 4 [L12] COND FALSE !(x < 99) [L4] COND TRUE !(cond) [L5] __VERIFIER_error() ----- [2018-11-23 13:47:29,751 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_3c4d5b22-1680-4691-a4c2-b71c5f008d46/bin-2019/ukojak/witness.graphml [2018-11-23 13:47:29,751 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:47:29,752 INFO L168 Benchmark]: Toolchain (without parser) took 1046.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 959.1 MB in the beginning and 1.0 GB in the end (delta: -87.1 MB). Peak memory consumption was 38.7 MB. Max. memory is 11.5 GB. [2018-11-23 13:47:29,753 INFO L168 Benchmark]: CDTParser took 0.12 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 13:47:29,753 INFO L168 Benchmark]: CACSL2BoogieTranslator took 180.50 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 13:47:29,754 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.58 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 13:47:29,754 INFO L168 Benchmark]: Boogie Preprocessor took 17.78 ms. Allocated memory is still 1.0 GB. Free memory was 945.7 MB in the beginning and 943.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 13:47:29,755 INFO L168 Benchmark]: RCFGBuilder took 448.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 943.0 MB in the beginning and 1.1 GB in the end (delta: -139.8 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. [2018-11-23 13:47:29,755 INFO L168 Benchmark]: CodeCheck took 318.94 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: 29.9 MB). Peak memory consumption was 29.9 MB. Max. memory is 11.5 GB. [2018-11-23 13:47:29,756 INFO L168 Benchmark]: Witness Printer took 49.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2018-11-23 13:47:29,758 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 1 procedures, 19 locations, 1 error locations. UNSAFE Result, 0.2s OverallTime, 2 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 5 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 9 NumberOfCodeBlocks, 9 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 3 ConstructedInterpolants, 0 QuantifiedInterpolants, 27 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 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: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L10] unsigned int x = 0; [L11] unsigned int y = __VERIFIER_nondet_uint(); [L12] COND TRUE x < 99 [L13] COND FALSE !(y % 2 == 0) [L14] x += 2 [L15] COND FALSE !(y % 2 == 0) [L16] x -= 2 [L17] COND FALSE !(y % 2 == 0) [L18] x += 2 [L19] COND FALSE !(y % 2 == 0) [L20] x -= 2 [L21] COND FALSE !(y % 2 == 0) [L22] x += 2 [L23] COND FALSE !(y % 2 == 0) [L24] x -= 4 [L25] COND FALSE !(y % 2 == 0) [L26] x += 4 [L27] COND FALSE !(y % 2 == 0) [L28] x += 2 [L29] COND FALSE !(y % 2 == 0) [L30] x -= 4 [L31] COND FALSE !(y % 2 == 0) [L32] x -= 4 [L12] COND FALSE !(x < 99) [L4] COND TRUE !(cond) [L5] __VERIFIER_error() * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 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 180.50 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.58 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.78 ms. Allocated memory is still 1.0 GB. Free memory was 945.7 MB in the beginning and 943.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 448.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 943.0 MB in the beginning and 1.1 GB in the end (delta: -139.8 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. * CodeCheck took 318.94 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: 29.9 MB). Peak memory consumption was 29.9 MB. Max. memory is 11.5 GB. * Witness Printer took 49.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...