./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/filter2_alt_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_26be49fb-beb5-4306-91f5-9229b69f249f/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_26be49fb-beb5-4306-91f5-9229b69f249f/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_26be49fb-beb5-4306-91f5-9229b69f249f/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_26be49fb-beb5-4306-91f5-9229b69f249f/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/float-benchs/filter2_alt_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_26be49fb-beb5-4306-91f5-9229b69f249f/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_26be49fb-beb5-4306-91f5-9229b69f249f/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 465c54123bfeac60a151011e84f1bb917bb3cc8d .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_26be49fb-beb5-4306-91f5-9229b69f249f/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_26be49fb-beb5-4306-91f5-9229b69f249f/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_26be49fb-beb5-4306-91f5-9229b69f249f/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_26be49fb-beb5-4306-91f5-9229b69f249f/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/float-benchs/filter2_alt_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_26be49fb-beb5-4306-91f5-9229b69f249f/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_26be49fb-beb5-4306-91f5-9229b69f249f/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 465c54123bfeac60a151011e84f1bb917bb3cc8d ........................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: IllegalArgumentException: Indexed Sort BitVec undefined --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-22 22:00:48,568 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 22:00:48,569 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 22:00:48,576 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 22:00:48,577 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 22:00:48,578 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 22:00:48,578 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 22:00:48,580 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 22:00:48,581 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 22:00:48,582 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 22:00:48,583 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 22:00:48,583 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 22:00:48,584 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 22:00:48,584 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 22:00:48,585 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 22:00:48,586 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 22:00:48,587 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 22:00:48,588 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 22:00:48,589 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 22:00:48,591 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 22:00:48,592 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 22:00:48,593 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 22:00:48,594 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 22:00:48,595 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 22:00:48,595 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 22:00:48,596 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 22:00:48,596 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 22:00:48,597 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 22:00:48,598 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 22:00:48,599 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 22:00:48,599 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 22:00:48,599 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 22:00:48,600 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 22:00:48,600 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 22:00:48,601 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 22:00:48,601 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 22:00:48,601 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_26be49fb-beb5-4306-91f5-9229b69f249f/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-22 22:00:48,611 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 22:00:48,612 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 22:00:48,612 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-22 22:00:48,612 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-22 22:00:48,613 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-22 22:00:48,613 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-22 22:00:48,613 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 22:00:48,614 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-22 22:00:48,614 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 22:00:48,614 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-22 22:00:48,614 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 22:00:48,614 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-22 22:00:48,614 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-22 22:00:48,615 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-22 22:00:48,615 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-22 22:00:48,615 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 22:00:48,615 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 22:00:48,615 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-22 22:00:48,615 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-22 22:00:48,616 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-22 22:00:48,616 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 22:00:48,616 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-22 22:00:48,616 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-22 22:00:48,616 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 22:00:48,617 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-22 22:00:48,617 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-22 22:00:48,617 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-22 22:00:48,617 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-22 22:00:48,617 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-22 22:00:48,617 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_26be49fb-beb5-4306-91f5-9229b69f249f/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 -> 465c54123bfeac60a151011e84f1bb917bb3cc8d [2018-11-22 22:00:48,644 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 22:00:48,654 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 22:00:48,657 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 22:00:48,659 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 22:00:48,659 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 22:00:48,660 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_26be49fb-beb5-4306-91f5-9229b69f249f/bin-2019/ukojak/../../sv-benchmarks/c/float-benchs/filter2_alt_true-unreach-call.c [2018-11-22 22:00:48,713 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_26be49fb-beb5-4306-91f5-9229b69f249f/bin-2019/ukojak/data/1ac5c59f9/902bf89e9bc540eca4715ccb137ea4d8/FLAGc9f1e98b0 [2018-11-22 22:00:49,074 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 22:00:49,075 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_26be49fb-beb5-4306-91f5-9229b69f249f/sv-benchmarks/c/float-benchs/filter2_alt_true-unreach-call.c [2018-11-22 22:00:49,082 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_26be49fb-beb5-4306-91f5-9229b69f249f/bin-2019/ukojak/data/1ac5c59f9/902bf89e9bc540eca4715ccb137ea4d8/FLAGc9f1e98b0 [2018-11-22 22:00:49,492 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_26be49fb-beb5-4306-91f5-9229b69f249f/bin-2019/ukojak/data/1ac5c59f9/902bf89e9bc540eca4715ccb137ea4d8 [2018-11-22 22:00:49,495 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 22:00:49,496 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 22:00:49,497 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 22:00:49,497 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 22:00:49,499 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 22:00:49,500 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:00:49" (1/1) ... [2018-11-22 22:00:49,502 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 22.11 10:00:49, skipping insertion in model container [2018-11-22 22:00:49,502 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:00:49" (1/1) ... [2018-11-22 22:00:49,509 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 22:00:49,524 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 22:00:49,651 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 22:00:49,656 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 22:00:49,671 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 22:00:49,686 INFO L195 MainTranslator]: Completed translation [2018-11-22 22:00:49,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:00:49 WrapperNode [2018-11-22 22:00:49,687 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 22:00:49,687 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 22:00:49,687 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 22:00:49,687 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 22:00:49,693 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:00:49" (1/1) ... [2018-11-22 22:00:49,700 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:00:49" (1/1) ... [2018-11-22 22:00:49,714 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 22:00:49,714 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 22:00:49,714 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 22:00:49,715 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 22:00:49,763 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:00:49" (1/1) ... [2018-11-22 22:00:49,763 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:00:49" (1/1) ... [2018-11-22 22:00:49,764 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:00:49" (1/1) ... [2018-11-22 22:00:49,765 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:00:49" (1/1) ... [2018-11-22 22:00:49,770 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:00:49" (1/1) ... [2018-11-22 22:00:49,773 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:00:49" (1/1) ... [2018-11-22 22:00:49,774 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:00:49" (1/1) ... [2018-11-22 22:00:49,775 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 22:00:49,775 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 22:00:49,775 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 22:00:49,776 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 22:00:49,776 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:00:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_26be49fb-beb5-4306-91f5-9229b69f249f/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-22 22:00:49,818 INFO L130 BoogieDeclarations]: Found specification of procedure RANDOM_INPUT [2018-11-22 22:00:49,818 INFO L138 BoogieDeclarations]: Found implementation of procedure RANDOM_INPUT [2018-11-22 22:00:49,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-11-22 22:00:49,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-22 22:00:49,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-22 22:00:49,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 22:00:49,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 22:00:49,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2018-11-22 22:00:50,012 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 22:00:50,013 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-11-22 22:00:50,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:00:50 BoogieIcfgContainer [2018-11-22 22:00:50,013 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 22:00:50,014 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-22 22:00:50,014 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-22 22:00:50,021 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-22 22:00:50,021 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:00:50" (1/1) ... [2018-11-22 22:00:50,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:00:50,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-22 22:00:50,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 14 states and 17 transitions. [2018-11-22 22:00:50,056 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2018-11-22 22:00:50,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-22 22:00:50,063 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-22 22:00:50,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:00:50,189 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-22 22:00:50,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-22 22:00:50,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 17 states and 20 transitions. [2018-11-22 22:00:50,243 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2018-11-22 22:00:50,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-22 22:00:50,244 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-22 22:00:50,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:00:50,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:00:50,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:00:50,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:00:50,368 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 2 iterations. ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~P~0 := 0.0;~X~0 := 0.0;~INIT~0 := 0;call ~#E~0.base, ~#E~0.offset := #Ultimate.alloc(8);call write~init~real(0.0, ~#E~0.base, ~#E~0.offset, 4);call write~init~real(0.0, ~#E~0.base, 4 + ~#E~0.offset, 4);call ~#S~0.base, ~#S~0.offset := #Ultimate.alloc(8);call write~init~real(0.0, ~#S~0.base, ~#S~0.offset, 4);call write~init~real(0.0, ~#S~0.base, 4 + ~#S~0.offset, 4);havoc main_#res;havoc main_#t~ret7, main_#t~ret8; VAL [|#NULL.base|=0, |#NULL.offset|=0, |~#E~0.base|=7, |~#E~0.offset|=0, |~#S~0.base|=6, |~#S~0.offset|=0, ~INIT~0=0, ~P~0=0.0, ~X~0=0.0] [?] CALL call main_#t~ret7 := RANDOM_INPUT(); VAL [|#NULL.base|=0, |#NULL.offset|=0, |~#E~0.base|=7, |~#E~0.offset|=0, |~#S~0.base|=6, |~#S~0.offset|=0, ~INIT~0=0, ~P~0=0.0, ~X~0=0.0] [?] havoc ~x~0;~x~0 := #t~nondet0;havoc #t~nondet0;assume 0 != (if ~someBinaryFLOATComparisonOperation(~x~0, ~someUnaryFLOAToperation(10.0)) && ~someBinaryFLOATComparisonOperation(~x~0, 10.0) then 1 else 0);#res := ~x~0;assume true; VAL [RANDOM_INPUT_~x~0=11.0, |#NULL.base|=0, |#NULL.offset|=0, |RANDOM_INPUT_#res|=11.0, |~#E~0.base|=7, |~#E~0.offset|=0, |~#S~0.base|=6, |~#S~0.offset|=0, ~INIT~0=0, ~P~0=0.0, ~X~0=0.0] [?] RET #45#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~ret7|=11.0, |~#E~0.base|=7, |~#E~0.offset|=0, |~#S~0.base|=6, |~#S~0.offset|=0, ~INIT~0=0, ~P~0=0.0, ~X~0=0.0] [?] ~X~0 := main_#t~ret7;havoc main_#t~ret7;~INIT~0 := ~unnamed0~0~TRUE; VAL [|#NULL.base|=0, |#NULL.offset|=0, |~#E~0.base|=7, |~#E~0.offset|=0, |~#S~0.base|=6, |~#S~0.offset|=0, ~INIT~0=1, ~P~0=0.0, ~X~0=11.0] [?] assume !!(0 != ~unnamed0~0~TRUE); VAL [|#NULL.base|=0, |#NULL.offset|=0, |~#E~0.base|=7, |~#E~0.offset|=0, |~#S~0.base|=6, |~#S~0.offset|=0, ~INIT~0=1, ~P~0=0.0, ~X~0=11.0] [?] CALL call main_#t~ret8 := RANDOM_INPUT(); VAL [|#NULL.base|=0, |#NULL.offset|=0, |~#E~0.base|=7, |~#E~0.offset|=0, |~#S~0.base|=6, |~#S~0.offset|=0, ~INIT~0=1, ~P~0=0.0, ~X~0=11.0] [?] havoc ~x~0;~x~0 := #t~nondet0;havoc #t~nondet0;assume 0 != (if ~someBinaryFLOATComparisonOperation(~x~0, ~someUnaryFLOAToperation(10.0)) && ~someBinaryFLOATComparisonOperation(~x~0, 10.0) then 1 else 0);#res := ~x~0;assume true; VAL [RANDOM_INPUT_~x~0=1.0, |#NULL.base|=0, |#NULL.offset|=0, |RANDOM_INPUT_#res|=1.0, |~#E~0.base|=7, |~#E~0.offset|=0, |~#S~0.base|=6, |~#S~0.offset|=0, ~INIT~0=1, ~P~0=0.0, ~X~0=11.0] [?] RET #47#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~ret8|=1.0, |~#E~0.base|=7, |~#E~0.offset|=0, |~#S~0.base|=6, |~#S~0.offset|=0, ~INIT~0=1, ~P~0=0.0, ~X~0=11.0] [?] ~X~0 := main_#t~ret8;havoc main_#t~ret8;havoc filter2_#t~mem1, filter2_#t~mem2, filter2_#t~mem3, filter2_#t~mem4, filter2_#t~mem5, filter2_#t~mem6; VAL [|#NULL.base|=0, |#NULL.offset|=0, |~#E~0.base|=7, |~#E~0.offset|=0, |~#S~0.base|=6, |~#S~0.offset|=0, ~INIT~0=1, ~P~0=0.0, ~X~0=1.0] [?] assume 0 != ~INIT~0;call write~real(~X~0, ~#S~0.base, ~#S~0.offset, 4);~P~0 := ~X~0;call write~real(~X~0, ~#E~0.base, ~#E~0.offset, 4); VAL [|#NULL.base|=0, |#NULL.offset|=0, |~#E~0.base|=7, |~#E~0.offset|=0, |~#S~0.base|=6, |~#S~0.offset|=0, ~INIT~0=1, ~P~0=1.0, ~X~0=1.0] [?] call filter2_#t~mem5 := read~real(~#E~0.base, ~#E~0.offset, 4);call write~real(filter2_#t~mem5, ~#E~0.base, 4 + ~#E~0.offset, 4);havoc filter2_#t~mem5;call write~real(~X~0, ~#E~0.base, ~#E~0.offset, 4);call filter2_#t~mem6 := read~real(~#S~0.base, ~#S~0.offset, 4);call write~real(filter2_#t~mem6, ~#S~0.base, 4 + ~#S~0.offset, 4);havoc filter2_#t~mem6;call write~real(~P~0, ~#S~0.base, ~#S~0.offset, 4);~INIT~0 := ~unnamed0~0~FALSE; VAL [|#NULL.base|=0, |#NULL.offset|=0, |~#E~0.base|=7, |~#E~0.offset|=0, |~#S~0.base|=6, |~#S~0.offset|=0, ~INIT~0=0, ~P~0=1.0, ~X~0=1.0] [?] assume !!(0 != ~unnamed0~0~TRUE); VAL [|#NULL.base|=0, |#NULL.offset|=0, |~#E~0.base|=7, |~#E~0.offset|=0, |~#S~0.base|=6, |~#S~0.offset|=0, ~INIT~0=0, ~P~0=1.0, ~X~0=1.0] [?] CALL call main_#t~ret8 := RANDOM_INPUT(); VAL [|#NULL.base|=0, |#NULL.offset|=0, |~#E~0.base|=7, |~#E~0.offset|=0, |~#S~0.base|=6, |~#S~0.offset|=0, ~INIT~0=0, ~P~0=1.0, ~X~0=1.0] [?] havoc ~x~0;~x~0 := #t~nondet0;havoc #t~nondet0;assume 0 != (if ~someBinaryFLOATComparisonOperation(~x~0, ~someUnaryFLOAToperation(10.0)) && ~someBinaryFLOATComparisonOperation(~x~0, 10.0) then 1 else 0);#res := ~x~0;assume true; VAL [RANDOM_INPUT_~x~0=12.0, |#NULL.base|=0, |#NULL.offset|=0, |RANDOM_INPUT_#res|=12.0, |~#E~0.base|=7, |~#E~0.offset|=0, |~#S~0.base|=6, |~#S~0.offset|=0, ~INIT~0=0, ~P~0=1.0, ~X~0=1.0] [?] RET #47#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~ret8|=12.0, |~#E~0.base|=7, |~#E~0.offset|=0, |~#S~0.base|=6, |~#S~0.offset|=0, ~INIT~0=0, ~P~0=1.0, ~X~0=1.0] [?] ~X~0 := main_#t~ret8;havoc main_#t~ret8;havoc filter2_#t~mem1, filter2_#t~mem2, filter2_#t~mem3, filter2_#t~mem4, filter2_#t~mem5, filter2_#t~mem6; VAL [|#NULL.base|=0, |#NULL.offset|=0, |~#E~0.base|=7, |~#E~0.offset|=0, |~#S~0.base|=6, |~#S~0.offset|=0, ~INIT~0=0, ~P~0=1.0, ~X~0=12.0] [?] assume !(0 != ~INIT~0);call filter2_#t~mem1 := read~real(~#E~0.base, ~#E~0.offset, 4);call filter2_#t~mem2 := read~real(~#E~0.base, 4 + ~#E~0.offset, 4);call filter2_#t~mem3 := read~real(~#S~0.base, ~#S~0.offset, 4);call filter2_#t~mem4 := read~real(~#S~0.base, 4 + ~#S~0.offset, 4);~P~0 := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(0.4677826, ~X~0), ~someBinaryArithmeticFLOAToperation(filter2_#t~mem1, 0.7700725)), ~someBinaryArithmeticFLOAToperation(filter2_#t~mem2, 0.4344376)), ~someBinaryArithmeticFLOAToperation(filter2_#t~mem3, 1.5419)), ~someBinaryArithmeticFLOAToperation(filter2_#t~mem4, 0.6740477));havoc filter2_#t~mem2;havoc filter2_#t~mem4;havoc filter2_#t~mem3;havoc filter2_#t~mem1;__VERIFIER_assert_#in~cond := (if ~someBinaryFLOATComparisonOperation(~P~0, ~someUnaryFLOAToperation(15.0)) && ~someBinaryFLOATComparisonOperation(~P~0, 15.0) then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [ULTIMATE.start___VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start___VERIFIER_assert_#in~cond|=0, |~#E~0.base|=7, |~#E~0.offset|=0, |~#S~0.base|=6, |~#S~0.offset|=0, ~INIT~0=0, ~X~0=12.0] [?] assume 0 == __VERIFIER_assert_~cond; VAL [ULTIMATE.start___VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start___VERIFIER_assert_#in~cond|=0, |~#E~0.base|=7, |~#E~0.offset|=0, |~#S~0.base|=6, |~#S~0.offset|=0, ~INIT~0=0, ~X~0=12.0] [?] assume !false; VAL [ULTIMATE.start___VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start___VERIFIER_assert_#in~cond|=0, |~#E~0.base|=7, |~#E~0.offset|=0, |~#S~0.base|=6, |~#S~0.offset|=0, ~INIT~0=0, ~X~0=12.0] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L15] ~P~0 := 0.0; [L15] ~X~0 := 0.0; [L14] ~INIT~0 := 0; [L27] call ~#E~0.base, ~#E~0.offset := #Ultimate.alloc(8); [L27] call write~init~real(0.0, ~#E~0.base, ~#E~0.offset, 4); [L27] call write~init~real(0.0, ~#E~0.base, 4 + ~#E~0.offset, 4); [L27] call ~#S~0.base, ~#S~0.offset := #Ultimate.alloc(8); [L27] call write~init~real(0.0, ~#S~0.base, ~#S~0.offset, 4); [L27] call write~init~real(0.0, ~#S~0.base, 4 + ~#S~0.offset, 4); [?] havoc main_#res; [?] havoc main_#t~ret7, main_#t~ret8; VAL [#NULL.base=0, #NULL.offset=0, ~#E~0.base=7, ~#E~0.offset=0, ~#S~0.base=6, ~#S~0.offset=0, ~INIT~0=0, ~P~0=0.0, ~X~0=0.0] [L47] CALL call main_#t~ret7 := RANDOM_INPUT(); VAL [#NULL.base=0, #NULL.offset=0, ~#E~0.base=7, ~#E~0.offset=0, ~#S~0.base=6, ~#S~0.offset=0, ~INIT~0=0, ~P~0=0.0, ~X~0=0.0] [L19] havoc ~x~0; [L20] ~x~0 := #t~nondet0; [L20] havoc #t~nondet0; [L21] assume 0 != (if ~someBinaryFLOATComparisonOperation(~x~0, ~someUnaryFLOAToperation(10.0)) && ~someBinaryFLOATComparisonOperation(~x~0, 10.0) then 1 else 0); [L22] #res := ~x~0; [L17-L23] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #res=11.0, ~#E~0.base=7, ~#E~0.offset=0, ~#S~0.base=6, ~#S~0.offset=0, ~INIT~0=0, ~P~0=0.0, ~x~0=11.0, ~X~0=0.0] [L47] RET call main_#t~ret7 := RANDOM_INPUT(); VAL [#NULL.base=0, #NULL.offset=0, main_#t~ret7=11.0, ~#E~0.base=7, ~#E~0.offset=0, ~#S~0.base=6, ~#S~0.offset=0, ~INIT~0=0, ~P~0=0.0, ~X~0=0.0] [L47] ~X~0 := main_#t~ret7; [L47] havoc main_#t~ret7; [L48] ~INIT~0 := ~unnamed0~0~TRUE; VAL [#NULL.base=0, #NULL.offset=0, ~#E~0.base=7, ~#E~0.offset=0, ~#S~0.base=6, ~#S~0.offset=0, ~INIT~0=1, ~P~0=0.0, ~X~0=11.0] [L49-L53] assume !!(0 != ~unnamed0~0~TRUE); VAL [#NULL.base=0, #NULL.offset=0, ~#E~0.base=7, ~#E~0.offset=0, ~#S~0.base=6, ~#S~0.offset=0, ~INIT~0=1, ~P~0=0.0, ~X~0=11.0] [L50] CALL call main_#t~ret8 := RANDOM_INPUT(); VAL [#NULL.base=0, #NULL.offset=0, ~#E~0.base=7, ~#E~0.offset=0, ~#S~0.base=6, ~#S~0.offset=0, ~INIT~0=1, ~P~0=0.0, ~X~0=11.0] [L19] havoc ~x~0; [L20] ~x~0 := #t~nondet0; [L20] havoc #t~nondet0; [L21] assume 0 != (if ~someBinaryFLOATComparisonOperation(~x~0, ~someUnaryFLOAToperation(10.0)) && ~someBinaryFLOATComparisonOperation(~x~0, 10.0) then 1 else 0); [L22] #res := ~x~0; [L17-L23] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #res=1.0, ~#E~0.base=7, ~#E~0.offset=0, ~#S~0.base=6, ~#S~0.offset=0, ~INIT~0=1, ~P~0=0.0, ~x~0=1.0, ~X~0=11.0] [L50] RET call main_#t~ret8 := RANDOM_INPUT(); VAL [#NULL.base=0, #NULL.offset=0, main_#t~ret8=1.0, ~#E~0.base=7, ~#E~0.offset=0, ~#S~0.base=6, ~#S~0.offset=0, ~INIT~0=1, ~P~0=0.0, ~X~0=11.0] [L50] ~X~0 := main_#t~ret8; [L50] havoc main_#t~ret8; [L51] havoc filter2_#t~mem1, filter2_#t~mem2, filter2_#t~mem3, filter2_#t~mem4, filter2_#t~mem5, filter2_#t~mem6; VAL [#NULL.base=0, #NULL.offset=0, ~#E~0.base=7, ~#E~0.offset=0, ~#S~0.base=6, ~#S~0.offset=0, ~INIT~0=1, ~P~0=0.0, ~X~0=1.0] [L28-L40] assume 0 != ~INIT~0; [L29] call write~real(~X~0, ~#S~0.base, ~#S~0.offset, 4); [L30] ~P~0 := ~X~0; [L31] call write~real(~X~0, ~#E~0.base, ~#E~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#E~0.base=7, ~#E~0.offset=0, ~#S~0.base=6, ~#S~0.offset=0, ~INIT~0=1, ~P~0=1.0, ~X~0=1.0] [L41] call filter2_#t~mem5 := read~real(~#E~0.base, ~#E~0.offset, 4); [L41] call write~real(filter2_#t~mem5, ~#E~0.base, 4 + ~#E~0.offset, 4); [L41] havoc filter2_#t~mem5; [L41] call write~real(~X~0, ~#E~0.base, ~#E~0.offset, 4); [L42] call filter2_#t~mem6 := read~real(~#S~0.base, ~#S~0.offset, 4); [L42] call write~real(filter2_#t~mem6, ~#S~0.base, 4 + ~#S~0.offset, 4); [L42] havoc filter2_#t~mem6; [L42] call write~real(~P~0, ~#S~0.base, ~#S~0.offset, 4); [L52] ~INIT~0 := ~unnamed0~0~FALSE; VAL [#NULL.base=0, #NULL.offset=0, ~#E~0.base=7, ~#E~0.offset=0, ~#S~0.base=6, ~#S~0.offset=0, ~INIT~0=0, ~P~0=1.0, ~X~0=1.0] [L49-L53] assume !!(0 != ~unnamed0~0~TRUE); VAL [#NULL.base=0, #NULL.offset=0, ~#E~0.base=7, ~#E~0.offset=0, ~#S~0.base=6, ~#S~0.offset=0, ~INIT~0=0, ~P~0=1.0, ~X~0=1.0] [L50] CALL call main_#t~ret8 := RANDOM_INPUT(); VAL [#NULL.base=0, #NULL.offset=0, ~#E~0.base=7, ~#E~0.offset=0, ~#S~0.base=6, ~#S~0.offset=0, ~INIT~0=0, ~P~0=1.0, ~X~0=1.0] [L19] havoc ~x~0; [L20] ~x~0 := #t~nondet0; [L20] havoc #t~nondet0; [L21] assume 0 != (if ~someBinaryFLOATComparisonOperation(~x~0, ~someUnaryFLOAToperation(10.0)) && ~someBinaryFLOATComparisonOperation(~x~0, 10.0) then 1 else 0); [L22] #res := ~x~0; [L17-L23] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #res=12.0, ~#E~0.base=7, ~#E~0.offset=0, ~#S~0.base=6, ~#S~0.offset=0, ~INIT~0=0, ~P~0=1.0, ~x~0=12.0, ~X~0=1.0] [L50] RET call main_#t~ret8 := RANDOM_INPUT(); VAL [#NULL.base=0, #NULL.offset=0, main_#t~ret8=12.0, ~#E~0.base=7, ~#E~0.offset=0, ~#S~0.base=6, ~#S~0.offset=0, ~INIT~0=0, ~P~0=1.0, ~X~0=1.0] [L50] ~X~0 := main_#t~ret8; [L50] havoc main_#t~ret8; [L51] havoc filter2_#t~mem1, filter2_#t~mem2, filter2_#t~mem3, filter2_#t~mem4, filter2_#t~mem5, filter2_#t~mem6; VAL [#NULL.base=0, #NULL.offset=0, ~#E~0.base=7, ~#E~0.offset=0, ~#S~0.base=6, ~#S~0.offset=0, ~INIT~0=0, ~P~0=1.0, ~X~0=12.0] [L28-L40] assume !(0 != ~INIT~0); [L34] call filter2_#t~mem1 := read~real(~#E~0.base, ~#E~0.offset, 4); [L35] call filter2_#t~mem2 := read~real(~#E~0.base, 4 + ~#E~0.offset, 4); [L36] call filter2_#t~mem3 := read~real(~#S~0.base, ~#S~0.offset, 4); [L37] call filter2_#t~mem4 := read~real(~#S~0.base, 4 + ~#S~0.offset, 4); [L33-L37] ~P~0 := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(0.4677826, ~X~0), ~someBinaryArithmeticFLOAToperation(filter2_#t~mem1, 0.7700725)), ~someBinaryArithmeticFLOAToperation(filter2_#t~mem2, 0.4344376)), ~someBinaryArithmeticFLOAToperation(filter2_#t~mem3, 1.5419)), ~someBinaryArithmeticFLOAToperation(filter2_#t~mem4, 0.6740477)); [L35] havoc filter2_#t~mem2; [L37] havoc filter2_#t~mem4; [L36] havoc filter2_#t~mem3; [L34] havoc filter2_#t~mem1; [L38] __VERIFIER_assert_#in~cond := (if ~someBinaryFLOATComparisonOperation(~P~0, ~someUnaryFLOAToperation(15.0)) && ~someBinaryFLOATComparisonOperation(~P~0, 15.0) then 1 else 0); [L38] havoc __VERIFIER_assert_~cond; [L9] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [#NULL.base=0, #NULL.offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, ~#E~0.base=7, ~#E~0.offset=0, ~#S~0.base=6, ~#S~0.offset=0, ~INIT~0=0, ~X~0=12.0] [L9] assume 0 == __VERIFIER_assert_~cond; VAL [#NULL.base=0, #NULL.offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, ~#E~0.base=7, ~#E~0.offset=0, ~#S~0.base=6, ~#S~0.offset=0, ~INIT~0=0, ~X~0=12.0] [L9] assert false; VAL [#NULL.base=0, #NULL.offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, ~#E~0.base=7, ~#E~0.offset=0, ~#S~0.base=6, ~#S~0.offset=0, ~INIT~0=0, ~X~0=12.0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L15] ~P~0 := 0.0; [L15] ~X~0 := 0.0; [L14] ~INIT~0 := 0; [L27] call ~#E~0.base, ~#E~0.offset := #Ultimate.alloc(8); [L27] call write~init~real(0.0, ~#E~0.base, ~#E~0.offset, 4); [L27] call write~init~real(0.0, ~#E~0.base, 4 + ~#E~0.offset, 4); [L27] call ~#S~0.base, ~#S~0.offset := #Ultimate.alloc(8); [L27] call write~init~real(0.0, ~#S~0.base, ~#S~0.offset, 4); [L27] call write~init~real(0.0, ~#S~0.base, 4 + ~#S~0.offset, 4); [?] havoc main_#res; [?] havoc main_#t~ret7, main_#t~ret8; VAL [#NULL.base=0, #NULL.offset=0, ~#E~0.base=7, ~#E~0.offset=0, ~#S~0.base=6, ~#S~0.offset=0, ~INIT~0=0, ~P~0=0.0, ~X~0=0.0] [L47] CALL call main_#t~ret7 := RANDOM_INPUT(); VAL [#NULL.base=0, #NULL.offset=0, ~#E~0.base=7, ~#E~0.offset=0, ~#S~0.base=6, ~#S~0.offset=0, ~INIT~0=0, ~P~0=0.0, ~X~0=0.0] [L19] havoc ~x~0; [L20] ~x~0 := #t~nondet0; [L20] havoc #t~nondet0; [L21] assume 0 != (if ~someBinaryFLOATComparisonOperation(~x~0, ~someUnaryFLOAToperation(10.0)) && ~someBinaryFLOATComparisonOperation(~x~0, 10.0) then 1 else 0); [L22] #res := ~x~0; [L17-L23] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #res=11.0, ~#E~0.base=7, ~#E~0.offset=0, ~#S~0.base=6, ~#S~0.offset=0, ~INIT~0=0, ~P~0=0.0, ~x~0=11.0, ~X~0=0.0] [L47] RET call main_#t~ret7 := RANDOM_INPUT(); VAL [#NULL.base=0, #NULL.offset=0, main_#t~ret7=11.0, ~#E~0.base=7, ~#E~0.offset=0, ~#S~0.base=6, ~#S~0.offset=0, ~INIT~0=0, ~P~0=0.0, ~X~0=0.0] [L47] ~X~0 := main_#t~ret7; [L47] havoc main_#t~ret7; [L48] ~INIT~0 := ~unnamed0~0~TRUE; VAL [#NULL.base=0, #NULL.offset=0, ~#E~0.base=7, ~#E~0.offset=0, ~#S~0.base=6, ~#S~0.offset=0, ~INIT~0=1, ~P~0=0.0, ~X~0=11.0] [L49-L53] assume !!(0 != ~unnamed0~0~TRUE); VAL [#NULL.base=0, #NULL.offset=0, ~#E~0.base=7, ~#E~0.offset=0, ~#S~0.base=6, ~#S~0.offset=0, ~INIT~0=1, ~P~0=0.0, ~X~0=11.0] [L50] CALL call main_#t~ret8 := RANDOM_INPUT(); VAL [#NULL.base=0, #NULL.offset=0, ~#E~0.base=7, ~#E~0.offset=0, ~#S~0.base=6, ~#S~0.offset=0, ~INIT~0=1, ~P~0=0.0, ~X~0=11.0] [L19] havoc ~x~0; [L20] ~x~0 := #t~nondet0; [L20] havoc #t~nondet0; [L21] assume 0 != (if ~someBinaryFLOATComparisonOperation(~x~0, ~someUnaryFLOAToperation(10.0)) && ~someBinaryFLOATComparisonOperation(~x~0, 10.0) then 1 else 0); [L22] #res := ~x~0; [L17-L23] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #res=1.0, ~#E~0.base=7, ~#E~0.offset=0, ~#S~0.base=6, ~#S~0.offset=0, ~INIT~0=1, ~P~0=0.0, ~x~0=1.0, ~X~0=11.0] [L50] RET call main_#t~ret8 := RANDOM_INPUT(); VAL [#NULL.base=0, #NULL.offset=0, main_#t~ret8=1.0, ~#E~0.base=7, ~#E~0.offset=0, ~#S~0.base=6, ~#S~0.offset=0, ~INIT~0=1, ~P~0=0.0, ~X~0=11.0] [L50] ~X~0 := main_#t~ret8; [L50] havoc main_#t~ret8; [L51] havoc filter2_#t~mem1, filter2_#t~mem2, filter2_#t~mem3, filter2_#t~mem4, filter2_#t~mem5, filter2_#t~mem6; VAL [#NULL.base=0, #NULL.offset=0, ~#E~0.base=7, ~#E~0.offset=0, ~#S~0.base=6, ~#S~0.offset=0, ~INIT~0=1, ~P~0=0.0, ~X~0=1.0] [L28-L40] assume 0 != ~INIT~0; [L29] call write~real(~X~0, ~#S~0.base, ~#S~0.offset, 4); [L30] ~P~0 := ~X~0; [L31] call write~real(~X~0, ~#E~0.base, ~#E~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, ~#E~0.base=7, ~#E~0.offset=0, ~#S~0.base=6, ~#S~0.offset=0, ~INIT~0=1, ~P~0=1.0, ~X~0=1.0] [L41] call filter2_#t~mem5 := read~real(~#E~0.base, ~#E~0.offset, 4); [L41] call write~real(filter2_#t~mem5, ~#E~0.base, 4 + ~#E~0.offset, 4); [L41] havoc filter2_#t~mem5; [L41] call write~real(~X~0, ~#E~0.base, ~#E~0.offset, 4); [L42] call filter2_#t~mem6 := read~real(~#S~0.base, ~#S~0.offset, 4); [L42] call write~real(filter2_#t~mem6, ~#S~0.base, 4 + ~#S~0.offset, 4); [L42] havoc filter2_#t~mem6; [L42] call write~real(~P~0, ~#S~0.base, ~#S~0.offset, 4); [L52] ~INIT~0 := ~unnamed0~0~FALSE; VAL [#NULL.base=0, #NULL.offset=0, ~#E~0.base=7, ~#E~0.offset=0, ~#S~0.base=6, ~#S~0.offset=0, ~INIT~0=0, ~P~0=1.0, ~X~0=1.0] [L49-L53] assume !!(0 != ~unnamed0~0~TRUE); VAL [#NULL.base=0, #NULL.offset=0, ~#E~0.base=7, ~#E~0.offset=0, ~#S~0.base=6, ~#S~0.offset=0, ~INIT~0=0, ~P~0=1.0, ~X~0=1.0] [L50] CALL call main_#t~ret8 := RANDOM_INPUT(); VAL [#NULL.base=0, #NULL.offset=0, ~#E~0.base=7, ~#E~0.offset=0, ~#S~0.base=6, ~#S~0.offset=0, ~INIT~0=0, ~P~0=1.0, ~X~0=1.0] [L19] havoc ~x~0; [L20] ~x~0 := #t~nondet0; [L20] havoc #t~nondet0; [L21] assume 0 != (if ~someBinaryFLOATComparisonOperation(~x~0, ~someUnaryFLOAToperation(10.0)) && ~someBinaryFLOATComparisonOperation(~x~0, 10.0) then 1 else 0); [L22] #res := ~x~0; [L17-L23] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #res=12.0, ~#E~0.base=7, ~#E~0.offset=0, ~#S~0.base=6, ~#S~0.offset=0, ~INIT~0=0, ~P~0=1.0, ~x~0=12.0, ~X~0=1.0] [L50] RET call main_#t~ret8 := RANDOM_INPUT(); VAL [#NULL.base=0, #NULL.offset=0, main_#t~ret8=12.0, ~#E~0.base=7, ~#E~0.offset=0, ~#S~0.base=6, ~#S~0.offset=0, ~INIT~0=0, ~P~0=1.0, ~X~0=1.0] [L50] ~X~0 := main_#t~ret8; [L50] havoc main_#t~ret8; [L51] havoc filter2_#t~mem1, filter2_#t~mem2, filter2_#t~mem3, filter2_#t~mem4, filter2_#t~mem5, filter2_#t~mem6; VAL [#NULL.base=0, #NULL.offset=0, ~#E~0.base=7, ~#E~0.offset=0, ~#S~0.base=6, ~#S~0.offset=0, ~INIT~0=0, ~P~0=1.0, ~X~0=12.0] [L28-L40] assume !(0 != ~INIT~0); [L34] call filter2_#t~mem1 := read~real(~#E~0.base, ~#E~0.offset, 4); [L35] call filter2_#t~mem2 := read~real(~#E~0.base, 4 + ~#E~0.offset, 4); [L36] call filter2_#t~mem3 := read~real(~#S~0.base, ~#S~0.offset, 4); [L37] call filter2_#t~mem4 := read~real(~#S~0.base, 4 + ~#S~0.offset, 4); [L33-L37] ~P~0 := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(0.4677826, ~X~0), ~someBinaryArithmeticFLOAToperation(filter2_#t~mem1, 0.7700725)), ~someBinaryArithmeticFLOAToperation(filter2_#t~mem2, 0.4344376)), ~someBinaryArithmeticFLOAToperation(filter2_#t~mem3, 1.5419)), ~someBinaryArithmeticFLOAToperation(filter2_#t~mem4, 0.6740477)); [L35] havoc filter2_#t~mem2; [L37] havoc filter2_#t~mem4; [L36] havoc filter2_#t~mem3; [L34] havoc filter2_#t~mem1; [L38] __VERIFIER_assert_#in~cond := (if ~someBinaryFLOATComparisonOperation(~P~0, ~someUnaryFLOAToperation(15.0)) && ~someBinaryFLOATComparisonOperation(~P~0, 15.0) then 1 else 0); [L38] havoc __VERIFIER_assert_~cond; [L9] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [#NULL.base=0, #NULL.offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, ~#E~0.base=7, ~#E~0.offset=0, ~#S~0.base=6, ~#S~0.offset=0, ~INIT~0=0, ~X~0=12.0] [L9] assume 0 == __VERIFIER_assert_~cond; VAL [#NULL.base=0, #NULL.offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, ~#E~0.base=7, ~#E~0.offset=0, ~#S~0.base=6, ~#S~0.offset=0, ~INIT~0=0, ~X~0=12.0] [L9] assert false; VAL [#NULL.base=0, #NULL.offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, ~#E~0.base=7, ~#E~0.offset=0, ~#S~0.base=6, ~#S~0.offset=0, ~INIT~0=0, ~X~0=12.0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L15] ~P~0 := 0.0; [L15] ~X~0 := 0.0; [L14] ~INIT~0 := 0; [L27] FCALL call ~#E~0 := #Ultimate.alloc(8); [L27] FCALL call write~init~real(0.0, { base: ~#E~0!base, offset: ~#E~0!offset }, 4); [L27] FCALL call write~init~real(0.0, { base: ~#E~0!base, offset: 4 + ~#E~0!offset }, 4); [L27] FCALL call ~#S~0 := #Ultimate.alloc(8); [L27] FCALL call write~init~real(0.0, { base: ~#S~0!base, offset: ~#S~0!offset }, 4); [L27] FCALL call write~init~real(0.0, { base: ~#S~0!base, offset: 4 + ~#S~0!offset }, 4); [?] havoc main_#res; [?] havoc main_#t~ret7, main_#t~ret8; VAL [#NULL!base=0, #NULL!offset=0, ~#E~0!base=7, ~#E~0!offset=0, ~#S~0!base=6, ~#S~0!offset=0, ~INIT~0=0, ~P~0=0.0, ~X~0=0.0] [L47] CALL call main_#t~ret7 := RANDOM_INPUT(); VAL [#NULL!base=0, #NULL!offset=0, ~#E~0!base=7, ~#E~0!offset=0, ~#S~0!base=6, ~#S~0!offset=0, ~INIT~0=0, ~P~0=0.0, ~X~0=0.0] [L19] havoc ~x~0; [L20] ~x~0 := #t~nondet0; [L20] havoc #t~nondet0; [L21] assume 0 != (if ~someBinaryFLOATComparisonOperation(~x~0, ~someUnaryFLOAToperation(10.0)) && ~someBinaryFLOATComparisonOperation(~x~0, 10.0) then 1 else 0); [L22] #res := ~x~0; [L47] RET call main_#t~ret7 := RANDOM_INPUT(); VAL [#NULL!base=0, #NULL!offset=0, main_#t~ret7=11.0, ~#E~0!base=7, ~#E~0!offset=0, ~#S~0!base=6, ~#S~0!offset=0, ~INIT~0=0, ~P~0=0.0, ~X~0=0.0] [L47] ~X~0 := main_#t~ret7; [L47] havoc main_#t~ret7; [L48] ~INIT~0 := ~unnamed0~0~TRUE; VAL [#NULL!base=0, #NULL!offset=0, ~#E~0!base=7, ~#E~0!offset=0, ~#S~0!base=6, ~#S~0!offset=0, ~INIT~0=1, ~P~0=0.0, ~X~0=11.0] [L49-L53] COND FALSE !(!(0 != ~unnamed0~0~TRUE)) VAL [#NULL!base=0, #NULL!offset=0, ~#E~0!base=7, ~#E~0!offset=0, ~#S~0!base=6, ~#S~0!offset=0, ~INIT~0=1, ~P~0=0.0, ~X~0=11.0] [L50] CALL call main_#t~ret8 := RANDOM_INPUT(); VAL [#NULL!base=0, #NULL!offset=0, ~#E~0!base=7, ~#E~0!offset=0, ~#S~0!base=6, ~#S~0!offset=0, ~INIT~0=1, ~P~0=0.0, ~X~0=11.0] [L19] havoc ~x~0; [L20] ~x~0 := #t~nondet0; [L20] havoc #t~nondet0; [L21] assume 0 != (if ~someBinaryFLOATComparisonOperation(~x~0, ~someUnaryFLOAToperation(10.0)) && ~someBinaryFLOATComparisonOperation(~x~0, 10.0) then 1 else 0); [L22] #res := ~x~0; [L50] RET call main_#t~ret8 := RANDOM_INPUT(); VAL [#NULL!base=0, #NULL!offset=0, main_#t~ret8=1.0, ~#E~0!base=7, ~#E~0!offset=0, ~#S~0!base=6, ~#S~0!offset=0, ~INIT~0=1, ~P~0=0.0, ~X~0=11.0] [L50] ~X~0 := main_#t~ret8; [L50] havoc main_#t~ret8; [L51] havoc filter2_#t~mem1, filter2_#t~mem2, filter2_#t~mem3, filter2_#t~mem4, filter2_#t~mem5, filter2_#t~mem6; VAL [#NULL!base=0, #NULL!offset=0, ~#E~0!base=7, ~#E~0!offset=0, ~#S~0!base=6, ~#S~0!offset=0, ~INIT~0=1, ~P~0=0.0, ~X~0=1.0] [L28-L40] COND TRUE 0 != ~INIT~0 [L29] FCALL call write~real(~X~0, { base: ~#S~0!base, offset: ~#S~0!offset }, 4); [L30] ~P~0 := ~X~0; [L31] FCALL call write~real(~X~0, { base: ~#E~0!base, offset: ~#E~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#E~0!base=7, ~#E~0!offset=0, ~#S~0!base=6, ~#S~0!offset=0, ~INIT~0=1, ~P~0=1.0, ~X~0=1.0] [L41] FCALL call filter2_#t~mem5 := read~real({ base: ~#E~0!base, offset: ~#E~0!offset }, 4); [L41] FCALL call write~real(filter2_#t~mem5, { base: ~#E~0!base, offset: 4 + ~#E~0!offset }, 4); [L41] havoc filter2_#t~mem5; [L41] FCALL call write~real(~X~0, { base: ~#E~0!base, offset: ~#E~0!offset }, 4); [L42] FCALL call filter2_#t~mem6 := read~real({ base: ~#S~0!base, offset: ~#S~0!offset }, 4); [L42] FCALL call write~real(filter2_#t~mem6, { base: ~#S~0!base, offset: 4 + ~#S~0!offset }, 4); [L42] havoc filter2_#t~mem6; [L42] FCALL call write~real(~P~0, { base: ~#S~0!base, offset: ~#S~0!offset }, 4); [L52] ~INIT~0 := ~unnamed0~0~FALSE; VAL [#NULL!base=0, #NULL!offset=0, ~#E~0!base=7, ~#E~0!offset=0, ~#S~0!base=6, ~#S~0!offset=0, ~INIT~0=0, ~P~0=1.0, ~X~0=1.0] [L49-L53] COND FALSE !(!(0 != ~unnamed0~0~TRUE)) VAL [#NULL!base=0, #NULL!offset=0, ~#E~0!base=7, ~#E~0!offset=0, ~#S~0!base=6, ~#S~0!offset=0, ~INIT~0=0, ~P~0=1.0, ~X~0=1.0] [L50] CALL call main_#t~ret8 := RANDOM_INPUT(); VAL [#NULL!base=0, #NULL!offset=0, ~#E~0!base=7, ~#E~0!offset=0, ~#S~0!base=6, ~#S~0!offset=0, ~INIT~0=0, ~P~0=1.0, ~X~0=1.0] [L19] havoc ~x~0; [L20] ~x~0 := #t~nondet0; [L20] havoc #t~nondet0; [L21] assume 0 != (if ~someBinaryFLOATComparisonOperation(~x~0, ~someUnaryFLOAToperation(10.0)) && ~someBinaryFLOATComparisonOperation(~x~0, 10.0) then 1 else 0); [L22] #res := ~x~0; [L50] RET call main_#t~ret8 := RANDOM_INPUT(); VAL [#NULL!base=0, #NULL!offset=0, main_#t~ret8=12.0, ~#E~0!base=7, ~#E~0!offset=0, ~#S~0!base=6, ~#S~0!offset=0, ~INIT~0=0, ~P~0=1.0, ~X~0=1.0] [L50] ~X~0 := main_#t~ret8; [L50] havoc main_#t~ret8; [L51] havoc filter2_#t~mem1, filter2_#t~mem2, filter2_#t~mem3, filter2_#t~mem4, filter2_#t~mem5, filter2_#t~mem6; VAL [#NULL!base=0, #NULL!offset=0, ~#E~0!base=7, ~#E~0!offset=0, ~#S~0!base=6, ~#S~0!offset=0, ~INIT~0=0, ~P~0=1.0, ~X~0=12.0] [L28-L40] COND FALSE !(0 != ~INIT~0) [L34] FCALL call filter2_#t~mem1 := read~real({ base: ~#E~0!base, offset: ~#E~0!offset }, 4); [L35] FCALL call filter2_#t~mem2 := read~real({ base: ~#E~0!base, offset: 4 + ~#E~0!offset }, 4); [L36] FCALL call filter2_#t~mem3 := read~real({ base: ~#S~0!base, offset: ~#S~0!offset }, 4); [L37] FCALL call filter2_#t~mem4 := read~real({ base: ~#S~0!base, offset: 4 + ~#S~0!offset }, 4); [L33-L37] ~P~0 := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(0.4677826, ~X~0), ~someBinaryArithmeticFLOAToperation(filter2_#t~mem1, 0.7700725)), ~someBinaryArithmeticFLOAToperation(filter2_#t~mem2, 0.4344376)), ~someBinaryArithmeticFLOAToperation(filter2_#t~mem3, 1.5419)), ~someBinaryArithmeticFLOAToperation(filter2_#t~mem4, 0.6740477)); [L35] havoc filter2_#t~mem2; [L37] havoc filter2_#t~mem4; [L36] havoc filter2_#t~mem3; [L34] havoc filter2_#t~mem1; [L38] __VERIFIER_assert_#in~cond := (if ~someBinaryFLOATComparisonOperation(~P~0, ~someUnaryFLOAToperation(15.0)) && ~someBinaryFLOATComparisonOperation(~P~0, 15.0) then 1 else 0); [L38] havoc __VERIFIER_assert_~cond; [L9] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [#NULL!base=0, #NULL!offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, ~#E~0!base=7, ~#E~0!offset=0, ~#S~0!base=6, ~#S~0!offset=0, ~INIT~0=0, ~X~0=12.0] [L9] COND TRUE 0 == __VERIFIER_assert_~cond VAL [#NULL!base=0, #NULL!offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, ~#E~0!base=7, ~#E~0!offset=0, ~#S~0!base=6, ~#S~0!offset=0, ~INIT~0=0, ~X~0=12.0] [L9] assert false; VAL [#NULL!base=0, #NULL!offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, ~#E~0!base=7, ~#E~0!offset=0, ~#S~0!base=6, ~#S~0!offset=0, ~INIT~0=0, ~X~0=12.0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L15] ~P~0 := 0.0; [L15] ~X~0 := 0.0; [L14] ~INIT~0 := 0; [L27] FCALL call ~#E~0 := #Ultimate.alloc(8); [L27] FCALL call write~init~real(0.0, { base: ~#E~0!base, offset: ~#E~0!offset }, 4); [L27] FCALL call write~init~real(0.0, { base: ~#E~0!base, offset: 4 + ~#E~0!offset }, 4); [L27] FCALL call ~#S~0 := #Ultimate.alloc(8); [L27] FCALL call write~init~real(0.0, { base: ~#S~0!base, offset: ~#S~0!offset }, 4); [L27] FCALL call write~init~real(0.0, { base: ~#S~0!base, offset: 4 + ~#S~0!offset }, 4); [?] havoc main_#res; [?] havoc main_#t~ret7, main_#t~ret8; VAL [#NULL!base=0, #NULL!offset=0, ~#E~0!base=7, ~#E~0!offset=0, ~#S~0!base=6, ~#S~0!offset=0, ~INIT~0=0, ~P~0=0.0, ~X~0=0.0] [L47] CALL call main_#t~ret7 := RANDOM_INPUT(); VAL [#NULL!base=0, #NULL!offset=0, ~#E~0!base=7, ~#E~0!offset=0, ~#S~0!base=6, ~#S~0!offset=0, ~INIT~0=0, ~P~0=0.0, ~X~0=0.0] [L19] havoc ~x~0; [L20] ~x~0 := #t~nondet0; [L20] havoc #t~nondet0; [L21] assume 0 != (if ~someBinaryFLOATComparisonOperation(~x~0, ~someUnaryFLOAToperation(10.0)) && ~someBinaryFLOATComparisonOperation(~x~0, 10.0) then 1 else 0); [L22] #res := ~x~0; [L47] RET call main_#t~ret7 := RANDOM_INPUT(); VAL [#NULL!base=0, #NULL!offset=0, main_#t~ret7=11.0, ~#E~0!base=7, ~#E~0!offset=0, ~#S~0!base=6, ~#S~0!offset=0, ~INIT~0=0, ~P~0=0.0, ~X~0=0.0] [L47] ~X~0 := main_#t~ret7; [L47] havoc main_#t~ret7; [L48] ~INIT~0 := ~unnamed0~0~TRUE; VAL [#NULL!base=0, #NULL!offset=0, ~#E~0!base=7, ~#E~0!offset=0, ~#S~0!base=6, ~#S~0!offset=0, ~INIT~0=1, ~P~0=0.0, ~X~0=11.0] [L49-L53] COND FALSE !(!(0 != ~unnamed0~0~TRUE)) VAL [#NULL!base=0, #NULL!offset=0, ~#E~0!base=7, ~#E~0!offset=0, ~#S~0!base=6, ~#S~0!offset=0, ~INIT~0=1, ~P~0=0.0, ~X~0=11.0] [L50] CALL call main_#t~ret8 := RANDOM_INPUT(); VAL [#NULL!base=0, #NULL!offset=0, ~#E~0!base=7, ~#E~0!offset=0, ~#S~0!base=6, ~#S~0!offset=0, ~INIT~0=1, ~P~0=0.0, ~X~0=11.0] [L19] havoc ~x~0; [L20] ~x~0 := #t~nondet0; [L20] havoc #t~nondet0; [L21] assume 0 != (if ~someBinaryFLOATComparisonOperation(~x~0, ~someUnaryFLOAToperation(10.0)) && ~someBinaryFLOATComparisonOperation(~x~0, 10.0) then 1 else 0); [L22] #res := ~x~0; [L50] RET call main_#t~ret8 := RANDOM_INPUT(); VAL [#NULL!base=0, #NULL!offset=0, main_#t~ret8=1.0, ~#E~0!base=7, ~#E~0!offset=0, ~#S~0!base=6, ~#S~0!offset=0, ~INIT~0=1, ~P~0=0.0, ~X~0=11.0] [L50] ~X~0 := main_#t~ret8; [L50] havoc main_#t~ret8; [L51] havoc filter2_#t~mem1, filter2_#t~mem2, filter2_#t~mem3, filter2_#t~mem4, filter2_#t~mem5, filter2_#t~mem6; VAL [#NULL!base=0, #NULL!offset=0, ~#E~0!base=7, ~#E~0!offset=0, ~#S~0!base=6, ~#S~0!offset=0, ~INIT~0=1, ~P~0=0.0, ~X~0=1.0] [L28-L40] COND TRUE 0 != ~INIT~0 [L29] FCALL call write~real(~X~0, { base: ~#S~0!base, offset: ~#S~0!offset }, 4); [L30] ~P~0 := ~X~0; [L31] FCALL call write~real(~X~0, { base: ~#E~0!base, offset: ~#E~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#E~0!base=7, ~#E~0!offset=0, ~#S~0!base=6, ~#S~0!offset=0, ~INIT~0=1, ~P~0=1.0, ~X~0=1.0] [L41] FCALL call filter2_#t~mem5 := read~real({ base: ~#E~0!base, offset: ~#E~0!offset }, 4); [L41] FCALL call write~real(filter2_#t~mem5, { base: ~#E~0!base, offset: 4 + ~#E~0!offset }, 4); [L41] havoc filter2_#t~mem5; [L41] FCALL call write~real(~X~0, { base: ~#E~0!base, offset: ~#E~0!offset }, 4); [L42] FCALL call filter2_#t~mem6 := read~real({ base: ~#S~0!base, offset: ~#S~0!offset }, 4); [L42] FCALL call write~real(filter2_#t~mem6, { base: ~#S~0!base, offset: 4 + ~#S~0!offset }, 4); [L42] havoc filter2_#t~mem6; [L42] FCALL call write~real(~P~0, { base: ~#S~0!base, offset: ~#S~0!offset }, 4); [L52] ~INIT~0 := ~unnamed0~0~FALSE; VAL [#NULL!base=0, #NULL!offset=0, ~#E~0!base=7, ~#E~0!offset=0, ~#S~0!base=6, ~#S~0!offset=0, ~INIT~0=0, ~P~0=1.0, ~X~0=1.0] [L49-L53] COND FALSE !(!(0 != ~unnamed0~0~TRUE)) VAL [#NULL!base=0, #NULL!offset=0, ~#E~0!base=7, ~#E~0!offset=0, ~#S~0!base=6, ~#S~0!offset=0, ~INIT~0=0, ~P~0=1.0, ~X~0=1.0] [L50] CALL call main_#t~ret8 := RANDOM_INPUT(); VAL [#NULL!base=0, #NULL!offset=0, ~#E~0!base=7, ~#E~0!offset=0, ~#S~0!base=6, ~#S~0!offset=0, ~INIT~0=0, ~P~0=1.0, ~X~0=1.0] [L19] havoc ~x~0; [L20] ~x~0 := #t~nondet0; [L20] havoc #t~nondet0; [L21] assume 0 != (if ~someBinaryFLOATComparisonOperation(~x~0, ~someUnaryFLOAToperation(10.0)) && ~someBinaryFLOATComparisonOperation(~x~0, 10.0) then 1 else 0); [L22] #res := ~x~0; [L50] RET call main_#t~ret8 := RANDOM_INPUT(); VAL [#NULL!base=0, #NULL!offset=0, main_#t~ret8=12.0, ~#E~0!base=7, ~#E~0!offset=0, ~#S~0!base=6, ~#S~0!offset=0, ~INIT~0=0, ~P~0=1.0, ~X~0=1.0] [L50] ~X~0 := main_#t~ret8; [L50] havoc main_#t~ret8; [L51] havoc filter2_#t~mem1, filter2_#t~mem2, filter2_#t~mem3, filter2_#t~mem4, filter2_#t~mem5, filter2_#t~mem6; VAL [#NULL!base=0, #NULL!offset=0, ~#E~0!base=7, ~#E~0!offset=0, ~#S~0!base=6, ~#S~0!offset=0, ~INIT~0=0, ~P~0=1.0, ~X~0=12.0] [L28-L40] COND FALSE !(0 != ~INIT~0) [L34] FCALL call filter2_#t~mem1 := read~real({ base: ~#E~0!base, offset: ~#E~0!offset }, 4); [L35] FCALL call filter2_#t~mem2 := read~real({ base: ~#E~0!base, offset: 4 + ~#E~0!offset }, 4); [L36] FCALL call filter2_#t~mem3 := read~real({ base: ~#S~0!base, offset: ~#S~0!offset }, 4); [L37] FCALL call filter2_#t~mem4 := read~real({ base: ~#S~0!base, offset: 4 + ~#S~0!offset }, 4); [L33-L37] ~P~0 := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(0.4677826, ~X~0), ~someBinaryArithmeticFLOAToperation(filter2_#t~mem1, 0.7700725)), ~someBinaryArithmeticFLOAToperation(filter2_#t~mem2, 0.4344376)), ~someBinaryArithmeticFLOAToperation(filter2_#t~mem3, 1.5419)), ~someBinaryArithmeticFLOAToperation(filter2_#t~mem4, 0.6740477)); [L35] havoc filter2_#t~mem2; [L37] havoc filter2_#t~mem4; [L36] havoc filter2_#t~mem3; [L34] havoc filter2_#t~mem1; [L38] __VERIFIER_assert_#in~cond := (if ~someBinaryFLOATComparisonOperation(~P~0, ~someUnaryFLOAToperation(15.0)) && ~someBinaryFLOATComparisonOperation(~P~0, 15.0) then 1 else 0); [L38] havoc __VERIFIER_assert_~cond; [L9] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [#NULL!base=0, #NULL!offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, ~#E~0!base=7, ~#E~0!offset=0, ~#S~0!base=6, ~#S~0!offset=0, ~INIT~0=0, ~X~0=12.0] [L9] COND TRUE 0 == __VERIFIER_assert_~cond VAL [#NULL!base=0, #NULL!offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, ~#E~0!base=7, ~#E~0!offset=0, ~#S~0!base=6, ~#S~0!offset=0, ~INIT~0=0, ~X~0=12.0] [L9] assert false; VAL [#NULL!base=0, #NULL!offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, ~#E~0!base=7, ~#E~0!offset=0, ~#S~0!base=6, ~#S~0!offset=0, ~INIT~0=0, ~X~0=12.0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L15] ~P~0 := 0.0; [L15] ~X~0 := 0.0; [L14] ~INIT~0 := 0; [L27] FCALL call ~#E~0 := #Ultimate.alloc(8); [L27] FCALL call write~init~real(0.0, { base: ~#E~0!base, offset: ~#E~0!offset }, 4); [L27] FCALL call write~init~real(0.0, { base: ~#E~0!base, offset: 4 + ~#E~0!offset }, 4); [L27] FCALL call ~#S~0 := #Ultimate.alloc(8); [L27] FCALL call write~init~real(0.0, { base: ~#S~0!base, offset: ~#S~0!offset }, 4); [L27] FCALL call write~init~real(0.0, { base: ~#S~0!base, offset: 4 + ~#S~0!offset }, 4); [L47] CALL call #t~ret7 := RANDOM_INPUT(); VAL [#NULL!base=0, #NULL!offset=0, ~#E~0!base=7, ~#E~0!offset=0, ~#S~0!base=6, ~#S~0!offset=0, ~INIT~0=0, ~P~0=0.0, ~X~0=0.0] [L19] havoc ~x~0; [L20] ~x~0 := #t~nondet0; [L20] havoc #t~nondet0; [L21] assume 0 != (if ~someBinaryFLOATComparisonOperation(~x~0, ~someUnaryFLOAToperation(10.0)) && ~someBinaryFLOATComparisonOperation(~x~0, 10.0) then 1 else 0); [L22] #res := ~x~0; [L47] RET call #t~ret7 := RANDOM_INPUT(); VAL [#NULL!base=0, #NULL!offset=0, ~#E~0!base=7, ~#E~0!offset=0, ~#S~0!base=6, ~#S~0!offset=0, ~INIT~0=0, ~P~0=0.0, ~X~0=0.0] [L47] ~X~0 := #t~ret7; [L47] havoc #t~ret7; [L48] ~INIT~0 := ~unnamed0~0~TRUE; VAL [#NULL!base=0, #NULL!offset=0, ~#E~0!base=7, ~#E~0!offset=0, ~#S~0!base=6, ~#S~0!offset=0, ~INIT~0=1, ~P~0=0.0, ~X~0=11.0] [L49-L53] COND FALSE !(!(0 != ~unnamed0~0~TRUE)) VAL [#NULL!base=0, #NULL!offset=0, ~#E~0!base=7, ~#E~0!offset=0, ~#S~0!base=6, ~#S~0!offset=0, ~INIT~0=1, ~P~0=0.0, ~X~0=11.0] [L50] CALL call #t~ret8 := RANDOM_INPUT(); VAL [#NULL!base=0, #NULL!offset=0, ~#E~0!base=7, ~#E~0!offset=0, ~#S~0!base=6, ~#S~0!offset=0, ~INIT~0=1, ~P~0=0.0, ~X~0=11.0] [L19] havoc ~x~0; [L20] ~x~0 := #t~nondet0; [L20] havoc #t~nondet0; [L21] assume 0 != (if ~someBinaryFLOATComparisonOperation(~x~0, ~someUnaryFLOAToperation(10.0)) && ~someBinaryFLOATComparisonOperation(~x~0, 10.0) then 1 else 0); [L22] #res := ~x~0; [L50] RET call #t~ret8 := RANDOM_INPUT(); VAL [#NULL!base=0, #NULL!offset=0, ~#E~0!base=7, ~#E~0!offset=0, ~#S~0!base=6, ~#S~0!offset=0, ~INIT~0=1, ~P~0=0.0, ~X~0=11.0] [L50] ~X~0 := #t~ret8; [L50] havoc #t~ret8; [L28-L40] COND TRUE 0 != ~INIT~0 [L29] FCALL call write~real(~X~0, { base: ~#S~0!base, offset: ~#S~0!offset }, 4); [L30] ~P~0 := ~X~0; [L31] FCALL call write~real(~X~0, { base: ~#E~0!base, offset: ~#E~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#E~0!base=7, ~#E~0!offset=0, ~#S~0!base=6, ~#S~0!offset=0, ~INIT~0=1, ~P~0=1.0, ~X~0=1.0] [L41] FCALL call #t~mem5 := read~real({ base: ~#E~0!base, offset: ~#E~0!offset }, 4); [L41] FCALL call write~real(#t~mem5, { base: ~#E~0!base, offset: 4 + ~#E~0!offset }, 4); [L41] havoc #t~mem5; [L41] FCALL call write~real(~X~0, { base: ~#E~0!base, offset: ~#E~0!offset }, 4); [L42] FCALL call #t~mem6 := read~real({ base: ~#S~0!base, offset: ~#S~0!offset }, 4); [L42] FCALL call write~real(#t~mem6, { base: ~#S~0!base, offset: 4 + ~#S~0!offset }, 4); [L42] havoc #t~mem6; [L42] FCALL call write~real(~P~0, { base: ~#S~0!base, offset: ~#S~0!offset }, 4); [L52] ~INIT~0 := ~unnamed0~0~FALSE; VAL [#NULL!base=0, #NULL!offset=0, ~#E~0!base=7, ~#E~0!offset=0, ~#S~0!base=6, ~#S~0!offset=0, ~INIT~0=0, ~P~0=1.0, ~X~0=1.0] [L49-L53] COND FALSE !(!(0 != ~unnamed0~0~TRUE)) VAL [#NULL!base=0, #NULL!offset=0, ~#E~0!base=7, ~#E~0!offset=0, ~#S~0!base=6, ~#S~0!offset=0, ~INIT~0=0, ~P~0=1.0, ~X~0=1.0] [L50] CALL call #t~ret8 := RANDOM_INPUT(); VAL [#NULL!base=0, #NULL!offset=0, ~#E~0!base=7, ~#E~0!offset=0, ~#S~0!base=6, ~#S~0!offset=0, ~INIT~0=0, ~P~0=1.0, ~X~0=1.0] [L19] havoc ~x~0; [L20] ~x~0 := #t~nondet0; [L20] havoc #t~nondet0; [L21] assume 0 != (if ~someBinaryFLOATComparisonOperation(~x~0, ~someUnaryFLOAToperation(10.0)) && ~someBinaryFLOATComparisonOperation(~x~0, 10.0) then 1 else 0); [L22] #res := ~x~0; [L50] RET call #t~ret8 := RANDOM_INPUT(); VAL [#NULL!base=0, #NULL!offset=0, ~#E~0!base=7, ~#E~0!offset=0, ~#S~0!base=6, ~#S~0!offset=0, ~INIT~0=0, ~P~0=1.0, ~X~0=1.0] [L50] ~X~0 := #t~ret8; [L50] havoc #t~ret8; [L28-L40] COND FALSE !(0 != ~INIT~0) [L34] FCALL call #t~mem1 := read~real({ base: ~#E~0!base, offset: ~#E~0!offset }, 4); [L35] FCALL call #t~mem2 := read~real({ base: ~#E~0!base, offset: 4 + ~#E~0!offset }, 4); [L36] FCALL call #t~mem3 := read~real({ base: ~#S~0!base, offset: ~#S~0!offset }, 4); [L37] FCALL call #t~mem4 := read~real({ base: ~#S~0!base, offset: 4 + ~#S~0!offset }, 4); [L33-L37] ~P~0 := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(0.4677826, ~X~0), ~someBinaryArithmeticFLOAToperation(#t~mem1, 0.7700725)), ~someBinaryArithmeticFLOAToperation(#t~mem2, 0.4344376)), ~someBinaryArithmeticFLOAToperation(#t~mem3, 1.5419)), ~someBinaryArithmeticFLOAToperation(#t~mem4, 0.6740477)); [L35] havoc #t~mem2; [L37] havoc #t~mem4; [L36] havoc #t~mem3; [L34] havoc #t~mem1; [L9] ~cond := #in~cond; VAL [#NULL!base=0, #NULL!offset=0, ~#E~0!base=7, ~#E~0!offset=0, ~#S~0!base=6, ~#S~0!offset=0, ~INIT~0=0, ~X~0=12.0] [L9] COND TRUE 0 == ~cond VAL [#NULL!base=0, #NULL!offset=0, ~#E~0!base=7, ~#E~0!offset=0, ~#S~0!base=6, ~#S~0!offset=0, ~INIT~0=0, ~X~0=12.0] [L9] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#E~0!base=7, ~#E~0!offset=0, ~#S~0!base=6, ~#S~0!offset=0, ~INIT~0=0, ~X~0=12.0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L15] ~P~0 := 0.0; [L15] ~X~0 := 0.0; [L14] ~INIT~0 := 0; [L27] FCALL call ~#E~0 := #Ultimate.alloc(8); [L27] FCALL call write~init~real(0.0, { base: ~#E~0!base, offset: ~#E~0!offset }, 4); [L27] FCALL call write~init~real(0.0, { base: ~#E~0!base, offset: 4 + ~#E~0!offset }, 4); [L27] FCALL call ~#S~0 := #Ultimate.alloc(8); [L27] FCALL call write~init~real(0.0, { base: ~#S~0!base, offset: ~#S~0!offset }, 4); [L27] FCALL call write~init~real(0.0, { base: ~#S~0!base, offset: 4 + ~#S~0!offset }, 4); [L47] CALL call #t~ret7 := RANDOM_INPUT(); VAL [#NULL!base=0, #NULL!offset=0, ~#E~0!base=7, ~#E~0!offset=0, ~#S~0!base=6, ~#S~0!offset=0, ~INIT~0=0, ~P~0=0.0, ~X~0=0.0] [L19] havoc ~x~0; [L20] ~x~0 := #t~nondet0; [L20] havoc #t~nondet0; [L21] assume 0 != (if ~someBinaryFLOATComparisonOperation(~x~0, ~someUnaryFLOAToperation(10.0)) && ~someBinaryFLOATComparisonOperation(~x~0, 10.0) then 1 else 0); [L22] #res := ~x~0; [L47] RET call #t~ret7 := RANDOM_INPUT(); VAL [#NULL!base=0, #NULL!offset=0, ~#E~0!base=7, ~#E~0!offset=0, ~#S~0!base=6, ~#S~0!offset=0, ~INIT~0=0, ~P~0=0.0, ~X~0=0.0] [L47] ~X~0 := #t~ret7; [L47] havoc #t~ret7; [L48] ~INIT~0 := ~unnamed0~0~TRUE; VAL [#NULL!base=0, #NULL!offset=0, ~#E~0!base=7, ~#E~0!offset=0, ~#S~0!base=6, ~#S~0!offset=0, ~INIT~0=1, ~P~0=0.0, ~X~0=11.0] [L49-L53] COND FALSE !(!(0 != ~unnamed0~0~TRUE)) VAL [#NULL!base=0, #NULL!offset=0, ~#E~0!base=7, ~#E~0!offset=0, ~#S~0!base=6, ~#S~0!offset=0, ~INIT~0=1, ~P~0=0.0, ~X~0=11.0] [L50] CALL call #t~ret8 := RANDOM_INPUT(); VAL [#NULL!base=0, #NULL!offset=0, ~#E~0!base=7, ~#E~0!offset=0, ~#S~0!base=6, ~#S~0!offset=0, ~INIT~0=1, ~P~0=0.0, ~X~0=11.0] [L19] havoc ~x~0; [L20] ~x~0 := #t~nondet0; [L20] havoc #t~nondet0; [L21] assume 0 != (if ~someBinaryFLOATComparisonOperation(~x~0, ~someUnaryFLOAToperation(10.0)) && ~someBinaryFLOATComparisonOperation(~x~0, 10.0) then 1 else 0); [L22] #res := ~x~0; [L50] RET call #t~ret8 := RANDOM_INPUT(); VAL [#NULL!base=0, #NULL!offset=0, ~#E~0!base=7, ~#E~0!offset=0, ~#S~0!base=6, ~#S~0!offset=0, ~INIT~0=1, ~P~0=0.0, ~X~0=11.0] [L50] ~X~0 := #t~ret8; [L50] havoc #t~ret8; [L28-L40] COND TRUE 0 != ~INIT~0 [L29] FCALL call write~real(~X~0, { base: ~#S~0!base, offset: ~#S~0!offset }, 4); [L30] ~P~0 := ~X~0; [L31] FCALL call write~real(~X~0, { base: ~#E~0!base, offset: ~#E~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, ~#E~0!base=7, ~#E~0!offset=0, ~#S~0!base=6, ~#S~0!offset=0, ~INIT~0=1, ~P~0=1.0, ~X~0=1.0] [L41] FCALL call #t~mem5 := read~real({ base: ~#E~0!base, offset: ~#E~0!offset }, 4); [L41] FCALL call write~real(#t~mem5, { base: ~#E~0!base, offset: 4 + ~#E~0!offset }, 4); [L41] havoc #t~mem5; [L41] FCALL call write~real(~X~0, { base: ~#E~0!base, offset: ~#E~0!offset }, 4); [L42] FCALL call #t~mem6 := read~real({ base: ~#S~0!base, offset: ~#S~0!offset }, 4); [L42] FCALL call write~real(#t~mem6, { base: ~#S~0!base, offset: 4 + ~#S~0!offset }, 4); [L42] havoc #t~mem6; [L42] FCALL call write~real(~P~0, { base: ~#S~0!base, offset: ~#S~0!offset }, 4); [L52] ~INIT~0 := ~unnamed0~0~FALSE; VAL [#NULL!base=0, #NULL!offset=0, ~#E~0!base=7, ~#E~0!offset=0, ~#S~0!base=6, ~#S~0!offset=0, ~INIT~0=0, ~P~0=1.0, ~X~0=1.0] [L49-L53] COND FALSE !(!(0 != ~unnamed0~0~TRUE)) VAL [#NULL!base=0, #NULL!offset=0, ~#E~0!base=7, ~#E~0!offset=0, ~#S~0!base=6, ~#S~0!offset=0, ~INIT~0=0, ~P~0=1.0, ~X~0=1.0] [L50] CALL call #t~ret8 := RANDOM_INPUT(); VAL [#NULL!base=0, #NULL!offset=0, ~#E~0!base=7, ~#E~0!offset=0, ~#S~0!base=6, ~#S~0!offset=0, ~INIT~0=0, ~P~0=1.0, ~X~0=1.0] [L19] havoc ~x~0; [L20] ~x~0 := #t~nondet0; [L20] havoc #t~nondet0; [L21] assume 0 != (if ~someBinaryFLOATComparisonOperation(~x~0, ~someUnaryFLOAToperation(10.0)) && ~someBinaryFLOATComparisonOperation(~x~0, 10.0) then 1 else 0); [L22] #res := ~x~0; [L50] RET call #t~ret8 := RANDOM_INPUT(); VAL [#NULL!base=0, #NULL!offset=0, ~#E~0!base=7, ~#E~0!offset=0, ~#S~0!base=6, ~#S~0!offset=0, ~INIT~0=0, ~P~0=1.0, ~X~0=1.0] [L50] ~X~0 := #t~ret8; [L50] havoc #t~ret8; [L28-L40] COND FALSE !(0 != ~INIT~0) [L34] FCALL call #t~mem1 := read~real({ base: ~#E~0!base, offset: ~#E~0!offset }, 4); [L35] FCALL call #t~mem2 := read~real({ base: ~#E~0!base, offset: 4 + ~#E~0!offset }, 4); [L36] FCALL call #t~mem3 := read~real({ base: ~#S~0!base, offset: ~#S~0!offset }, 4); [L37] FCALL call #t~mem4 := read~real({ base: ~#S~0!base, offset: 4 + ~#S~0!offset }, 4); [L33-L37] ~P~0 := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(0.4677826, ~X~0), ~someBinaryArithmeticFLOAToperation(#t~mem1, 0.7700725)), ~someBinaryArithmeticFLOAToperation(#t~mem2, 0.4344376)), ~someBinaryArithmeticFLOAToperation(#t~mem3, 1.5419)), ~someBinaryArithmeticFLOAToperation(#t~mem4, 0.6740477)); [L35] havoc #t~mem2; [L37] havoc #t~mem4; [L36] havoc #t~mem3; [L34] havoc #t~mem1; [L9] ~cond := #in~cond; VAL [#NULL!base=0, #NULL!offset=0, ~#E~0!base=7, ~#E~0!offset=0, ~#S~0!base=6, ~#S~0!offset=0, ~INIT~0=0, ~X~0=12.0] [L9] COND TRUE 0 == ~cond VAL [#NULL!base=0, #NULL!offset=0, ~#E~0!base=7, ~#E~0!offset=0, ~#S~0!base=6, ~#S~0!offset=0, ~INIT~0=0, ~X~0=12.0] [L9] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#E~0!base=7, ~#E~0!offset=0, ~#S~0!base=6, ~#S~0!offset=0, ~INIT~0=0, ~X~0=12.0] [L15] float P, X; [L14] BOOLEAN INIT; [L27] static float E[2], S[2]; [L47] CALL, EXPR RANDOM_INPUT() VAL [E={7:0}, INIT=0, P=0, S={6:0}, X=0] [L19] float x; [L20] x = __VERIFIER_nondet_float() [L22] return x; [L47] RET, EXPR RANDOM_INPUT() VAL [E={7:0}, INIT=0, P=0, S={6:0}, X=0] [L47] X = RANDOM_INPUT() [L48] INIT = TRUE VAL [E={7:0}, INIT=1, P=0, S={6:0}, X=11] [L49] COND TRUE \read(TRUE) VAL [E={7:0}, INIT=1, P=0, S={6:0}, X=11] [L50] CALL, EXPR RANDOM_INPUT() VAL [E={7:0}, INIT=1, P=0, S={6:0}, X=11] [L19] float x; [L20] x = __VERIFIER_nondet_float() [L22] return x; [L50] RET, EXPR RANDOM_INPUT() VAL [E={7:0}, INIT=1, P=0, S={6:0}, X=11] [L50] X = RANDOM_INPUT() [L28] COND TRUE \read(INIT) [L29] S[0] = X [L30] P = X [L31] E[0] = X VAL [E={7:0}, INIT=1, P=1, S={6:0}, X=1] [L41] EXPR E[0] [L41] E[1] = E[0] [L41] E[0] = X [L42] EXPR S[0] [L42] S[1] = S[0] [L42] S[0] = P [L52] INIT = FALSE VAL [E={7:0}, INIT=0, P=1, S={6:0}, X=1] [L49] COND TRUE \read(TRUE) VAL [E={7:0}, INIT=0, P=1, S={6:0}, X=1] [L50] CALL, EXPR RANDOM_INPUT() VAL [E={7:0}, INIT=0, P=1, S={6:0}, X=1] [L19] float x; [L20] x = __VERIFIER_nondet_float() [L22] return x; [L50] RET, EXPR RANDOM_INPUT() VAL [E={7:0}, INIT=0, P=1, S={6:0}, X=1] [L50] X = RANDOM_INPUT() [L28] COND FALSE !(\read(INIT)) [L34] EXPR E[0] [L35] EXPR E[1] [L36] EXPR S[0] [L37] EXPR S[1] [L33-L37] P = (((((0.4677826f * X) - (E[0] * 0.7700725f)) + (E[1] * 0.4344376f)) + (S[0] * 1.5419f)) - (S[1] * 0.6740477f)) [L9] COND TRUE !(cond) VAL [E={7:0}, INIT=0, S={6:0}, X=12] [L9] __VERIFIER_error() VAL [E={7:0}, INIT=0, S={6:0}, X=12] ----- [2018-11-22 22:00:50,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 22.11 10:00:50 ImpRootNode [2018-11-22 22:00:50,431 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-22 22:00:50,431 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 22:00:50,431 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 22:00:50,432 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 22:00:50,432 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:00:50" (3/4) ... [2018-11-22 22:00:50,436 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-22 22:00:50,436 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 22:00:50,436 INFO L168 Benchmark]: Toolchain (without parser) took 940.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 959.2 MB in the beginning and 1.1 GB in the end (delta: -136.6 MB). Peak memory consumption was 11.2 MB. Max. memory is 11.5 GB. [2018-11-22 22:00:50,438 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:00:50,439 INFO L168 Benchmark]: CACSL2BoogieTranslator took 189.84 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 945.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-22 22:00:50,440 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.91 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:00:50,440 INFO L168 Benchmark]: Boogie Preprocessor took 60.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -199.3 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. [2018-11-22 22:00:50,442 INFO L168 Benchmark]: RCFGBuilder took 237.93 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: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2018-11-22 22:00:50,443 INFO L168 Benchmark]: CodeCheck took 417.45 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.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. [2018-11-22 22:00:50,444 INFO L168 Benchmark]: Witness Printer took 4.58 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:00:50,447 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 2 procedures, 20 locations, 1 error locations. UNSAFE Result, 0.3s OverallTime, 2 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 18 SDtfs, 4 SDslu, 4 SDs, 0 SdLazy, 7 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 80 GetRequests, 76 SyntacticMatches, 2 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, 33 NumberOfCodeBlocks, 33 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 12 ConstructedInterpolants, 0 QuantifiedInterpolants, 240 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 2/2 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 - UnprovableResult [Line: 9]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 38, overapproximation of someBinaryArithmeticFLOAToperation at line 33. Possible FailurePath: [L15] float P, X; [L14] BOOLEAN INIT; [L27] static float E[2], S[2]; [L47] CALL, EXPR RANDOM_INPUT() VAL [E={7:0}, INIT=0, P=0, S={6:0}, X=0] [L19] float x; [L20] x = __VERIFIER_nondet_float() [L22] return x; [L47] RET, EXPR RANDOM_INPUT() VAL [E={7:0}, INIT=0, P=0, S={6:0}, X=0] [L47] X = RANDOM_INPUT() [L48] INIT = TRUE VAL [E={7:0}, INIT=1, P=0, S={6:0}, X=11] [L49] COND TRUE \read(TRUE) VAL [E={7:0}, INIT=1, P=0, S={6:0}, X=11] [L50] CALL, EXPR RANDOM_INPUT() VAL [E={7:0}, INIT=1, P=0, S={6:0}, X=11] [L19] float x; [L20] x = __VERIFIER_nondet_float() [L22] return x; [L50] RET, EXPR RANDOM_INPUT() VAL [E={7:0}, INIT=1, P=0, S={6:0}, X=11] [L50] X = RANDOM_INPUT() [L28] COND TRUE \read(INIT) [L29] S[0] = X [L30] P = X [L31] E[0] = X VAL [E={7:0}, INIT=1, P=1, S={6:0}, X=1] [L41] EXPR E[0] [L41] E[1] = E[0] [L41] E[0] = X [L42] EXPR S[0] [L42] S[1] = S[0] [L42] S[0] = P [L52] INIT = FALSE VAL [E={7:0}, INIT=0, P=1, S={6:0}, X=1] [L49] COND TRUE \read(TRUE) VAL [E={7:0}, INIT=0, P=1, S={6:0}, X=1] [L50] CALL, EXPR RANDOM_INPUT() VAL [E={7:0}, INIT=0, P=1, S={6:0}, X=1] [L19] float x; [L20] x = __VERIFIER_nondet_float() [L22] return x; [L50] RET, EXPR RANDOM_INPUT() VAL [E={7:0}, INIT=0, P=1, S={6:0}, X=1] [L50] X = RANDOM_INPUT() [L28] COND FALSE !(\read(INIT)) [L34] EXPR E[0] [L35] EXPR E[1] [L36] EXPR S[0] [L37] EXPR S[1] [L33-L37] P = (((((0.4677826f * X) - (E[0] * 0.7700725f)) + (E[1] * 0.4344376f)) + (S[0] * 1.5419f)) - (S[1] * 0.6740477f)) [L9] COND TRUE !(cond) VAL [E={7:0}, INIT=0, S={6:0}, X=12] [L9] __VERIFIER_error() VAL [E={7:0}, INIT=0, S={6:0}, X=12] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 189.84 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 945.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 26.91 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 60.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -199.3 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 237.93 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: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * CodeCheck took 417.45 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.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. * Witness Printer took 4.58 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-aa41828 [2018-11-22 22:00:52,019 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 22:00:52,020 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 22:00:52,029 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 22:00:52,030 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 22:00:52,030 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 22:00:52,031 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 22:00:52,033 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 22:00:52,034 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 22:00:52,035 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 22:00:52,035 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 22:00:52,036 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 22:00:52,036 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 22:00:52,037 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 22:00:52,038 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 22:00:52,039 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 22:00:52,039 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 22:00:52,041 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 22:00:52,042 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 22:00:52,043 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 22:00:52,044 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 22:00:52,045 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 22:00:52,047 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 22:00:52,047 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 22:00:52,047 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 22:00:52,048 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 22:00:52,049 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 22:00:52,049 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 22:00:52,050 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 22:00:52,051 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 22:00:52,051 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 22:00:52,052 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 22:00:52,052 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 22:00:52,052 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 22:00:52,053 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 22:00:52,053 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 22:00:52,053 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_26be49fb-beb5-4306-91f5-9229b69f249f/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Bitvector.epf [2018-11-22 22:00:52,065 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 22:00:52,066 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 22:00:52,066 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-22 22:00:52,067 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-22 22:00:52,067 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-22 22:00:52,067 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-22 22:00:52,068 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 22:00:52,068 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-22 22:00:52,068 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-22 22:00:52,068 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 22:00:52,068 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-22 22:00:52,068 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-22 22:00:52,069 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-22 22:00:52,069 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-22 22:00:52,069 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-22 22:00:52,069 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-22 22:00:52,069 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 22:00:52,069 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 22:00:52,069 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-22 22:00:52,070 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-22 22:00:52,070 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-22 22:00:52,070 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 22:00:52,070 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-22 22:00:52,070 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-22 22:00:52,071 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 22:00:52,071 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-22 22:00:52,071 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-22 22:00:52,071 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-11-22 22:00:52,071 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-22 22:00:52,071 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-22 22:00:52,071 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-22 22:00:52,072 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-22 22:00:52,072 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_26be49fb-beb5-4306-91f5-9229b69f249f/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 -> 465c54123bfeac60a151011e84f1bb917bb3cc8d [2018-11-22 22:00:52,106 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 22:00:52,117 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 22:00:52,121 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 22:00:52,122 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 22:00:52,122 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 22:00:52,123 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_26be49fb-beb5-4306-91f5-9229b69f249f/bin-2019/ukojak/../../sv-benchmarks/c/float-benchs/filter2_alt_true-unreach-call.c [2018-11-22 22:00:52,168 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_26be49fb-beb5-4306-91f5-9229b69f249f/bin-2019/ukojak/data/d68873397/2b220294325d4f358a160c5b85fdab17/FLAG151475d4f [2018-11-22 22:00:52,518 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 22:00:52,518 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_26be49fb-beb5-4306-91f5-9229b69f249f/sv-benchmarks/c/float-benchs/filter2_alt_true-unreach-call.c [2018-11-22 22:00:52,523 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_26be49fb-beb5-4306-91f5-9229b69f249f/bin-2019/ukojak/data/d68873397/2b220294325d4f358a160c5b85fdab17/FLAG151475d4f [2018-11-22 22:00:52,937 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_26be49fb-beb5-4306-91f5-9229b69f249f/bin-2019/ukojak/data/d68873397/2b220294325d4f358a160c5b85fdab17 [2018-11-22 22:00:52,940 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 22:00:52,942 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 22:00:52,942 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 22:00:52,943 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 22:00:52,946 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 22:00:52,947 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:00:52" (1/1) ... [2018-11-22 22:00:52,950 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fef1eaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:00:52, skipping insertion in model container [2018-11-22 22:00:52,950 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:00:52" (1/1) ... [2018-11-22 22:00:52,958 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 22:00:52,975 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 22:00:53,113 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 22:00:53,120 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 22:00:53,141 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 22:00:53,161 INFO L195 MainTranslator]: Completed translation [2018-11-22 22:00:53,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:00:53 WrapperNode [2018-11-22 22:00:53,161 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 22:00:53,162 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 22:00:53,162 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 22:00:53,162 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 22:00:53,168 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:00:53" (1/1) ... [2018-11-22 22:00:53,175 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:00:53" (1/1) ... [2018-11-22 22:00:53,190 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 22:00:53,191 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 22:00:53,191 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 22:00:53,191 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 22:00:53,198 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:00:53" (1/1) ... [2018-11-22 22:00:53,198 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:00:53" (1/1) ... [2018-11-22 22:00:53,200 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:00:53" (1/1) ... [2018-11-22 22:00:53,200 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:00:53" (1/1) ... [2018-11-22 22:00:53,207 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:00:53" (1/1) ... [2018-11-22 22:00:53,210 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:00:53" (1/1) ... [2018-11-22 22:00:53,211 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:00:53" (1/1) ... [2018-11-22 22:00:53,213 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 22:00:53,213 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 22:00:53,213 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 22:00:53,214 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 22:00:53,214 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:00:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_26be49fb-beb5-4306-91f5-9229b69f249f/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-22 22:00:53,308 INFO L130 BoogieDeclarations]: Found specification of procedure RANDOM_INPUT [2018-11-22 22:00:53,308 INFO L138 BoogieDeclarations]: Found implementation of procedure RANDOM_INPUT [2018-11-22 22:00:53,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2018-11-22 22:00:53,308 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2018-11-22 22:00:53,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-22 22:00:53,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 22:00:53,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 22:00:53,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2018-11-22 22:00:53,455 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-22 22:00:53,495 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-22 22:01:03,623 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 22:01:03,623 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-11-22 22:01:03,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:01:03 BoogieIcfgContainer [2018-11-22 22:01:03,624 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 22:01:03,624 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-22 22:01:03,624 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-22 22:01:03,633 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-22 22:01:03,633 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:01:03" (1/1) ... [2018-11-22 22:01:03,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:01:03,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-22 22:01:03,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 14 states and 17 transitions. [2018-11-22 22:01:03,672 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2018-11-22 22:01:03,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-22 22:01:03,677 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-22 22:01:03,707 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck has thrown an exception: java.lang.IllegalArgumentException: Indexed Sort BitVec undefined at de.uni_freiburg.informatik.ultimate.logic.SortSymbol.checkArity(SortSymbol.java:153) at de.uni_freiburg.informatik.ultimate.logic.SortSymbol.getSort(SortSymbol.java:177) at de.uni_freiburg.informatik.ultimate.logic.Theory.getSort(Theory.java:1243) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.sort(NoopScript.java:287) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.TermTransferrer.transferSort(TermTransferrer.java:128) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.TermTransferrer.convertApplicationTerm(TermTransferrer.java:162) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$BuildApplicationTerm.walk(TermTransformer.java:320) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:253) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.cfg.SmtSymbols.transferSymbols(SmtSymbols.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.CodeCheckObserver.process(CodeCheckObserver.java:449) at de.uni_freiburg.informatik.ultimate.core.coreplugin.modelwalker.CFGWalker.runObserver(CFGWalker.java:57) at de.uni_freiburg.informatik.ultimate.core.coreplugin.modelwalker.BaseWalker.runObserver(BaseWalker.java:93) at de.uni_freiburg.informatik.ultimate.core.coreplugin.modelwalker.BaseWalker.run(BaseWalker.java:86) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-22 22:01:03,710 INFO L168 Benchmark]: Toolchain (without parser) took 10769.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 953.2 MB in the beginning and 1.1 GB in the end (delta: -146.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:01:03,712 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:01:03,712 INFO L168 Benchmark]: CACSL2BoogieTranslator took 219.00 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 937.1 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-22 22:01:03,713 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.54 ms. Allocated memory is still 1.0 GB. Free memory is still 937.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:01:03,713 INFO L168 Benchmark]: Boogie Preprocessor took 22.52 ms. Allocated memory is still 1.0 GB. Free memory is still 937.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:01:03,716 INFO L168 Benchmark]: RCFGBuilder took 10410.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -168.9 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-11-22 22:01:03,717 INFO L168 Benchmark]: CodeCheck took 85.37 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2018-11-22 22:01:03,719 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - ExceptionOrErrorResult: IllegalArgumentException: Indexed Sort BitVec undefined de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: IllegalArgumentException: Indexed Sort BitVec undefined: de.uni_freiburg.informatik.ultimate.logic.SortSymbol.checkArity(SortSymbol.java:153) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 219.00 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 937.1 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.54 ms. Allocated memory is still 1.0 GB. Free memory is still 937.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.52 ms. Allocated memory is still 1.0 GB. Free memory is still 937.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 10410.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -168.9 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * CodeCheck took 85.37 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...