./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loops/for_bounded_loop1_false-unreach-call_true-termination.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_d14efc56-d8ab-48cb-8e6f-598e52349fee/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d14efc56-d8ab-48cb-8e6f-598e52349fee/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d14efc56-d8ab-48cb-8e6f-598e52349fee/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d14efc56-d8ab-48cb-8e6f-598e52349fee/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/loops/for_bounded_loop1_false-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_d14efc56-d8ab-48cb-8e6f-598e52349fee/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d14efc56-d8ab-48cb-8e6f-598e52349fee/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 0ab550a6e9aa370752671d7ad69781384c889e75 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 07:49:56,841 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 07:49:56,842 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 07:49:56,851 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 07:49:56,851 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 07:49:56,852 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 07:49:56,853 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 07:49:56,854 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 07:49:56,855 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 07:49:56,856 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 07:49:56,857 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 07:49:56,857 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 07:49:56,858 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 07:49:56,859 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 07:49:56,860 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 07:49:56,860 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 07:49:56,861 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 07:49:56,862 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 07:49:56,864 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 07:49:56,865 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 07:49:56,866 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 07:49:56,867 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 07:49:56,869 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 07:49:56,869 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 07:49:56,869 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 07:49:56,870 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 07:49:56,870 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 07:49:56,871 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 07:49:56,872 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 07:49:56,873 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 07:49:56,873 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 07:49:56,873 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 07:49:56,873 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 07:49:56,874 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 07:49:56,874 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 07:49:56,875 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 07:49:56,875 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d14efc56-d8ab-48cb-8e6f-598e52349fee/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-23 07:49:56,886 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 07:49:56,886 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 07:49:56,887 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 07:49:56,887 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-23 07:49:56,887 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 07:49:56,887 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 07:49:56,888 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 07:49:56,888 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 07:49:56,888 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 07:49:56,888 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 07:49:56,888 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 07:49:56,888 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 07:49:56,889 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 07:49:56,889 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 07:49:56,889 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 07:49:56,889 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 07:49:56,889 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 07:49:56,889 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 07:49:56,889 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 07:49:56,890 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 07:49:56,890 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 07:49:56,890 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 07:49:56,890 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 07:49:56,890 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 07:49:56,890 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 07:49:56,891 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 07:49:56,891 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-23 07:49:56,891 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 07:49:56,891 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 07:49:56,891 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_d14efc56-d8ab-48cb-8e6f-598e52349fee/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 -> 0ab550a6e9aa370752671d7ad69781384c889e75 [2018-11-23 07:49:56,915 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 07:49:56,925 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 07:49:56,927 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 07:49:56,928 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 07:49:56,928 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 07:49:56,928 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d14efc56-d8ab-48cb-8e6f-598e52349fee/bin-2019/ukojak/../../sv-benchmarks/c/loops/for_bounded_loop1_false-unreach-call_true-termination.i [2018-11-23 07:49:56,970 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d14efc56-d8ab-48cb-8e6f-598e52349fee/bin-2019/ukojak/data/df6dd1c4a/d892e71a60154d52ac777461345d3ea5/FLAG2e60759ae [2018-11-23 07:49:57,324 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 07:49:57,325 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d14efc56-d8ab-48cb-8e6f-598e52349fee/sv-benchmarks/c/loops/for_bounded_loop1_false-unreach-call_true-termination.i [2018-11-23 07:49:57,330 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d14efc56-d8ab-48cb-8e6f-598e52349fee/bin-2019/ukojak/data/df6dd1c4a/d892e71a60154d52ac777461345d3ea5/FLAG2e60759ae [2018-11-23 07:49:57,753 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d14efc56-d8ab-48cb-8e6f-598e52349fee/bin-2019/ukojak/data/df6dd1c4a/d892e71a60154d52ac777461345d3ea5 [2018-11-23 07:49:57,756 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 07:49:57,758 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 07:49:57,759 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 07:49:57,759 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 07:49:57,761 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 07:49:57,762 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:49:57" (1/1) ... [2018-11-23 07:49:57,763 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45abf0fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:49:57, skipping insertion in model container [2018-11-23 07:49:57,764 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:49:57" (1/1) ... [2018-11-23 07:49:57,772 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 07:49:57,785 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 07:49:57,897 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 07:49:57,899 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 07:49:57,909 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 07:49:57,917 INFO L195 MainTranslator]: Completed translation [2018-11-23 07:49:57,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:49:57 WrapperNode [2018-11-23 07:49:57,918 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 07:49:57,918 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 07:49:57,919 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 07:49:57,919 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 07:49:57,924 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:49:57" (1/1) ... [2018-11-23 07:49:57,927 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:49:57" (1/1) ... [2018-11-23 07:49:57,938 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 07:49:57,939 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 07:49:57,939 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 07:49:57,939 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 07:49:57,945 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:49:57" (1/1) ... [2018-11-23 07:49:57,945 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:49:57" (1/1) ... [2018-11-23 07:49:57,945 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:49:57" (1/1) ... [2018-11-23 07:49:57,945 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:49:57" (1/1) ... [2018-11-23 07:49:57,947 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:49:57" (1/1) ... [2018-11-23 07:49:57,949 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:49:57" (1/1) ... [2018-11-23 07:49:57,950 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:49:57" (1/1) ... [2018-11-23 07:49:57,951 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 07:49:57,951 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 07:49:57,951 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 07:49:57,951 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 07:49:57,952 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:49:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d14efc56-d8ab-48cb-8e6f-598e52349fee/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 07:49:58,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 07:49:58,025 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 07:49:58,025 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 07:49:58,025 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 07:49:58,138 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 07:49:58,138 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-23 07:49:58,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:49:58 BoogieIcfgContainer [2018-11-23 07:49:58,139 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 07:49:58,139 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 07:49:58,139 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 07:49:58,148 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 07:49:58,149 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:49:58" (1/1) ... [2018-11-23 07:49:58,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:49:58,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:49:58,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 17 states and 22 transitions. [2018-11-23 07:49:58,192 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2018-11-23 07:49:58,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-23 07:49:58,194 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:49:58,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:49:58,287 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 07:49:58,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:49:58,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 18 states and 22 transitions. [2018-11-23 07:49:58,306 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2018-11-23 07:49:58,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-23 07:49:58,306 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:49:58,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:49:58,403 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 07:49:58,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:49:58,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 22 states and 30 transitions. [2018-11-23 07:49:58,592 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2018-11-23 07:49:58,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 07:49:58,596 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:49:58,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:49:58,755 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:49:59,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 07:49:59,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 22 states and 27 transitions. [2018-11-23 07:49:59,010 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2018-11-23 07:49:59,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 07:49:59,011 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 07:49:59,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:49:59,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:49:59,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:49:59,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:49:59,087 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 4 iterations. ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~nondet1, main_#t~nondet3, main_#t~post2, main_~i~0, main_~x~0, main_~y~0, main_~n~0;main_~i~0 := 0;main_~x~0 := 0;main_~y~0 := 0;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1; VAL [ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~n~0=1, ULTIMATE.start_main_~x~0=0, ULTIMATE.start_main_~y~0=0] [?] assume !!(main_~n~0 > 0);main_~i~0 := 0; VAL [ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~n~0=1, ULTIMATE.start_main_~x~0=0, ULTIMATE.start_main_~y~0=0] [?] assume !!(main_~i~0 < main_~n~0);main_~x~0 := main_~x~0 - main_~y~0; VAL [ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~n~0=1, ULTIMATE.start_main_~x~0=0, ULTIMATE.start_main_~y~0=0] [?] CALL call __VERIFIER_assert((if 0 == main_~x~0 then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=1] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] assume !(0 == ~cond); VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] assume true; VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] RET #44#return; VAL [ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~n~0=1, ULTIMATE.start_main_~x~0=0, ULTIMATE.start_main_~y~0=0] [?] assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647;main_~y~0 := main_#t~nondet3;havoc main_#t~nondet3; VAL [ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~n~0=1, ULTIMATE.start_main_~x~0=0, ULTIMATE.start_main_~y~0=(- 1)] [?] assume !!(0 != main_~y~0);main_~x~0 := main_~x~0 + main_~y~0; VAL [ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~n~0=1, ULTIMATE.start_main_~x~0=(- 1), ULTIMATE.start_main_~y~0=(- 1)] [?] CALL call __VERIFIER_assert((if 0 != main_~x~0 then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=1] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] assume !(0 == ~cond); VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] assume true; VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] RET #46#return; VAL [ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~n~0=1, ULTIMATE.start_main_~x~0=(- 1), ULTIMATE.start_main_~y~0=(- 1)] [?] main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; VAL [ULTIMATE.start_main_~i~0=1, ULTIMATE.start_main_~n~0=1, ULTIMATE.start_main_~x~0=(- 1), ULTIMATE.start_main_~y~0=(- 1)] [?] BeginParallelComposition{ParallelCodeBlock0: assume !true;ParallelCodeBlock1: assume !(main_~i~0 < main_~n~0);}EndParallelComposition VAL [ULTIMATE.start_main_~i~0=1, ULTIMATE.start_main_~n~0=1, ULTIMATE.start_main_~x~0=(- 1), ULTIMATE.start_main_~y~0=(- 1)] [?] CALL call __VERIFIER_assert((if 0 == main_~x~0 then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=0] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] havoc main_#res; [?] havoc main_#t~nondet1, main_#t~nondet3, main_#t~post2, main_~i~0, main_~x~0, main_~y~0, main_~n~0; [L14] main_~i~0 := 0; [L14] main_~x~0 := 0; [L14] main_~y~0 := 0; [L15] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; [L15] main_~n~0 := main_#t~nondet1; [L15] havoc main_#t~nondet1; VAL [main_~i~0=0, main_~n~0=1, main_~x~0=0, main_~y~0=0] [L16] assume !!(main_~n~0 > 0); [L17] main_~i~0 := 0; VAL [main_~i~0=0, main_~n~0=1, main_~x~0=0, main_~y~0=0] [L17-L25] assume !!(main_~i~0 < main_~n~0); [L19] main_~x~0 := main_~x~0 - main_~y~0; VAL [main_~i~0=0, main_~n~0=1, main_~x~0=0, main_~y~0=0] [L20] CALL call __VERIFIER_assert((if 0 == main_~x~0 then 1 else 0)); VAL [#in~cond=1] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L5-L7] assume !(0 == ~cond); VAL [#in~cond=1, ~cond=1] [L4-L9] ensures true; VAL [#in~cond=1, ~cond=1] [L20] RET call __VERIFIER_assert((if 0 == main_~x~0 then 1 else 0)); VAL [main_~i~0=0, main_~n~0=1, main_~x~0=0, main_~y~0=0] [L21] assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647; [L21] main_~y~0 := main_#t~nondet3; [L21] havoc main_#t~nondet3; VAL [main_~i~0=0, main_~n~0=1, main_~x~0=0, main_~y~0=-1] [L22] assume !!(0 != main_~y~0); [L23] main_~x~0 := main_~x~0 + main_~y~0; VAL [main_~i~0=0, main_~n~0=1, main_~x~0=-1, main_~y~0=-1] [L24] CALL call __VERIFIER_assert((if 0 != main_~x~0 then 1 else 0)); VAL [#in~cond=1] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L5-L7] assume !(0 == ~cond); VAL [#in~cond=1, ~cond=1] [L4-L9] ensures true; VAL [#in~cond=1, ~cond=1] [L24] RET call __VERIFIER_assert((if 0 != main_~x~0 then 1 else 0)); VAL [main_~i~0=0, main_~n~0=1, main_~x~0=-1, main_~y~0=-1] [L17] main_#t~post2 := main_~i~0; [L17] main_~i~0 := 1 + main_#t~post2; [L17] havoc main_#t~post2; VAL [main_~i~0=1, main_~n~0=1, main_~x~0=-1, main_~y~0=-1] [L17-L25] assume !(main_~i~0 < main_~n~0); VAL [main_~i~0=1, main_~n~0=1, main_~x~0=-1, main_~y~0=-1] [L26] CALL call __VERIFIER_assert((if 0 == main_~x~0 then 1 else 0)); VAL [#in~cond=0] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L5-L7] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L6] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet1, main_#t~nondet3, main_#t~post2, main_~i~0, main_~x~0, main_~y~0, main_~n~0; [L14] main_~i~0 := 0; [L14] main_~x~0 := 0; [L14] main_~y~0 := 0; [L15] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; [L15] main_~n~0 := main_#t~nondet1; [L15] havoc main_#t~nondet1; VAL [main_~i~0=0, main_~n~0=1, main_~x~0=0, main_~y~0=0] [L16] assume !!(main_~n~0 > 0); [L17] main_~i~0 := 0; VAL [main_~i~0=0, main_~n~0=1, main_~x~0=0, main_~y~0=0] [L17-L25] assume !!(main_~i~0 < main_~n~0); [L19] main_~x~0 := main_~x~0 - main_~y~0; VAL [main_~i~0=0, main_~n~0=1, main_~x~0=0, main_~y~0=0] [L20] CALL call __VERIFIER_assert((if 0 == main_~x~0 then 1 else 0)); VAL [#in~cond=1] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L5-L7] assume !(0 == ~cond); VAL [#in~cond=1, ~cond=1] [L4-L9] ensures true; VAL [#in~cond=1, ~cond=1] [L20] RET call __VERIFIER_assert((if 0 == main_~x~0 then 1 else 0)); VAL [main_~i~0=0, main_~n~0=1, main_~x~0=0, main_~y~0=0] [L21] assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647; [L21] main_~y~0 := main_#t~nondet3; [L21] havoc main_#t~nondet3; VAL [main_~i~0=0, main_~n~0=1, main_~x~0=0, main_~y~0=-1] [L22] assume !!(0 != main_~y~0); [L23] main_~x~0 := main_~x~0 + main_~y~0; VAL [main_~i~0=0, main_~n~0=1, main_~x~0=-1, main_~y~0=-1] [L24] CALL call __VERIFIER_assert((if 0 != main_~x~0 then 1 else 0)); VAL [#in~cond=1] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L5-L7] assume !(0 == ~cond); VAL [#in~cond=1, ~cond=1] [L4-L9] ensures true; VAL [#in~cond=1, ~cond=1] [L24] RET call __VERIFIER_assert((if 0 != main_~x~0 then 1 else 0)); VAL [main_~i~0=0, main_~n~0=1, main_~x~0=-1, main_~y~0=-1] [L17] main_#t~post2 := main_~i~0; [L17] main_~i~0 := 1 + main_#t~post2; [L17] havoc main_#t~post2; VAL [main_~i~0=1, main_~n~0=1, main_~x~0=-1, main_~y~0=-1] [L17-L25] assume !(main_~i~0 < main_~n~0); VAL [main_~i~0=1, main_~n~0=1, main_~x~0=-1, main_~y~0=-1] [L26] CALL call __VERIFIER_assert((if 0 == main_~x~0 then 1 else 0)); VAL [#in~cond=0] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L5-L7] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L6] assert false; VAL [#in~cond=0, ~cond=0] [?] havoc main_#res; [?] havoc main_#t~nondet1, main_#t~nondet3, main_#t~post2, main_~i~0, main_~x~0, main_~y~0, main_~n~0; [L14] main_~i~0 := 0; [L14] main_~x~0 := 0; [L14] main_~y~0 := 0; [L15] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; [L15] main_~n~0 := main_#t~nondet1; [L15] havoc main_#t~nondet1; VAL [main_~i~0=0, main_~n~0=1, main_~x~0=0, main_~y~0=0] [L16] COND FALSE !(!(main_~n~0 > 0)) [L17] main_~i~0 := 0; VAL [main_~i~0=0, main_~n~0=1, main_~x~0=0, main_~y~0=0] [L17-L25] COND FALSE !(!(main_~i~0 < main_~n~0)) [L19] main_~x~0 := main_~x~0 - main_~y~0; VAL [main_~i~0=0, main_~n~0=1, main_~x~0=0, main_~y~0=0] [L20] CALL call __VERIFIER_assert((if 0 == main_~x~0 then 1 else 0)); VAL [#in~cond=1] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L5] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L20] RET call __VERIFIER_assert((if 0 == main_~x~0 then 1 else 0)); VAL [main_~i~0=0, main_~n~0=1, main_~x~0=0, main_~y~0=0] [L21] assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647; [L21] main_~y~0 := main_#t~nondet3; [L21] havoc main_#t~nondet3; VAL [main_~i~0=0, main_~n~0=1, main_~x~0=0, main_~y~0=-1] [L22] COND FALSE !(!(0 != main_~y~0)) [L23] main_~x~0 := main_~x~0 + main_~y~0; VAL [main_~i~0=0, main_~n~0=1, main_~x~0=-1, main_~y~0=-1] [L24] CALL call __VERIFIER_assert((if 0 != main_~x~0 then 1 else 0)); VAL [#in~cond=1] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L5] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L24] RET call __VERIFIER_assert((if 0 != main_~x~0 then 1 else 0)); VAL [main_~i~0=0, main_~n~0=1, main_~x~0=-1, main_~y~0=-1] [L17] main_#t~post2 := main_~i~0; [L17] main_~i~0 := 1 + main_#t~post2; [L17] havoc main_#t~post2; VAL [main_~i~0=1, main_~n~0=1, main_~x~0=-1, main_~y~0=-1] [L17-L25] COND TRUE !(main_~i~0 < main_~n~0) VAL [main_~i~0=1, main_~n~0=1, main_~x~0=-1, main_~y~0=-1] [L26] CALL call __VERIFIER_assert((if 0 == main_~x~0 then 1 else 0)); VAL [#in~cond=0] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L5] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L6] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet1, main_#t~nondet3, main_#t~post2, main_~i~0, main_~x~0, main_~y~0, main_~n~0; [L14] main_~i~0 := 0; [L14] main_~x~0 := 0; [L14] main_~y~0 := 0; [L15] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; [L15] main_~n~0 := main_#t~nondet1; [L15] havoc main_#t~nondet1; VAL [main_~i~0=0, main_~n~0=1, main_~x~0=0, main_~y~0=0] [L16] COND FALSE !(!(main_~n~0 > 0)) [L17] main_~i~0 := 0; VAL [main_~i~0=0, main_~n~0=1, main_~x~0=0, main_~y~0=0] [L17-L25] COND FALSE !(!(main_~i~0 < main_~n~0)) [L19] main_~x~0 := main_~x~0 - main_~y~0; VAL [main_~i~0=0, main_~n~0=1, main_~x~0=0, main_~y~0=0] [L20] CALL call __VERIFIER_assert((if 0 == main_~x~0 then 1 else 0)); VAL [#in~cond=1] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L5] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L20] RET call __VERIFIER_assert((if 0 == main_~x~0 then 1 else 0)); VAL [main_~i~0=0, main_~n~0=1, main_~x~0=0, main_~y~0=0] [L21] assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647; [L21] main_~y~0 := main_#t~nondet3; [L21] havoc main_#t~nondet3; VAL [main_~i~0=0, main_~n~0=1, main_~x~0=0, main_~y~0=-1] [L22] COND FALSE !(!(0 != main_~y~0)) [L23] main_~x~0 := main_~x~0 + main_~y~0; VAL [main_~i~0=0, main_~n~0=1, main_~x~0=-1, main_~y~0=-1] [L24] CALL call __VERIFIER_assert((if 0 != main_~x~0 then 1 else 0)); VAL [#in~cond=1] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L5] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L24] RET call __VERIFIER_assert((if 0 != main_~x~0 then 1 else 0)); VAL [main_~i~0=0, main_~n~0=1, main_~x~0=-1, main_~y~0=-1] [L17] main_#t~post2 := main_~i~0; [L17] main_~i~0 := 1 + main_#t~post2; [L17] havoc main_#t~post2; VAL [main_~i~0=1, main_~n~0=1, main_~x~0=-1, main_~y~0=-1] [L17-L25] COND TRUE !(main_~i~0 < main_~n~0) VAL [main_~i~0=1, main_~n~0=1, main_~x~0=-1, main_~y~0=-1] [L26] CALL call __VERIFIER_assert((if 0 == main_~x~0 then 1 else 0)); VAL [#in~cond=0] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L5] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L6] assert false; VAL [#in~cond=0, ~cond=0] [L14] ~i~0 := 0; [L14] ~x~0 := 0; [L14] ~y~0 := 0; [L15] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L15] ~n~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] COND FALSE !(!(~n~0 > 0)) [L17] ~i~0 := 0; [L17-L25] COND FALSE !(!(~i~0 < ~n~0)) [L19] ~x~0 := ~x~0 - ~y~0; [L20] CALL call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [#in~cond=1] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L5] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L20] RET call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); [L21] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L21] ~y~0 := #t~nondet3; [L21] havoc #t~nondet3; [L22] COND FALSE !(!(0 != ~y~0)) [L23] ~x~0 := ~x~0 + ~y~0; [L24] CALL call __VERIFIER_assert((if 0 != ~x~0 then 1 else 0)); VAL [#in~cond=1] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L5] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L24] RET call __VERIFIER_assert((if 0 != ~x~0 then 1 else 0)); [L17] #t~post2 := ~i~0; [L17] ~i~0 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L25] COND TRUE !(~i~0 < ~n~0) [L26] CALL call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [#in~cond=0] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L5] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L6] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L14] ~i~0 := 0; [L14] ~x~0 := 0; [L14] ~y~0 := 0; [L15] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L15] ~n~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] COND FALSE !(!(~n~0 > 0)) [L17] ~i~0 := 0; [L17-L25] COND FALSE !(!(~i~0 < ~n~0)) [L19] ~x~0 := ~x~0 - ~y~0; [L20] CALL call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [#in~cond=1] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L5] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L20] RET call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); [L21] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L21] ~y~0 := #t~nondet3; [L21] havoc #t~nondet3; [L22] COND FALSE !(!(0 != ~y~0)) [L23] ~x~0 := ~x~0 + ~y~0; [L24] CALL call __VERIFIER_assert((if 0 != ~x~0 then 1 else 0)); VAL [#in~cond=1] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L5] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L24] RET call __VERIFIER_assert((if 0 != ~x~0 then 1 else 0)); [L17] #t~post2 := ~i~0; [L17] ~i~0 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L25] COND TRUE !(~i~0 < ~n~0) [L26] CALL call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [#in~cond=0] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L5] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L6] assert false; VAL [#in~cond=0, ~cond=0] [L14] int i=0, x=0, y=0; [L15] int n=__VERIFIER_nondet_int(); [L16] COND FALSE !(!(n>0)) [L17] i=0 [L17] COND TRUE i 0);main_~i~0 := 0; VAL [ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~n~0=1, ULTIMATE.start_main_~x~0=0, ULTIMATE.start_main_~y~0=0] [?] assume !!(main_~i~0 < main_~n~0);main_~x~0 := main_~x~0 - main_~y~0; VAL [ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~n~0=1, ULTIMATE.start_main_~x~0=0, ULTIMATE.start_main_~y~0=0] [?] CALL call __VERIFIER_assert((if 0 == main_~x~0 then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=1] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] assume !(0 == ~cond); VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] assume true; VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] RET #44#return; VAL [ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~n~0=1, ULTIMATE.start_main_~x~0=0, ULTIMATE.start_main_~y~0=0] [?] assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647;main_~y~0 := main_#t~nondet3;havoc main_#t~nondet3; VAL [ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~n~0=1, ULTIMATE.start_main_~x~0=0, ULTIMATE.start_main_~y~0=(- 1)] [?] assume !!(0 != main_~y~0);main_~x~0 := main_~x~0 + main_~y~0; VAL [ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~n~0=1, ULTIMATE.start_main_~x~0=(- 1), ULTIMATE.start_main_~y~0=(- 1)] [?] CALL call __VERIFIER_assert((if 0 != main_~x~0 then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=1] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] assume !(0 == ~cond); VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] assume true; VAL [__VERIFIER_assert_~cond=1, |__VERIFIER_assert_#in~cond|=1] [?] RET #46#return; VAL [ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~n~0=1, ULTIMATE.start_main_~x~0=(- 1), ULTIMATE.start_main_~y~0=(- 1)] [?] main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; VAL [ULTIMATE.start_main_~i~0=1, ULTIMATE.start_main_~n~0=1, ULTIMATE.start_main_~x~0=(- 1), ULTIMATE.start_main_~y~0=(- 1)] [?] BeginParallelComposition{ParallelCodeBlock0: assume !true;ParallelCodeBlock1: assume !(main_~i~0 < main_~n~0);}EndParallelComposition VAL [ULTIMATE.start_main_~i~0=1, ULTIMATE.start_main_~n~0=1, ULTIMATE.start_main_~x~0=(- 1), ULTIMATE.start_main_~y~0=(- 1)] [?] CALL call __VERIFIER_assert((if 0 == main_~x~0 then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=0] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] havoc main_#res; [?] havoc main_#t~nondet1, main_#t~nondet3, main_#t~post2, main_~i~0, main_~x~0, main_~y~0, main_~n~0; [L14] main_~i~0 := 0; [L14] main_~x~0 := 0; [L14] main_~y~0 := 0; [L15] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; [L15] main_~n~0 := main_#t~nondet1; [L15] havoc main_#t~nondet1; VAL [main_~i~0=0, main_~n~0=1, main_~x~0=0, main_~y~0=0] [L16] assume !!(main_~n~0 > 0); [L17] main_~i~0 := 0; VAL [main_~i~0=0, main_~n~0=1, main_~x~0=0, main_~y~0=0] [L17-L25] assume !!(main_~i~0 < main_~n~0); [L19] main_~x~0 := main_~x~0 - main_~y~0; VAL [main_~i~0=0, main_~n~0=1, main_~x~0=0, main_~y~0=0] [L20] CALL call __VERIFIER_assert((if 0 == main_~x~0 then 1 else 0)); VAL [#in~cond=1] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L5-L7] assume !(0 == ~cond); VAL [#in~cond=1, ~cond=1] [L4-L9] ensures true; VAL [#in~cond=1, ~cond=1] [L20] RET call __VERIFIER_assert((if 0 == main_~x~0 then 1 else 0)); VAL [main_~i~0=0, main_~n~0=1, main_~x~0=0, main_~y~0=0] [L21] assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647; [L21] main_~y~0 := main_#t~nondet3; [L21] havoc main_#t~nondet3; VAL [main_~i~0=0, main_~n~0=1, main_~x~0=0, main_~y~0=-1] [L22] assume !!(0 != main_~y~0); [L23] main_~x~0 := main_~x~0 + main_~y~0; VAL [main_~i~0=0, main_~n~0=1, main_~x~0=-1, main_~y~0=-1] [L24] CALL call __VERIFIER_assert((if 0 != main_~x~0 then 1 else 0)); VAL [#in~cond=1] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L5-L7] assume !(0 == ~cond); VAL [#in~cond=1, ~cond=1] [L4-L9] ensures true; VAL [#in~cond=1, ~cond=1] [L24] RET call __VERIFIER_assert((if 0 != main_~x~0 then 1 else 0)); VAL [main_~i~0=0, main_~n~0=1, main_~x~0=-1, main_~y~0=-1] [L17] main_#t~post2 := main_~i~0; [L17] main_~i~0 := 1 + main_#t~post2; [L17] havoc main_#t~post2; VAL [main_~i~0=1, main_~n~0=1, main_~x~0=-1, main_~y~0=-1] [L17-L25] assume !(main_~i~0 < main_~n~0); VAL [main_~i~0=1, main_~n~0=1, main_~x~0=-1, main_~y~0=-1] [L26] CALL call __VERIFIER_assert((if 0 == main_~x~0 then 1 else 0)); VAL [#in~cond=0] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L5-L7] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L6] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet1, main_#t~nondet3, main_#t~post2, main_~i~0, main_~x~0, main_~y~0, main_~n~0; [L14] main_~i~0 := 0; [L14] main_~x~0 := 0; [L14] main_~y~0 := 0; [L15] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; [L15] main_~n~0 := main_#t~nondet1; [L15] havoc main_#t~nondet1; VAL [main_~i~0=0, main_~n~0=1, main_~x~0=0, main_~y~0=0] [L16] assume !!(main_~n~0 > 0); [L17] main_~i~0 := 0; VAL [main_~i~0=0, main_~n~0=1, main_~x~0=0, main_~y~0=0] [L17-L25] assume !!(main_~i~0 < main_~n~0); [L19] main_~x~0 := main_~x~0 - main_~y~0; VAL [main_~i~0=0, main_~n~0=1, main_~x~0=0, main_~y~0=0] [L20] CALL call __VERIFIER_assert((if 0 == main_~x~0 then 1 else 0)); VAL [#in~cond=1] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L5-L7] assume !(0 == ~cond); VAL [#in~cond=1, ~cond=1] [L4-L9] ensures true; VAL [#in~cond=1, ~cond=1] [L20] RET call __VERIFIER_assert((if 0 == main_~x~0 then 1 else 0)); VAL [main_~i~0=0, main_~n~0=1, main_~x~0=0, main_~y~0=0] [L21] assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647; [L21] main_~y~0 := main_#t~nondet3; [L21] havoc main_#t~nondet3; VAL [main_~i~0=0, main_~n~0=1, main_~x~0=0, main_~y~0=-1] [L22] assume !!(0 != main_~y~0); [L23] main_~x~0 := main_~x~0 + main_~y~0; VAL [main_~i~0=0, main_~n~0=1, main_~x~0=-1, main_~y~0=-1] [L24] CALL call __VERIFIER_assert((if 0 != main_~x~0 then 1 else 0)); VAL [#in~cond=1] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L5-L7] assume !(0 == ~cond); VAL [#in~cond=1, ~cond=1] [L4-L9] ensures true; VAL [#in~cond=1, ~cond=1] [L24] RET call __VERIFIER_assert((if 0 != main_~x~0 then 1 else 0)); VAL [main_~i~0=0, main_~n~0=1, main_~x~0=-1, main_~y~0=-1] [L17] main_#t~post2 := main_~i~0; [L17] main_~i~0 := 1 + main_#t~post2; [L17] havoc main_#t~post2; VAL [main_~i~0=1, main_~n~0=1, main_~x~0=-1, main_~y~0=-1] [L17-L25] assume !(main_~i~0 < main_~n~0); VAL [main_~i~0=1, main_~n~0=1, main_~x~0=-1, main_~y~0=-1] [L26] CALL call __VERIFIER_assert((if 0 == main_~x~0 then 1 else 0)); VAL [#in~cond=0] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L5-L7] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L6] assert false; VAL [#in~cond=0, ~cond=0] [?] havoc main_#res; [?] havoc main_#t~nondet1, main_#t~nondet3, main_#t~post2, main_~i~0, main_~x~0, main_~y~0, main_~n~0; [L14] main_~i~0 := 0; [L14] main_~x~0 := 0; [L14] main_~y~0 := 0; [L15] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; [L15] main_~n~0 := main_#t~nondet1; [L15] havoc main_#t~nondet1; VAL [main_~i~0=0, main_~n~0=1, main_~x~0=0, main_~y~0=0] [L16] COND FALSE !(!(main_~n~0 > 0)) [L17] main_~i~0 := 0; VAL [main_~i~0=0, main_~n~0=1, main_~x~0=0, main_~y~0=0] [L17-L25] COND FALSE !(!(main_~i~0 < main_~n~0)) [L19] main_~x~0 := main_~x~0 - main_~y~0; VAL [main_~i~0=0, main_~n~0=1, main_~x~0=0, main_~y~0=0] [L20] CALL call __VERIFIER_assert((if 0 == main_~x~0 then 1 else 0)); VAL [#in~cond=1] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L5] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L20] RET call __VERIFIER_assert((if 0 == main_~x~0 then 1 else 0)); VAL [main_~i~0=0, main_~n~0=1, main_~x~0=0, main_~y~0=0] [L21] assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647; [L21] main_~y~0 := main_#t~nondet3; [L21] havoc main_#t~nondet3; VAL [main_~i~0=0, main_~n~0=1, main_~x~0=0, main_~y~0=-1] [L22] COND FALSE !(!(0 != main_~y~0)) [L23] main_~x~0 := main_~x~0 + main_~y~0; VAL [main_~i~0=0, main_~n~0=1, main_~x~0=-1, main_~y~0=-1] [L24] CALL call __VERIFIER_assert((if 0 != main_~x~0 then 1 else 0)); VAL [#in~cond=1] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L5] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L24] RET call __VERIFIER_assert((if 0 != main_~x~0 then 1 else 0)); VAL [main_~i~0=0, main_~n~0=1, main_~x~0=-1, main_~y~0=-1] [L17] main_#t~post2 := main_~i~0; [L17] main_~i~0 := 1 + main_#t~post2; [L17] havoc main_#t~post2; VAL [main_~i~0=1, main_~n~0=1, main_~x~0=-1, main_~y~0=-1] [L17-L25] COND TRUE !(main_~i~0 < main_~n~0) VAL [main_~i~0=1, main_~n~0=1, main_~x~0=-1, main_~y~0=-1] [L26] CALL call __VERIFIER_assert((if 0 == main_~x~0 then 1 else 0)); VAL [#in~cond=0] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L5] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L6] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet1, main_#t~nondet3, main_#t~post2, main_~i~0, main_~x~0, main_~y~0, main_~n~0; [L14] main_~i~0 := 0; [L14] main_~x~0 := 0; [L14] main_~y~0 := 0; [L15] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; [L15] main_~n~0 := main_#t~nondet1; [L15] havoc main_#t~nondet1; VAL [main_~i~0=0, main_~n~0=1, main_~x~0=0, main_~y~0=0] [L16] COND FALSE !(!(main_~n~0 > 0)) [L17] main_~i~0 := 0; VAL [main_~i~0=0, main_~n~0=1, main_~x~0=0, main_~y~0=0] [L17-L25] COND FALSE !(!(main_~i~0 < main_~n~0)) [L19] main_~x~0 := main_~x~0 - main_~y~0; VAL [main_~i~0=0, main_~n~0=1, main_~x~0=0, main_~y~0=0] [L20] CALL call __VERIFIER_assert((if 0 == main_~x~0 then 1 else 0)); VAL [#in~cond=1] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L5] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L20] RET call __VERIFIER_assert((if 0 == main_~x~0 then 1 else 0)); VAL [main_~i~0=0, main_~n~0=1, main_~x~0=0, main_~y~0=0] [L21] assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647; [L21] main_~y~0 := main_#t~nondet3; [L21] havoc main_#t~nondet3; VAL [main_~i~0=0, main_~n~0=1, main_~x~0=0, main_~y~0=-1] [L22] COND FALSE !(!(0 != main_~y~0)) [L23] main_~x~0 := main_~x~0 + main_~y~0; VAL [main_~i~0=0, main_~n~0=1, main_~x~0=-1, main_~y~0=-1] [L24] CALL call __VERIFIER_assert((if 0 != main_~x~0 then 1 else 0)); VAL [#in~cond=1] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L5] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L24] RET call __VERIFIER_assert((if 0 != main_~x~0 then 1 else 0)); VAL [main_~i~0=0, main_~n~0=1, main_~x~0=-1, main_~y~0=-1] [L17] main_#t~post2 := main_~i~0; [L17] main_~i~0 := 1 + main_#t~post2; [L17] havoc main_#t~post2; VAL [main_~i~0=1, main_~n~0=1, main_~x~0=-1, main_~y~0=-1] [L17-L25] COND TRUE !(main_~i~0 < main_~n~0) VAL [main_~i~0=1, main_~n~0=1, main_~x~0=-1, main_~y~0=-1] [L26] CALL call __VERIFIER_assert((if 0 == main_~x~0 then 1 else 0)); VAL [#in~cond=0] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L5] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L6] assert false; VAL [#in~cond=0, ~cond=0] [L14] ~i~0 := 0; [L14] ~x~0 := 0; [L14] ~y~0 := 0; [L15] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L15] ~n~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] COND FALSE !(!(~n~0 > 0)) [L17] ~i~0 := 0; [L17-L25] COND FALSE !(!(~i~0 < ~n~0)) [L19] ~x~0 := ~x~0 - ~y~0; [L20] CALL call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [#in~cond=1] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L5] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L20] RET call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); [L21] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L21] ~y~0 := #t~nondet3; [L21] havoc #t~nondet3; [L22] COND FALSE !(!(0 != ~y~0)) [L23] ~x~0 := ~x~0 + ~y~0; [L24] CALL call __VERIFIER_assert((if 0 != ~x~0 then 1 else 0)); VAL [#in~cond=1] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L5] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L24] RET call __VERIFIER_assert((if 0 != ~x~0 then 1 else 0)); [L17] #t~post2 := ~i~0; [L17] ~i~0 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L25] COND TRUE !(~i~0 < ~n~0) [L26] CALL call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [#in~cond=0] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L5] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L6] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L14] ~i~0 := 0; [L14] ~x~0 := 0; [L14] ~y~0 := 0; [L15] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L15] ~n~0 := #t~nondet1; [L15] havoc #t~nondet1; [L16] COND FALSE !(!(~n~0 > 0)) [L17] ~i~0 := 0; [L17-L25] COND FALSE !(!(~i~0 < ~n~0)) [L19] ~x~0 := ~x~0 - ~y~0; [L20] CALL call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [#in~cond=1] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L5] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L20] RET call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); [L21] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L21] ~y~0 := #t~nondet3; [L21] havoc #t~nondet3; [L22] COND FALSE !(!(0 != ~y~0)) [L23] ~x~0 := ~x~0 + ~y~0; [L24] CALL call __VERIFIER_assert((if 0 != ~x~0 then 1 else 0)); VAL [#in~cond=1] [L4-L9] ~cond := #in~cond; VAL [#in~cond=1, ~cond=1] [L5] COND FALSE !(0 == ~cond) VAL [#in~cond=1, ~cond=1] [L24] RET call __VERIFIER_assert((if 0 != ~x~0 then 1 else 0)); [L17] #t~post2 := ~i~0; [L17] ~i~0 := 1 + #t~post2; [L17] havoc #t~post2; [L17-L25] COND TRUE !(~i~0 < ~n~0) [L26] CALL call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); VAL [#in~cond=0] [L4-L9] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L5] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L6] assert false; VAL [#in~cond=0, ~cond=0] [L14] int i=0, x=0, y=0; [L15] int n=__VERIFIER_nondet_int(); [L16] COND FALSE !(!(n>0)) [L17] i=0 [L17] COND TRUE i0)) [L17] i=0 [L17] COND TRUE i