./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/float_req_bl_1250_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_02295bed-37c5-4c02-ad02-c179ac314ede/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_02295bed-37c5-4c02-ad02-c179ac314ede/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_02295bed-37c5-4c02-ad02-c179ac314ede/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_02295bed-37c5-4c02-ad02-c179ac314ede/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1250_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_02295bed-37c5-4c02-ad02-c179ac314ede/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_02295bed-37c5-4c02-ad02-c179ac314ede/bin-2019/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7aa9ac80ed7bb9ce6b78459a496e265402ed9cc3 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_02295bed-37c5-4c02-ad02-c179ac314ede/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_02295bed-37c5-4c02-ad02-c179ac314ede/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_02295bed-37c5-4c02-ad02-c179ac314ede/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_02295bed-37c5-4c02-ad02-c179ac314ede/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1250_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_02295bed-37c5-4c02-ad02-c179ac314ede/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_02295bed-37c5-4c02-ad02-c179ac314ede/bin-2019/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7aa9ac80ed7bb9ce6b78459a496e265402ed9cc3 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 09:43:15,729 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 09:43:15,730 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 09:43:15,739 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 09:43:15,739 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 09:43:15,740 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 09:43:15,741 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 09:43:15,742 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 09:43:15,743 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 09:43:15,743 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 09:43:15,744 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 09:43:15,744 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 09:43:15,745 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 09:43:15,745 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 09:43:15,746 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 09:43:15,747 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 09:43:15,747 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 09:43:15,748 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 09:43:15,750 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 09:43:15,751 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 09:43:15,752 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 09:43:15,752 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 09:43:15,754 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 09:43:15,754 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 09:43:15,754 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 09:43:15,755 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 09:43:15,755 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 09:43:15,756 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 09:43:15,757 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 09:43:15,757 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 09:43:15,757 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 09:43:15,758 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 09:43:15,758 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 09:43:15,758 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 09:43:15,759 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 09:43:15,759 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 09:43:15,759 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_02295bed-37c5-4c02-ad02-c179ac314ede/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 09:43:15,770 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 09:43:15,770 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 09:43:15,770 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 09:43:15,771 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 09:43:15,771 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 09:43:15,771 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 09:43:15,771 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 09:43:15,772 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 09:43:15,772 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 09:43:15,772 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 09:43:15,772 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 09:43:15,772 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 09:43:15,772 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 09:43:15,772 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 09:43:15,772 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 09:43:15,773 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 09:43:15,773 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 09:43:15,773 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 09:43:15,773 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 09:43:15,773 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 09:43:15,773 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 09:43:15,773 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 09:43:15,774 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 09:43:15,774 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 09:43:15,774 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 09:43:15,774 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 09:43:15,774 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 09:43:15,774 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 09:43:15,775 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 09:43:15,775 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 09:43:15,775 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_02295bed-37c5-4c02-ad02-c179ac314ede/bin-2019/uautomizer 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 -> Automizer 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 -> 7aa9ac80ed7bb9ce6b78459a496e265402ed9cc3 [2018-11-23 09:43:15,799 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 09:43:15,807 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 09:43:15,810 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 09:43:15,811 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 09:43:15,811 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 09:43:15,812 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_02295bed-37c5-4c02-ad02-c179ac314ede/bin-2019/uautomizer/../../sv-benchmarks/c/float-newlib/float_req_bl_1250_true-unreach-call.c [2018-11-23 09:43:15,853 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_02295bed-37c5-4c02-ad02-c179ac314ede/bin-2019/uautomizer/data/536f8019e/0291e59c36674aac9eb7a4ffda855393/FLAG92c42ae90 [2018-11-23 09:43:16,212 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 09:43:16,212 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_02295bed-37c5-4c02-ad02-c179ac314ede/sv-benchmarks/c/float-newlib/float_req_bl_1250_true-unreach-call.c [2018-11-23 09:43:16,217 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_02295bed-37c5-4c02-ad02-c179ac314ede/bin-2019/uautomizer/data/536f8019e/0291e59c36674aac9eb7a4ffda855393/FLAG92c42ae90 [2018-11-23 09:43:16,227 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_02295bed-37c5-4c02-ad02-c179ac314ede/bin-2019/uautomizer/data/536f8019e/0291e59c36674aac9eb7a4ffda855393 [2018-11-23 09:43:16,229 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 09:43:16,230 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 09:43:16,230 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 09:43:16,230 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 09:43:16,233 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 09:43:16,234 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:43:16" (1/1) ... [2018-11-23 09:43:16,236 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3436f9d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:16, skipping insertion in model container [2018-11-23 09:43:16,236 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:43:16" (1/1) ... [2018-11-23 09:43:16,242 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 09:43:16,257 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 09:43:16,376 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 09:43:16,378 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 09:43:16,393 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 09:43:16,407 INFO L195 MainTranslator]: Completed translation [2018-11-23 09:43:16,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:16 WrapperNode [2018-11-23 09:43:16,407 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 09:43:16,407 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 09:43:16,407 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 09:43:16,407 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 09:43:16,412 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:16" (1/1) ... [2018-11-23 09:43:16,419 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:16" (1/1) ... [2018-11-23 09:43:16,423 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 09:43:16,424 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 09:43:16,424 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 09:43:16,424 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 09:43:16,468 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:16" (1/1) ... [2018-11-23 09:43:16,468 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:16" (1/1) ... [2018-11-23 09:43:16,470 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:16" (1/1) ... [2018-11-23 09:43:16,470 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:16" (1/1) ... [2018-11-23 09:43:16,478 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:16" (1/1) ... [2018-11-23 09:43:16,482 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:16" (1/1) ... [2018-11-23 09:43:16,483 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:16" (1/1) ... [2018-11-23 09:43:16,485 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 09:43:16,485 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 09:43:16,486 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 09:43:16,486 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 09:43:16,487 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_02295bed-37c5-4c02-ad02-c179ac314ede/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 09:43:16,532 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_float [2018-11-23 09:43:16,532 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_float [2018-11-23 09:43:16,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 09:43:16,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 09:43:16,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-23 09:43:16,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 09:43:16,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 09:43:16,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 09:43:16,533 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 09:43:16,533 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 09:43:16,533 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 09:43:16,533 INFO L130 BoogieDeclarations]: Found specification of procedure fmax_float [2018-11-23 09:43:16,533 INFO L138 BoogieDeclarations]: Found implementation of procedure fmax_float [2018-11-23 09:43:16,533 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2018-11-23 09:43:16,533 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2018-11-23 09:43:16,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 09:43:16,713 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 09:43:16,713 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 09:43:16,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:43:16 BoogieIcfgContainer [2018-11-23 09:43:16,714 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 09:43:16,715 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 09:43:16,715 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 09:43:16,717 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 09:43:16,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:43:16" (1/3) ... [2018-11-23 09:43:16,718 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29a606b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:43:16, skipping insertion in model container [2018-11-23 09:43:16,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:16" (2/3) ... [2018-11-23 09:43:16,718 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29a606b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:43:16, skipping insertion in model container [2018-11-23 09:43:16,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:43:16" (3/3) ... [2018-11-23 09:43:16,720 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1250_true-unreach-call.c [2018-11-23 09:43:16,728 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 09:43:16,734 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 09:43:16,750 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 09:43:16,771 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 09:43:16,772 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 09:43:16,772 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 09:43:16,772 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 09:43:16,772 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 09:43:16,772 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 09:43:16,773 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 09:43:16,773 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 09:43:16,773 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 09:43:16,786 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-11-23 09:43:16,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 09:43:16,791 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:43:16,792 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:43:16,793 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:43:16,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:43:16,797 INFO L82 PathProgramCache]: Analyzing trace with hash -2093385797, now seen corresponding path program 1 times [2018-11-23 09:43:16,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:43:16,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:43:16,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:43:16,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:43:16,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:43:16,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:43:16,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:43:16,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:43:16,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 09:43:16,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 09:43:16,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 09:43:16,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 09:43:16,907 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 2 states. [2018-11-23 09:43:16,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:43:16,922 INFO L93 Difference]: Finished difference Result 71 states and 92 transitions. [2018-11-23 09:43:16,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 09:43:16,923 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 26 [2018-11-23 09:43:16,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:43:16,929 INFO L225 Difference]: With dead ends: 71 [2018-11-23 09:43:16,929 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 09:43:16,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 09:43:16,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 09:43:16,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-23 09:43:16,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 09:43:16,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2018-11-23 09:43:16,957 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 26 [2018-11-23 09:43:16,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:43:16,957 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2018-11-23 09:43:16,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 09:43:16,958 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2018-11-23 09:43:16,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 09:43:16,959 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:43:16,959 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:43:16,960 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:43:16,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:43:16,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1590914468, now seen corresponding path program 1 times [2018-11-23 09:43:16,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:43:16,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:43:16,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:43:16,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:43:16,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:43:16,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:43:17,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:43:17,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:43:17,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 09:43:17,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 09:43:17,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 09:43:17,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 09:43:17,037 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand 4 states. [2018-11-23 09:43:17,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:43:17,059 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2018-11-23 09:43:17,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 09:43:17,059 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-11-23 09:43:17,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:43:17,061 INFO L225 Difference]: With dead ends: 51 [2018-11-23 09:43:17,061 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 09:43:17,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 09:43:17,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 09:43:17,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-23 09:43:17,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 09:43:17,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2018-11-23 09:43:17,068 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 27 [2018-11-23 09:43:17,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:43:17,068 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2018-11-23 09:43:17,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 09:43:17,069 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2018-11-23 09:43:17,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 09:43:17,069 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:43:17,070 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:43:17,070 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:43:17,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:43:17,070 INFO L82 PathProgramCache]: Analyzing trace with hash 87255330, now seen corresponding path program 1 times [2018-11-23 09:43:17,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:43:17,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:43:17,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:43:17,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:43:17,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:43:17,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:43:17,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:43:17,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:43:17,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 09:43:17,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 09:43:17,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 09:43:17,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 09:43:17,124 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 4 states. [2018-11-23 09:43:17,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:43:17,150 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2018-11-23 09:43:17,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 09:43:17,151 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-11-23 09:43:17,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:43:17,152 INFO L225 Difference]: With dead ends: 55 [2018-11-23 09:43:17,152 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 09:43:17,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 09:43:17,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 09:43:17,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2018-11-23 09:43:17,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 09:43:17,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2018-11-23 09:43:17,158 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 30 [2018-11-23 09:43:17,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:43:17,158 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2018-11-23 09:43:17,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 09:43:17,158 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2018-11-23 09:43:17,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 09:43:17,159 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:43:17,159 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:43:17,159 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:43:17,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:43:17,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1594807139, now seen corresponding path program 1 times [2018-11-23 09:43:17,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 09:43:17,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 09:43:17,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:43:17,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:43:17,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:43:17,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:43:17,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:43:17,205 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=2139095048, |#NULL.offset|=2139095043, |old(#NULL.base)|=2139095048, |old(#NULL.offset)|=2139095043] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=2139095048, |old(#NULL.offset)|=2139095043] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=2139095048, |old(#NULL.offset)|=2139095043] [?] RET #71#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret7 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] ~x~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0);~y~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret5 := fmax_float(~x~0, ~y~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |fmax_float_#in~x|=2139095045.0, |fmax_float_#in~y|=2139095042.0] [?] ~x := #in~x;~y := #in~y; VAL [fmax_float_~x=2139095045.0, fmax_float_~y=2139095042.0, |#NULL.base|=0, |#NULL.offset|=0, |fmax_float_#in~x|=2139095045.0, |fmax_float_#in~y|=2139095042.0] [?] CALL call #t~ret2 := __fpclassify_float(~x); VAL [|#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_float_#in~x|=2139095045.0] [?] ~x := #in~x;havoc ~w~0; VAL [__fpclassify_float_~x=2139095045.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_float_#in~x|=2139095045.0] [?] call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.alloc(4);call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4);call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4);~w~0 := #t~mem0;call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4);havoc #t~union1;havoc #t~mem0;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; VAL [__fpclassify_float_~w~0=2139095041, __fpclassify_float_~x=2139095045.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_float_#in~x|=2139095045.0] [?] goto; VAL [__fpclassify_float_~w~0=2139095041, __fpclassify_float_~x=2139095045.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_float_#in~x|=2139095045.0] [?] assume !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296); VAL [__fpclassify_float_~w~0=2139095041, __fpclassify_float_~x=2139095045.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_float_#in~x|=2139095045.0] [?] assume !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)); VAL [__fpclassify_float_~w~0=2139095041, __fpclassify_float_~x=2139095045.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_float_#in~x|=2139095045.0] [?] assume !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)); VAL [__fpclassify_float_~w~0=2139095041, __fpclassify_float_~x=2139095045.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_float_#in~x|=2139095045.0] [?] assume !(2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296);#res := 0; VAL [__fpclassify_float_~w~0=2139095041, __fpclassify_float_~x=2139095045.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_float_#in~x|=2139095045.0, |__fpclassify_float_#res|=0] [?] assume true; VAL [__fpclassify_float_~w~0=2139095041, __fpclassify_float_~x=2139095045.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_float_#in~x|=2139095045.0, |__fpclassify_float_#res|=0] [?] RET #79#return; VAL [fmax_float_~x=2139095045.0, fmax_float_~y=2139095042.0, |#NULL.base|=0, |#NULL.offset|=0, |fmax_float_#in~x|=2139095045.0, |fmax_float_#in~y|=2139095042.0, |fmax_float_#t~ret2|=0] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fmax_float_~x=2139095045.0, fmax_float_~y=2139095042.0, |#NULL.base|=0, |#NULL.offset|=0, |fmax_float_#in~x|=2139095045.0, |fmax_float_#in~y|=2139095042.0, |fmax_float_#t~ret2|=0] [?] assume 0 == #t~ret2;havoc #t~ret2;#res := ~y; VAL [fmax_float_~x=2139095045.0, fmax_float_~y=2139095042.0, |#NULL.base|=0, |#NULL.offset|=0, |fmax_float_#in~x|=2139095045.0, |fmax_float_#in~y|=2139095042.0, |fmax_float_#res|=2139095042.0] [?] assume true; VAL [fmax_float_~x=2139095045.0, fmax_float_~y=2139095042.0, |#NULL.base|=0, |#NULL.offset|=0, |fmax_float_#in~x|=2139095045.0, |fmax_float_#in~y|=2139095042.0, |fmax_float_#res|=2139095042.0] [?] RET #75#return; VAL [main_~x~0=2139095045.0, main_~y~0=2139095042.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret5|=2139095042.0] [?] ~res~0 := #t~ret5;havoc #t~ret5; VAL [main_~res~0=2139095042.0, main_~x~0=2139095045.0, main_~y~0=2139095042.0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret6 := isnan_float(~res~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |isnan_float_#in~x|=2139095042.0] [?] ~x := #in~x;#res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [isnan_float_~x=2139095042.0, |#NULL.base|=0, |#NULL.offset|=0, |isnan_float_#in~x|=2139095042.0, |isnan_float_#res|=0] [?] assume true; VAL [isnan_float_~x=2139095042.0, |#NULL.base|=0, |#NULL.offset|=0, |isnan_float_#in~x|=2139095042.0, |isnan_float_#res|=0] [?] RET #77#return; VAL [main_~res~0=2139095042.0, main_~x~0=2139095045.0, main_~y~0=2139095042.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret6|=0] [?] assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; VAL [main_~res~0=2139095042.0, main_~x~0=2139095045.0, main_~y~0=2139095042.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret6|=0] [?] assume 0 == #t~ret6;havoc #t~ret6; VAL [main_~res~0=2139095042.0, main_~x~0=2139095045.0, main_~y~0=2139095042.0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !false; VAL [main_~res~0=2139095042.0, main_~x~0=2139095045.0, main_~y~0=2139095042.0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=2139095048, #NULL.offset=2139095043, old(#NULL.base)=2139095048, old(#NULL.offset)=2139095043] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=2139095048, old(#NULL.offset)=2139095043] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=2139095048, old(#NULL.offset)=2139095043] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret7 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L60] ~x~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0); [L61] ~y~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0); VAL [#NULL.base=0, #NULL.offset=0] [L62] CALL call #t~ret5 := fmax_float(~x~0, ~y~0); VAL [#in~x=2.139095045E9, #in~y=2.139095042E9, #NULL.base=0, #NULL.offset=0] [L42-L51] ~x := #in~x; [L42-L51] ~y := #in~y; VAL [#in~x=2.139095045E9, #in~y=2.139095042E9, #NULL.base=0, #NULL.offset=0, ~x=2.139095045E9, ~y=2.139095042E9] [L43] CALL call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=2.139095045E9, #NULL.base=0, #NULL.offset=0] [L19-L40] ~x := #in~x; [L20] havoc ~w~0; VAL [#in~x=2.139095045E9, #NULL.base=0, #NULL.offset=0, ~x=2.139095045E9] [L23] call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.alloc(4); [L24] call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4); [L25] call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4); [L25] ~w~0 := #t~mem0; [L25] call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4); [L25] havoc #t~union1; [L25] havoc #t~mem0; [L23] call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset); [L23] havoc ~#gf_u~0.base, ~#gf_u~0.offset; VAL [#in~x=2.139095045E9, #NULL.base=0, #NULL.offset=0, ~w~0=2139095041, ~x=2.139095045E9] [L28-L39] assume !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296); VAL [#in~x=2.139095045E9, #NULL.base=0, #NULL.offset=0, ~w~0=2139095041, ~x=2.139095045E9] [L30-L39] assume !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)); VAL [#in~x=2.139095045E9, #NULL.base=0, #NULL.offset=0, ~w~0=2139095041, ~x=2.139095045E9] [L33-L39] assume !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)); VAL [#in~x=2.139095045E9, #NULL.base=0, #NULL.offset=0, ~w~0=2139095041, ~x=2.139095045E9] [L36-L39] assume !(2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296); [L39] #res := 0; VAL [#in~x=2.139095045E9, #NULL.base=0, #NULL.offset=0, #res=0, ~w~0=2139095041, ~x=2.139095045E9] [L19-L40] ensures true; VAL [#in~x=2.139095045E9, #NULL.base=0, #NULL.offset=0, #res=0, ~w~0=2139095041, ~x=2.139095045E9] [L43] RET call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=2.139095045E9, #in~y=2.139095042E9, #NULL.base=0, #NULL.offset=0, #t~ret2=0, ~x=2.139095045E9, ~y=2.139095042E9] [L43] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~x=2.139095045E9, #in~y=2.139095042E9, #NULL.base=0, #NULL.offset=0, #t~ret2=0, ~x=2.139095045E9, ~y=2.139095042E9] [L43-L45] assume 0 == #t~ret2; [L43] havoc #t~ret2; [L44] #res := ~y; VAL [#in~x=2.139095045E9, #in~y=2.139095042E9, #NULL.base=0, #NULL.offset=0, #res=2.139095042E9, ~x=2.139095045E9, ~y=2.139095042E9] [L42-L51] ensures true; VAL [#in~x=2.139095045E9, #in~y=2.139095042E9, #NULL.base=0, #NULL.offset=0, #res=2.139095042E9, ~x=2.139095045E9, ~y=2.139095042E9] [L62] RET call #t~ret5 := fmax_float(~x~0, ~y~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret5=2.139095042E9, ~x~0=2.139095045E9, ~y~0=2.139095042E9] [L62] ~res~0 := #t~ret5; [L62] havoc #t~ret5; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=2.139095042E9, ~x~0=2.139095045E9, ~y~0=2.139095042E9] [L64] CALL call #t~ret6 := isnan_float(~res~0); VAL [#in~x=2.139095042E9, #NULL.base=0, #NULL.offset=0] [L54] ~x := #in~x; [L54] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095042E9, #NULL.base=0, #NULL.offset=0, #res=0, ~x=2.139095042E9] [L54] ensures true; VAL [#in~x=2.139095042E9, #NULL.base=0, #NULL.offset=0, #res=0, ~x=2.139095042E9] [L64] RET call #t~ret6 := isnan_float(~res~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret6=0, ~res~0=2.139095042E9, ~x~0=2.139095045E9, ~y~0=2.139095042E9] [L64] assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret6=0, ~res~0=2.139095042E9, ~x~0=2.139095045E9, ~y~0=2.139095042E9] [L64-L67] assume 0 == #t~ret6; [L64] havoc #t~ret6; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=2.139095042E9, ~x~0=2.139095045E9, ~y~0=2.139095042E9] [L65] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=2.139095042E9, ~x~0=2.139095045E9, ~y~0=2.139095042E9] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=2139095048, #NULL.offset=2139095043, old(#NULL.base)=2139095048, old(#NULL.offset)=2139095043] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=2139095048, old(#NULL.offset)=2139095043] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=2139095048, old(#NULL.offset)=2139095043] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret7 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L60] ~x~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0); [L61] ~y~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0); VAL [#NULL.base=0, #NULL.offset=0] [L62] CALL call #t~ret5 := fmax_float(~x~0, ~y~0); VAL [#in~x=2.139095045E9, #in~y=2.139095042E9, #NULL.base=0, #NULL.offset=0] [L42-L51] ~x := #in~x; [L42-L51] ~y := #in~y; VAL [#in~x=2.139095045E9, #in~y=2.139095042E9, #NULL.base=0, #NULL.offset=0, ~x=2.139095045E9, ~y=2.139095042E9] [L43] CALL call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=2.139095045E9, #NULL.base=0, #NULL.offset=0] [L19-L40] ~x := #in~x; [L20] havoc ~w~0; VAL [#in~x=2.139095045E9, #NULL.base=0, #NULL.offset=0, ~x=2.139095045E9] [L23] call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.alloc(4); [L24] call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4); [L25] call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4); [L25] ~w~0 := #t~mem0; [L25] call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4); [L25] havoc #t~union1; [L25] havoc #t~mem0; [L23] call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset); [L23] havoc ~#gf_u~0.base, ~#gf_u~0.offset; VAL [#in~x=2.139095045E9, #NULL.base=0, #NULL.offset=0, ~w~0=2139095041, ~x=2.139095045E9] [L28-L39] assume !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296); VAL [#in~x=2.139095045E9, #NULL.base=0, #NULL.offset=0, ~w~0=2139095041, ~x=2.139095045E9] [L30-L39] assume !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)); VAL [#in~x=2.139095045E9, #NULL.base=0, #NULL.offset=0, ~w~0=2139095041, ~x=2.139095045E9] [L33-L39] assume !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)); VAL [#in~x=2.139095045E9, #NULL.base=0, #NULL.offset=0, ~w~0=2139095041, ~x=2.139095045E9] [L36-L39] assume !(2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296); [L39] #res := 0; VAL [#in~x=2.139095045E9, #NULL.base=0, #NULL.offset=0, #res=0, ~w~0=2139095041, ~x=2.139095045E9] [L19-L40] ensures true; VAL [#in~x=2.139095045E9, #NULL.base=0, #NULL.offset=0, #res=0, ~w~0=2139095041, ~x=2.139095045E9] [L43] RET call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=2.139095045E9, #in~y=2.139095042E9, #NULL.base=0, #NULL.offset=0, #t~ret2=0, ~x=2.139095045E9, ~y=2.139095042E9] [L43] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~x=2.139095045E9, #in~y=2.139095042E9, #NULL.base=0, #NULL.offset=0, #t~ret2=0, ~x=2.139095045E9, ~y=2.139095042E9] [L43-L45] assume 0 == #t~ret2; [L43] havoc #t~ret2; [L44] #res := ~y; VAL [#in~x=2.139095045E9, #in~y=2.139095042E9, #NULL.base=0, #NULL.offset=0, #res=2.139095042E9, ~x=2.139095045E9, ~y=2.139095042E9] [L42-L51] ensures true; VAL [#in~x=2.139095045E9, #in~y=2.139095042E9, #NULL.base=0, #NULL.offset=0, #res=2.139095042E9, ~x=2.139095045E9, ~y=2.139095042E9] [L62] RET call #t~ret5 := fmax_float(~x~0, ~y~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret5=2.139095042E9, ~x~0=2.139095045E9, ~y~0=2.139095042E9] [L62] ~res~0 := #t~ret5; [L62] havoc #t~ret5; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=2.139095042E9, ~x~0=2.139095045E9, ~y~0=2.139095042E9] [L64] CALL call #t~ret6 := isnan_float(~res~0); VAL [#in~x=2.139095042E9, #NULL.base=0, #NULL.offset=0] [L54] ~x := #in~x; [L54] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095042E9, #NULL.base=0, #NULL.offset=0, #res=0, ~x=2.139095042E9] [L54] ensures true; VAL [#in~x=2.139095042E9, #NULL.base=0, #NULL.offset=0, #res=0, ~x=2.139095042E9] [L64] RET call #t~ret6 := isnan_float(~res~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret6=0, ~res~0=2.139095042E9, ~x~0=2.139095045E9, ~y~0=2.139095042E9] [L64] assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret6=0, ~res~0=2.139095042E9, ~x~0=2.139095045E9, ~y~0=2.139095042E9] [L64-L67] assume 0 == #t~ret6; [L64] havoc #t~ret6; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=2.139095042E9, ~x~0=2.139095045E9, ~y~0=2.139095042E9] [L65] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=2.139095042E9, ~x~0=2.139095045E9, ~y~0=2.139095042E9] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=2139095048, #NULL!offset=2139095043, old(#NULL!base)=2139095048, old(#NULL!offset)=2139095043] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=2139095048, old(#NULL!offset)=2139095043] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret7 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L60] ~x~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0); [L61] ~y~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0); VAL [#NULL!base=0, #NULL!offset=0] [L62] CALL call #t~ret5 := fmax_float(~x~0, ~y~0); VAL [#in~x=2.139095045E9, #in~y=2.139095042E9, #NULL!base=0, #NULL!offset=0] [L42-L51] ~x := #in~x; [L42-L51] ~y := #in~y; VAL [#in~x=2.139095045E9, #in~y=2.139095042E9, #NULL!base=0, #NULL!offset=0, ~x=2.139095045E9, ~y=2.139095042E9] [L43] CALL call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=2.139095045E9, #NULL!base=0, #NULL!offset=0] [L19-L40] ~x := #in~x; [L20] havoc ~w~0; VAL [#in~x=2.139095045E9, #NULL!base=0, #NULL!offset=0, ~x=2.139095045E9] [L23] FCALL call ~#gf_u~0 := #Ultimate.alloc(4); [L24] FCALL call write~real(~x, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L25] FCALL call #t~mem0 := read~int({ base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L25] ~w~0 := #t~mem0; [L25] FCALL call write~real(#t~union1, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L25] havoc #t~union1; [L25] havoc #t~mem0; [L23] FCALL call ULTIMATE.dealloc(~#gf_u~0); [L23] havoc ~#gf_u~0; VAL [#in~x=2.139095045E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095045E9] [L28] COND FALSE !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296) VAL [#in~x=2.139095045E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095045E9] [L30-L31] COND FALSE !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)) VAL [#in~x=2.139095045E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095045E9] [L33-L34] COND FALSE !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)) VAL [#in~x=2.139095045E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095045E9] [L36] COND FALSE !(2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296) [L39] #res := 0; VAL [#in~x=2.139095045E9, #NULL!base=0, #NULL!offset=0, #res=0, ~w~0=2139095041, ~x=2.139095045E9] [L43] RET call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=2.139095045E9, #in~y=2.139095042E9, #NULL!base=0, #NULL!offset=0, #t~ret2=0, ~x=2.139095045E9, ~y=2.139095042E9] [L43] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~x=2.139095045E9, #in~y=2.139095042E9, #NULL!base=0, #NULL!offset=0, #t~ret2=0, ~x=2.139095045E9, ~y=2.139095042E9] [L43] COND TRUE 0 == #t~ret2 [L43] havoc #t~ret2; [L44] #res := ~y; VAL [#in~x=2.139095045E9, #in~y=2.139095042E9, #NULL!base=0, #NULL!offset=0, #res=2.139095042E9, ~x=2.139095045E9, ~y=2.139095042E9] [L62] RET call #t~ret5 := fmax_float(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret5=2.139095042E9, ~x~0=2.139095045E9, ~y~0=2.139095042E9] [L62] ~res~0 := #t~ret5; [L62] havoc #t~ret5; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095042E9, ~x~0=2.139095045E9, ~y~0=2.139095042E9] [L64] CALL call #t~ret6 := isnan_float(~res~0); VAL [#in~x=2.139095042E9, #NULL!base=0, #NULL!offset=0] [L54] ~x := #in~x; [L54] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095042E9, #NULL!base=0, #NULL!offset=0, #res=0, ~x=2.139095042E9] [L64] RET call #t~ret6 := isnan_float(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret6=0, ~res~0=2.139095042E9, ~x~0=2.139095045E9, ~y~0=2.139095042E9] [L64] assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret6=0, ~res~0=2.139095042E9, ~x~0=2.139095045E9, ~y~0=2.139095042E9] [L64] COND TRUE 0 == #t~ret6 [L64] havoc #t~ret6; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095042E9, ~x~0=2.139095045E9, ~y~0=2.139095042E9] [L65] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095042E9, ~x~0=2.139095045E9, ~y~0=2.139095042E9] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=2139095048, #NULL!offset=2139095043, old(#NULL!base)=2139095048, old(#NULL!offset)=2139095043] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=2139095048, old(#NULL!offset)=2139095043] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret7 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L60] ~x~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0); [L61] ~y~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0); VAL [#NULL!base=0, #NULL!offset=0] [L62] CALL call #t~ret5 := fmax_float(~x~0, ~y~0); VAL [#in~x=2.139095045E9, #in~y=2.139095042E9, #NULL!base=0, #NULL!offset=0] [L42-L51] ~x := #in~x; [L42-L51] ~y := #in~y; VAL [#in~x=2.139095045E9, #in~y=2.139095042E9, #NULL!base=0, #NULL!offset=0, ~x=2.139095045E9, ~y=2.139095042E9] [L43] CALL call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=2.139095045E9, #NULL!base=0, #NULL!offset=0] [L19-L40] ~x := #in~x; [L20] havoc ~w~0; VAL [#in~x=2.139095045E9, #NULL!base=0, #NULL!offset=0, ~x=2.139095045E9] [L23] FCALL call ~#gf_u~0 := #Ultimate.alloc(4); [L24] FCALL call write~real(~x, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L25] FCALL call #t~mem0 := read~int({ base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L25] ~w~0 := #t~mem0; [L25] FCALL call write~real(#t~union1, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L25] havoc #t~union1; [L25] havoc #t~mem0; [L23] FCALL call ULTIMATE.dealloc(~#gf_u~0); [L23] havoc ~#gf_u~0; VAL [#in~x=2.139095045E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095045E9] [L28] COND FALSE !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296) VAL [#in~x=2.139095045E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095045E9] [L30-L31] COND FALSE !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)) VAL [#in~x=2.139095045E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095045E9] [L33-L34] COND FALSE !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)) VAL [#in~x=2.139095045E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095045E9] [L36] COND FALSE !(2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296) [L39] #res := 0; VAL [#in~x=2.139095045E9, #NULL!base=0, #NULL!offset=0, #res=0, ~w~0=2139095041, ~x=2.139095045E9] [L43] RET call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=2.139095045E9, #in~y=2.139095042E9, #NULL!base=0, #NULL!offset=0, #t~ret2=0, ~x=2.139095045E9, ~y=2.139095042E9] [L43] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~x=2.139095045E9, #in~y=2.139095042E9, #NULL!base=0, #NULL!offset=0, #t~ret2=0, ~x=2.139095045E9, ~y=2.139095042E9] [L43] COND TRUE 0 == #t~ret2 [L43] havoc #t~ret2; [L44] #res := ~y; VAL [#in~x=2.139095045E9, #in~y=2.139095042E9, #NULL!base=0, #NULL!offset=0, #res=2.139095042E9, ~x=2.139095045E9, ~y=2.139095042E9] [L62] RET call #t~ret5 := fmax_float(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret5=2.139095042E9, ~x~0=2.139095045E9, ~y~0=2.139095042E9] [L62] ~res~0 := #t~ret5; [L62] havoc #t~ret5; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095042E9, ~x~0=2.139095045E9, ~y~0=2.139095042E9] [L64] CALL call #t~ret6 := isnan_float(~res~0); VAL [#in~x=2.139095042E9, #NULL!base=0, #NULL!offset=0] [L54] ~x := #in~x; [L54] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095042E9, #NULL!base=0, #NULL!offset=0, #res=0, ~x=2.139095042E9] [L64] RET call #t~ret6 := isnan_float(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret6=0, ~res~0=2.139095042E9, ~x~0=2.139095045E9, ~y~0=2.139095042E9] [L64] assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret6=0, ~res~0=2.139095042E9, ~x~0=2.139095045E9, ~y~0=2.139095042E9] [L64] COND TRUE 0 == #t~ret6 [L64] havoc #t~ret6; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095042E9, ~x~0=2.139095045E9, ~y~0=2.139095042E9] [L65] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095042E9, ~x~0=2.139095045E9, ~y~0=2.139095042E9] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=2139095048, #NULL!offset=2139095043, old(#NULL!base)=2139095048, old(#NULL!offset)=2139095043] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=2139095048, old(#NULL!offset)=2139095043] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret7 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L60] ~x~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0); [L61] ~y~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0); VAL [#NULL!base=0, #NULL!offset=0] [L62] CALL call #t~ret5 := fmax_float(~x~0, ~y~0); VAL [#in~x=2.139095045E9, #in~y=2.139095042E9, #NULL!base=0, #NULL!offset=0] [L42-L51] ~x := #in~x; [L42-L51] ~y := #in~y; VAL [#in~x=2.139095045E9, #in~y=2.139095042E9, #NULL!base=0, #NULL!offset=0, ~x=2.139095045E9, ~y=2.139095042E9] [L43] CALL call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=2.139095045E9, #NULL!base=0, #NULL!offset=0] [L19-L40] ~x := #in~x; [L20] havoc ~w~0; VAL [#in~x=2.139095045E9, #NULL!base=0, #NULL!offset=0, ~x=2.139095045E9] [L23] FCALL call ~#gf_u~0 := #Ultimate.alloc(4); [L24] FCALL call write~real(~x, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L25] FCALL call #t~mem0 := read~int({ base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L25] ~w~0 := #t~mem0; [L25] FCALL call write~real(#t~union1, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L25] havoc #t~union1; [L25] havoc #t~mem0; [L23] FCALL call ULTIMATE.dealloc(~#gf_u~0); [L23] havoc ~#gf_u~0; VAL [#in~x=2.139095045E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095045E9] [L28] COND FALSE !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296) VAL [#in~x=2.139095045E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095045E9] [L30-L31] COND FALSE !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)) VAL [#in~x=2.139095045E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095045E9] [L33-L34] COND FALSE !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)) VAL [#in~x=2.139095045E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095045E9] [L36] COND FALSE !(2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296) [L39] #res := 0; VAL [#in~x=2.139095045E9, #NULL!base=0, #NULL!offset=0, #res=0, ~w~0=2139095041, ~x=2.139095045E9] [L43] RET call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=2.139095045E9, #in~y=2.139095042E9, #NULL!base=0, #NULL!offset=0, #t~ret2=0, ~x=2.139095045E9, ~y=2.139095042E9] [L43] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~x=2.139095045E9, #in~y=2.139095042E9, #NULL!base=0, #NULL!offset=0, #t~ret2=0, ~x=2.139095045E9, ~y=2.139095042E9] [L43] COND TRUE 0 == #t~ret2 [L43] havoc #t~ret2; [L44] #res := ~y; VAL [#in~x=2.139095045E9, #in~y=2.139095042E9, #NULL!base=0, #NULL!offset=0, #res=2.139095042E9, ~x=2.139095045E9, ~y=2.139095042E9] [L62] RET call #t~ret5 := fmax_float(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret5=2.139095042E9, ~x~0=2.139095045E9, ~y~0=2.139095042E9] [L62] ~res~0 := #t~ret5; [L62] havoc #t~ret5; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095042E9, ~x~0=2.139095045E9, ~y~0=2.139095042E9] [L64] CALL call #t~ret6 := isnan_float(~res~0); VAL [#in~x=2.139095042E9, #NULL!base=0, #NULL!offset=0] [L54] ~x := #in~x; [L54] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095042E9, #NULL!base=0, #NULL!offset=0, #res=0, ~x=2.139095042E9] [L64] RET call #t~ret6 := isnan_float(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret6=0, ~res~0=2.139095042E9, ~x~0=2.139095045E9, ~y~0=2.139095042E9] [L64] assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret6=0, ~res~0=2.139095042E9, ~x~0=2.139095045E9, ~y~0=2.139095042E9] [L64] COND TRUE 0 == #t~ret6 [L64] havoc #t~ret6; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095042E9, ~x~0=2.139095045E9, ~y~0=2.139095042E9] [L65] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095042E9, ~x~0=2.139095045E9, ~y~0=2.139095042E9] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=2139095048, #NULL!offset=2139095043, old(#NULL!base)=2139095048, old(#NULL!offset)=2139095043] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=2139095048, old(#NULL!offset)=2139095043] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret7 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L60] ~x~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0); [L61] ~y~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0); VAL [#NULL!base=0, #NULL!offset=0] [L62] CALL call #t~ret5 := fmax_float(~x~0, ~y~0); VAL [#in~x=2.139095045E9, #in~y=2.139095042E9, #NULL!base=0, #NULL!offset=0] [L42-L51] ~x := #in~x; [L42-L51] ~y := #in~y; VAL [#in~x=2.139095045E9, #in~y=2.139095042E9, #NULL!base=0, #NULL!offset=0, ~x=2.139095045E9, ~y=2.139095042E9] [L43] CALL call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=2.139095045E9, #NULL!base=0, #NULL!offset=0] [L19-L40] ~x := #in~x; [L20] havoc ~w~0; VAL [#in~x=2.139095045E9, #NULL!base=0, #NULL!offset=0, ~x=2.139095045E9] [L23] FCALL call ~#gf_u~0 := #Ultimate.alloc(4); [L24] FCALL call write~real(~x, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L25] FCALL call #t~mem0 := read~int({ base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L25] ~w~0 := #t~mem0; [L25] FCALL call write~real(#t~union1, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L25] havoc #t~union1; [L25] havoc #t~mem0; [L23] FCALL call ULTIMATE.dealloc(~#gf_u~0); [L23] havoc ~#gf_u~0; VAL [#in~x=2.139095045E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095045E9] [L28] COND FALSE !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296) VAL [#in~x=2.139095045E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095045E9] [L30-L31] COND FALSE !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)) VAL [#in~x=2.139095045E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095045E9] [L33-L34] COND FALSE !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)) VAL [#in~x=2.139095045E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095045E9] [L36] COND FALSE !(2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296) [L39] #res := 0; VAL [#in~x=2.139095045E9, #NULL!base=0, #NULL!offset=0, #res=0, ~w~0=2139095041, ~x=2.139095045E9] [L43] RET call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=2.139095045E9, #in~y=2.139095042E9, #NULL!base=0, #NULL!offset=0, #t~ret2=0, ~x=2.139095045E9, ~y=2.139095042E9] [L43] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~x=2.139095045E9, #in~y=2.139095042E9, #NULL!base=0, #NULL!offset=0, #t~ret2=0, ~x=2.139095045E9, ~y=2.139095042E9] [L43] COND TRUE 0 == #t~ret2 [L43] havoc #t~ret2; [L44] #res := ~y; VAL [#in~x=2.139095045E9, #in~y=2.139095042E9, #NULL!base=0, #NULL!offset=0, #res=2.139095042E9, ~x=2.139095045E9, ~y=2.139095042E9] [L62] RET call #t~ret5 := fmax_float(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret5=2.139095042E9, ~x~0=2.139095045E9, ~y~0=2.139095042E9] [L62] ~res~0 := #t~ret5; [L62] havoc #t~ret5; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095042E9, ~x~0=2.139095045E9, ~y~0=2.139095042E9] [L64] CALL call #t~ret6 := isnan_float(~res~0); VAL [#in~x=2.139095042E9, #NULL!base=0, #NULL!offset=0] [L54] ~x := #in~x; [L54] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095042E9, #NULL!base=0, #NULL!offset=0, #res=0, ~x=2.139095042E9] [L64] RET call #t~ret6 := isnan_float(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret6=0, ~res~0=2.139095042E9, ~x~0=2.139095045E9, ~y~0=2.139095042E9] [L64] assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret6=0, ~res~0=2.139095042E9, ~x~0=2.139095045E9, ~y~0=2.139095042E9] [L64] COND TRUE 0 == #t~ret6 [L64] havoc #t~ret6; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095042E9, ~x~0=2.139095045E9, ~y~0=2.139095042E9] [L65] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095042E9, ~x~0=2.139095045E9, ~y~0=2.139095042E9] [L60] float x = 0.0f / 0.0f; [L61] float y = 0.0f / 0.0f; [L62] CALL, EXPR fmax_float(x, y) VAL [\old(x)=2139095045, \old(y)=2139095042] [L43] CALL, EXPR __fpclassify_float(x) VAL [\old(x)=2139095045] [L20] __uint32_t w; VAL [\old(x)=2139095045, x=2139095045] [L23] ieee_float_shape_type gf_u; [L24] gf_u.value = (x) [L25] EXPR gf_u.word [L25] (w) = gf_u.word [L28] COND FALSE !(w == 0x00000000 || w == 0x80000000) VAL [\old(x)=2139095045, w=2139095041, x=2139095045] [L30-L31] COND FALSE !((w >= 0x00800000 && w <= 0x7f7fffff) || (w >= 0x80800000 && w <= 0xff7fffff)) VAL [\old(x)=2139095045, w=2139095041, x=2139095045] [L33-L34] COND FALSE !((w >= 0x00000001 && w <= 0x007fffff) || (w >= 0x80000001 && w <= 0x807fffff)) VAL [\old(x)=2139095045, w=2139095041, x=2139095045] [L36] COND FALSE !(w == 0x7f800000 || w == 0xff800000) [L39] return 0; VAL [\old(x)=2139095045, \result=0, w=2139095041, x=2139095045] [L43] RET, EXPR __fpclassify_float(x) VAL [\old(x)=2139095045, \old(y)=2139095042, __fpclassify_float(x)=0, x=2139095045, y=2139095042] [L43] COND TRUE __fpclassify_float(x) == 0 [L44] return y; VAL [\old(x)=2139095045, \old(y)=2139095042, \result=2139095042, x=2139095045, y=2139095042] [L62] RET, EXPR fmax_float(x, y) VAL [fmax_float(x, y)=2139095042, x=2139095045, y=2139095042] [L62] float res = fmax_float(x, y); [L64] CALL, EXPR isnan_float(res) VAL [\old(x)=2139095042] [L54] return x != x; VAL [\old(x)=2139095042, \result=0, x=2139095042] [L64] RET, EXPR isnan_float(res) VAL [isnan_float(res)=0, res=2139095042, x=2139095045, y=2139095042] [L64] COND TRUE !isnan_float(res) [L65] __VERIFIER_error() VAL [res=2139095042, x=2139095045, y=2139095042] ----- [2018-11-23 09:43:17,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 09:43:17 BoogieIcfgContainer [2018-11-23 09:43:17,247 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 09:43:17,247 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 09:43:17,247 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 09:43:17,247 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 09:43:17,248 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:43:16" (3/4) ... [2018-11-23 09:43:17,251 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 09:43:17,251 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 09:43:17,252 INFO L168 Benchmark]: Toolchain (without parser) took 1022.97 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.4 MB). Free memory was 959.3 MB in the beginning and 1.0 GB in the end (delta: -81.1 MB). Peak memory consumption was 35.3 MB. Max. memory is 11.5 GB. [2018-11-23 09:43:17,253 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 09:43:17,254 INFO L168 Benchmark]: CACSL2BoogieTranslator took 177.08 ms. Allocated memory is still 1.0 GB. Free memory was 959.3 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-23 09:43:17,254 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.26 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-23 09:43:17,255 INFO L168 Benchmark]: Boogie Preprocessor took 61.45 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.4 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -168.0 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-23 09:43:17,255 INFO L168 Benchmark]: RCFGBuilder took 228.55 ms. Allocated memory is still 1.1 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-23 09:43:17,256 INFO L168 Benchmark]: TraceAbstraction took 532.33 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 56.5 MB). Peak memory consumption was 56.5 MB. Max. memory is 11.5 GB. [2018-11-23 09:43:17,256 INFO L168 Benchmark]: Witness Printer took 4.29 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 09:43:17,260 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 177.08 ms. Allocated memory is still 1.0 GB. Free memory was 959.3 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 16.26 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 61.45 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.4 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -168.0 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 228.55 ms. Allocated memory is still 1.1 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. * TraceAbstraction took 532.33 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 56.5 MB). Peak memory consumption was 56.5 MB. Max. memory is 11.5 GB. * Witness Printer took 4.29 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 65]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 54, overapproximation of someBinaryArithmeticFLOAToperation at line 60. Possible FailurePath: [L60] float x = 0.0f / 0.0f; [L61] float y = 0.0f / 0.0f; [L62] CALL, EXPR fmax_float(x, y) VAL [\old(x)=2139095045, \old(y)=2139095042] [L43] CALL, EXPR __fpclassify_float(x) VAL [\old(x)=2139095045] [L20] __uint32_t w; VAL [\old(x)=2139095045, x=2139095045] [L23] ieee_float_shape_type gf_u; [L24] gf_u.value = (x) [L25] EXPR gf_u.word [L25] (w) = gf_u.word [L28] COND FALSE !(w == 0x00000000 || w == 0x80000000) VAL [\old(x)=2139095045, w=2139095041, x=2139095045] [L30-L31] COND FALSE !((w >= 0x00800000 && w <= 0x7f7fffff) || (w >= 0x80800000 && w <= 0xff7fffff)) VAL [\old(x)=2139095045, w=2139095041, x=2139095045] [L33-L34] COND FALSE !((w >= 0x00000001 && w <= 0x007fffff) || (w >= 0x80000001 && w <= 0x807fffff)) VAL [\old(x)=2139095045, w=2139095041, x=2139095045] [L36] COND FALSE !(w == 0x7f800000 || w == 0xff800000) [L39] return 0; VAL [\old(x)=2139095045, \result=0, w=2139095041, x=2139095045] [L43] RET, EXPR __fpclassify_float(x) VAL [\old(x)=2139095045, \old(y)=2139095042, __fpclassify_float(x)=0, x=2139095045, y=2139095042] [L43] COND TRUE __fpclassify_float(x) == 0 [L44] return y; VAL [\old(x)=2139095045, \old(y)=2139095042, \result=2139095042, x=2139095045, y=2139095042] [L62] RET, EXPR fmax_float(x, y) VAL [fmax_float(x, y)=2139095042, x=2139095045, y=2139095042] [L62] float res = fmax_float(x, y); [L64] CALL, EXPR isnan_float(res) VAL [\old(x)=2139095042] [L54] return x != x; VAL [\old(x)=2139095042, \result=0, x=2139095042] [L64] RET, EXPR isnan_float(res) VAL [isnan_float(res)=0, res=2139095042, x=2139095045, y=2139095042] [L64] COND TRUE !isnan_float(res) [L65] __VERIFIER_error() VAL [res=2139095042, x=2139095045, y=2139095042] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 40 locations, 1 error locations. UNSAFE Result, 0.4s OverallTime, 4 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 129 SDtfs, 0 SDslu, 152 SDs, 0 SdLazy, 17 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=0, traceCheckStatistics: No data available, 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: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 113 NumberOfCodeBlocks, 113 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 80 ConstructedInterpolants, 0 QuantifiedInterpolants, 2582 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 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-23 09:43:18,662 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 09:43:18,663 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 09:43:18,670 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 09:43:18,671 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 09:43:18,671 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 09:43:18,672 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 09:43:18,673 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 09:43:18,674 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 09:43:18,675 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 09:43:18,675 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 09:43:18,676 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 09:43:18,676 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 09:43:18,677 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 09:43:18,678 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 09:43:18,678 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 09:43:18,679 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 09:43:18,680 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 09:43:18,681 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 09:43:18,682 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 09:43:18,683 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 09:43:18,684 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 09:43:18,685 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 09:43:18,685 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 09:43:18,686 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 09:43:18,686 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 09:43:18,687 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 09:43:18,687 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 09:43:18,688 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 09:43:18,689 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 09:43:18,689 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 09:43:18,689 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 09:43:18,689 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 09:43:18,690 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 09:43:18,690 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 09:43:18,691 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 09:43:18,691 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_02295bed-37c5-4c02-ad02-c179ac314ede/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 09:43:18,701 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 09:43:18,701 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 09:43:18,702 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 09:43:18,702 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 09:43:18,702 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 09:43:18,702 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 09:43:18,703 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 09:43:18,703 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 09:43:18,703 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 09:43:18,703 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 09:43:18,703 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 09:43:18,703 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 09:43:18,703 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 09:43:18,703 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 09:43:18,703 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 09:43:18,703 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 09:43:18,704 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 09:43:18,704 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 09:43:18,704 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 09:43:18,704 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 09:43:18,704 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 09:43:18,704 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 09:43:18,704 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 09:43:18,704 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 09:43:18,705 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 09:43:18,705 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 09:43:18,705 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 09:43:18,705 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 09:43:18,705 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 09:43:18,705 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 09:43:18,705 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 09:43:18,705 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 09:43:18,705 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_02295bed-37c5-4c02-ad02-c179ac314ede/bin-2019/uautomizer 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 -> Automizer 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 -> 7aa9ac80ed7bb9ce6b78459a496e265402ed9cc3 [2018-11-23 09:43:18,732 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 09:43:18,740 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 09:43:18,742 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 09:43:18,743 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 09:43:18,743 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 09:43:18,743 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_02295bed-37c5-4c02-ad02-c179ac314ede/bin-2019/uautomizer/../../sv-benchmarks/c/float-newlib/float_req_bl_1250_true-unreach-call.c [2018-11-23 09:43:18,778 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_02295bed-37c5-4c02-ad02-c179ac314ede/bin-2019/uautomizer/data/73c79ffa9/7a87d2ff8fc446d0b49cb428b7906d5f/FLAG7479bbe17 [2018-11-23 09:43:19,170 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 09:43:19,171 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_02295bed-37c5-4c02-ad02-c179ac314ede/sv-benchmarks/c/float-newlib/float_req_bl_1250_true-unreach-call.c [2018-11-23 09:43:19,175 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_02295bed-37c5-4c02-ad02-c179ac314ede/bin-2019/uautomizer/data/73c79ffa9/7a87d2ff8fc446d0b49cb428b7906d5f/FLAG7479bbe17 [2018-11-23 09:43:19,183 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_02295bed-37c5-4c02-ad02-c179ac314ede/bin-2019/uautomizer/data/73c79ffa9/7a87d2ff8fc446d0b49cb428b7906d5f [2018-11-23 09:43:19,185 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 09:43:19,186 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 09:43:19,187 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 09:43:19,187 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 09:43:19,189 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 09:43:19,190 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:43:19" (1/1) ... [2018-11-23 09:43:19,191 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@567d81a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:19, skipping insertion in model container [2018-11-23 09:43:19,191 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:43:19" (1/1) ... [2018-11-23 09:43:19,198 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 09:43:19,212 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 09:43:19,343 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 09:43:19,347 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 09:43:19,365 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 09:43:19,381 INFO L195 MainTranslator]: Completed translation [2018-11-23 09:43:19,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:19 WrapperNode [2018-11-23 09:43:19,382 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 09:43:19,382 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 09:43:19,382 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 09:43:19,383 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 09:43:19,389 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:19" (1/1) ... [2018-11-23 09:43:19,395 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:19" (1/1) ... [2018-11-23 09:43:19,400 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 09:43:19,401 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 09:43:19,401 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 09:43:19,401 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 09:43:19,406 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:19" (1/1) ... [2018-11-23 09:43:19,406 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:19" (1/1) ... [2018-11-23 09:43:19,408 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:19" (1/1) ... [2018-11-23 09:43:19,408 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:19" (1/1) ... [2018-11-23 09:43:19,414 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:19" (1/1) ... [2018-11-23 09:43:19,418 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:19" (1/1) ... [2018-11-23 09:43:19,420 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:19" (1/1) ... [2018-11-23 09:43:19,422 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 09:43:19,422 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 09:43:19,422 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 09:43:19,422 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 09:43:19,423 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_02295bed-37c5-4c02-ad02-c179ac314ede/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 09:43:19,498 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_float [2018-11-23 09:43:19,498 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_float [2018-11-23 09:43:19,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 09:43:19,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 09:43:19,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 09:43:19,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 09:43:19,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 09:43:19,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 09:43:19,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2018-11-23 09:43:19,499 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 09:43:19,499 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 09:43:19,499 INFO L130 BoogieDeclarations]: Found specification of procedure fmax_float [2018-11-23 09:43:19,499 INFO L138 BoogieDeclarations]: Found implementation of procedure fmax_float [2018-11-23 09:43:19,499 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2018-11-23 09:43:19,499 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2018-11-23 09:43:19,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 09:43:19,638 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 09:43:19,667 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 09:43:19,667 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 09:43:19,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:43:19 BoogieIcfgContainer [2018-11-23 09:43:19,667 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 09:43:19,668 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 09:43:19,668 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 09:43:19,670 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 09:43:19,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:43:19" (1/3) ... [2018-11-23 09:43:19,671 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10a57110 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:43:19, skipping insertion in model container [2018-11-23 09:43:19,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:19" (2/3) ... [2018-11-23 09:43:19,671 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10a57110 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:43:19, skipping insertion in model container [2018-11-23 09:43:19,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:43:19" (3/3) ... [2018-11-23 09:43:19,672 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1250_true-unreach-call.c [2018-11-23 09:43:19,681 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 09:43:19,686 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 09:43:19,698 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 09:43:19,722 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 09:43:19,723 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 09:43:19,723 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 09:43:19,723 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 09:43:19,723 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 09:43:19,723 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 09:43:19,723 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 09:43:19,723 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 09:43:19,723 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 09:43:19,735 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2018-11-23 09:43:19,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 09:43:19,741 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:43:19,741 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:43:19,743 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:43:19,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:43:19,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1373398522, now seen corresponding path program 1 times [2018-11-23 09:43:19,748 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 09:43:19,748 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_02295bed-37c5-4c02-ad02-c179ac314ede/bin-2019/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-11-23 09:43:19,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:43:19,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:43:19,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:43:19,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:43:19,813 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 09:43:19,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:43:19,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 09:43:19,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 09:43:19,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 09:43:19,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 09:43:19,832 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 2 states. [2018-11-23 09:43:19,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:43:19,847 INFO L93 Difference]: Finished difference Result 65 states and 86 transitions. [2018-11-23 09:43:19,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 09:43:19,847 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2018-11-23 09:43:19,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:43:19,855 INFO L225 Difference]: With dead ends: 65 [2018-11-23 09:43:19,855 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 09:43:19,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 09:43:19,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 09:43:19,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-23 09:43:19,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 09:43:19,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2018-11-23 09:43:19,886 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 24 [2018-11-23 09:43:19,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:43:19,886 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2018-11-23 09:43:19,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 09:43:19,886 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2018-11-23 09:43:19,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 09:43:19,888 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:43:19,888 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:43:19,888 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:43:19,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:43:19,889 INFO L82 PathProgramCache]: Analyzing trace with hash 570225154, now seen corresponding path program 1 times [2018-11-23 09:43:19,889 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 09:43:19,889 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_02295bed-37c5-4c02-ad02-c179ac314ede/bin-2019/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-11-23 09:43:19,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:43:19,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:43:19,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:43:19,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:43:19,965 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 09:43:19,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:43:19,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 09:43:19,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 09:43:19,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 09:43:19,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 09:43:19,977 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand 4 states. [2018-11-23 09:43:20,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:43:20,001 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-11-23 09:43:20,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 09:43:20,002 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-11-23 09:43:20,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:43:20,004 INFO L225 Difference]: With dead ends: 46 [2018-11-23 09:43:20,004 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 09:43:20,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 09:43:20,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 09:43:20,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-23 09:43:20,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 09:43:20,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2018-11-23 09:43:20,015 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 25 [2018-11-23 09:43:20,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:43:20,016 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2018-11-23 09:43:20,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 09:43:20,016 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2018-11-23 09:43:20,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 09:43:20,017 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:43:20,017 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:43:20,017 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:43:20,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:43:20,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1732831305, now seen corresponding path program 1 times [2018-11-23 09:43:20,018 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 09:43:20,018 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_02295bed-37c5-4c02-ad02-c179ac314ede/bin-2019/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-11-23 09:43:20,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:43:20,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:43:20,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:43:20,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:43:20,089 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 09:43:20,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:43:20,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 09:43:20,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 09:43:20,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 09:43:20,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 09:43:20,101 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand 4 states. [2018-11-23 09:43:20,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:43:20,119 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2018-11-23 09:43:20,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 09:43:20,120 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-11-23 09:43:20,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:43:20,121 INFO L225 Difference]: With dead ends: 49 [2018-11-23 09:43:20,121 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 09:43:20,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 09:43:20,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 09:43:20,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2018-11-23 09:43:20,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 09:43:20,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2018-11-23 09:43:20,127 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 26 [2018-11-23 09:43:20,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:43:20,127 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2018-11-23 09:43:20,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 09:43:20,128 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2018-11-23 09:43:20,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 09:43:20,128 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:43:20,128 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:43:20,129 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:43:20,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:43:20,129 INFO L82 PathProgramCache]: Analyzing trace with hash -2054695706, now seen corresponding path program 1 times [2018-11-23 09:43:20,129 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 09:43:20,129 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_02295bed-37c5-4c02-ad02-c179ac314ede/bin-2019/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2018-11-23 09:43:20,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:43:20,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:43:20,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:43:20,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:43:20,177 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 09:43:20,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:43:20,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 09:43:20,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 09:43:20,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 09:43:20,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 09:43:20,185 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand 4 states. [2018-11-23 09:43:20,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:43:20,200 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2018-11-23 09:43:20,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 09:43:20,201 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-11-23 09:43:20,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:43:20,201 INFO L225 Difference]: With dead ends: 49 [2018-11-23 09:43:20,202 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 09:43:20,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 09:43:20,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 09:43:20,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2018-11-23 09:43:20,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 09:43:20,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2018-11-23 09:43:20,206 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 27 [2018-11-23 09:43:20,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:43:20,207 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2018-11-23 09:43:20,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 09:43:20,207 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2018-11-23 09:43:20,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 09:43:20,208 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:43:20,208 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:43:20,208 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:43:20,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:43:20,208 INFO L82 PathProgramCache]: Analyzing trace with hash -382560787, now seen corresponding path program 1 times [2018-11-23 09:43:20,209 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 09:43:20,209 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_02295bed-37c5-4c02-ad02-c179ac314ede/bin-2019/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-11-23 09:43:20,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:43:20,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:43:20,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:43:20,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:43:20,268 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 09:43:20,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:43:20,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 09:43:20,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 09:43:20,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 09:43:20,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 09:43:20,280 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand 4 states. [2018-11-23 09:43:20,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:43:20,295 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2018-11-23 09:43:20,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 09:43:20,297 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-11-23 09:43:20,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:43:20,297 INFO L225 Difference]: With dead ends: 49 [2018-11-23 09:43:20,298 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 09:43:20,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 09:43:20,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 09:43:20,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2018-11-23 09:43:20,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 09:43:20,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2018-11-23 09:43:20,303 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 28 [2018-11-23 09:43:20,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:43:20,303 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2018-11-23 09:43:20,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 09:43:20,303 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2018-11-23 09:43:20,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 09:43:20,304 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:43:20,304 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:43:20,304 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:43:20,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:43:20,305 INFO L82 PathProgramCache]: Analyzing trace with hash -675963794, now seen corresponding path program 1 times [2018-11-23 09:43:20,305 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 09:43:20,305 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_02295bed-37c5-4c02-ad02-c179ac314ede/bin-2019/uautomizer/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-11-23 09:43:20,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:43:20,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:43:20,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:43:20,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:43:20,485 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 09:43:20,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:43:20,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 09:43:20,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 09:43:20,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 09:43:20,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 09:43:20,494 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand 9 states. [2018-11-23 09:43:20,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:43:20,765 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2018-11-23 09:43:20,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 09:43:20,766 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-11-23 09:43:20,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:43:20,767 INFO L225 Difference]: With dead ends: 43 [2018-11-23 09:43:20,767 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 09:43:20,767 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-11-23 09:43:20,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 09:43:20,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2018-11-23 09:43:20,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 09:43:20,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2018-11-23 09:43:20,770 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 28 [2018-11-23 09:43:20,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:43:20,770 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2018-11-23 09:43:20,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 09:43:20,771 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2018-11-23 09:43:20,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 09:43:20,771 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:43:20,771 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:43:20,771 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:43:20,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:43:20,772 INFO L82 PathProgramCache]: Analyzing trace with hash 61144778, now seen corresponding path program 1 times [2018-11-23 09:43:20,772 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 09:43:20,772 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_02295bed-37c5-4c02-ad02-c179ac314ede/bin-2019/uautomizer/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2018-11-23 09:43:20,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:43:20,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:43:20,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:43:20,836 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 09:43:20,836 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 09:43:20,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:43:20,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 09:43:20,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 09:43:20,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 09:43:20,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 09:43:20,844 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand 4 states. [2018-11-23 09:43:20,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:43:20,856 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2018-11-23 09:43:20,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 09:43:20,857 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2018-11-23 09:43:20,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:43:20,858 INFO L225 Difference]: With dead ends: 46 [2018-11-23 09:43:20,858 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 09:43:20,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 09:43:20,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 09:43:20,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-23 09:43:20,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 09:43:20,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2018-11-23 09:43:20,863 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 33 [2018-11-23 09:43:20,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:43:20,864 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2018-11-23 09:43:20,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 09:43:20,864 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2018-11-23 09:43:20,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 09:43:20,866 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:43:20,866 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:43:20,866 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:43:20,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:43:20,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1308604645, now seen corresponding path program 1 times [2018-11-23 09:43:20,867 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 09:43:20,867 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_02295bed-37c5-4c02-ad02-c179ac314ede/bin-2019/uautomizer/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2018-11-23 09:43:20,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:43:20,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:43:20,919 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:43:20,938 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 09:43:20,939 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 09:43:20,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:43:20,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 09:43:20,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 09:43:20,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 09:43:20,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 09:43:20,951 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand 4 states. [2018-11-23 09:43:20,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:43:20,965 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2018-11-23 09:43:20,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 09:43:20,966 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-11-23 09:43:20,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:43:20,966 INFO L225 Difference]: With dead ends: 49 [2018-11-23 09:43:20,966 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 09:43:20,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 09:43:20,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 09:43:20,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2018-11-23 09:43:20,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 09:43:20,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2018-11-23 09:43:20,970 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 34 [2018-11-23 09:43:20,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:43:20,970 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2018-11-23 09:43:20,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 09:43:20,970 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2018-11-23 09:43:20,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 09:43:20,971 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:43:20,971 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:43:20,971 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:43:20,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:43:20,971 INFO L82 PathProgramCache]: Analyzing trace with hash 922408263, now seen corresponding path program 1 times [2018-11-23 09:43:20,971 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 09:43:20,971 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_02295bed-37c5-4c02-ad02-c179ac314ede/bin-2019/uautomizer/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2018-11-23 09:43:20,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:43:21,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:43:21,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:43:21,149 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 09:43:21,149 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 09:43:21,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:43:21,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-23 09:43:21,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 09:43:21,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 09:43:21,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-23 09:43:21,156 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand 10 states. [2018-11-23 09:43:21,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:43:21,375 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2018-11-23 09:43:21,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 09:43:21,375 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2018-11-23 09:43:21,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:43:21,376 INFO L225 Difference]: With dead ends: 44 [2018-11-23 09:43:21,376 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 09:43:21,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-11-23 09:43:21,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 09:43:21,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-23 09:43:21,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 09:43:21,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2018-11-23 09:43:21,380 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 35 [2018-11-23 09:43:21,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:43:21,380 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2018-11-23 09:43:21,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 09:43:21,380 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2018-11-23 09:43:21,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 09:43:21,381 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:43:21,381 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:43:21,382 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:43:21,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:43:21,382 INFO L82 PathProgramCache]: Analyzing trace with hash 221343685, now seen corresponding path program 1 times [2018-11-23 09:43:21,382 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 09:43:21,382 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_02295bed-37c5-4c02-ad02-c179ac314ede/bin-2019/uautomizer/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2018-11-23 09:43:21,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:43:21,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:43:21,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:43:21,487 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 09:43:21,487 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 09:43:21,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:43:21,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 09:43:21,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 09:43:21,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 09:43:21,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 09:43:21,496 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand 5 states. [2018-11-23 09:43:21,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:43:21,597 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-11-23 09:43:21,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 09:43:21,598 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-11-23 09:43:21,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:43:21,599 INFO L225 Difference]: With dead ends: 46 [2018-11-23 09:43:21,599 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 09:43:21,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 09:43:21,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 09:43:21,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-23 09:43:21,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 09:43:21,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-23 09:43:21,602 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 35 [2018-11-23 09:43:21,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:43:21,603 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-23 09:43:21,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 09:43:21,603 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-23 09:43:21,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 09:43:21,603 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:43:21,603 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:43:21,604 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:43:21,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:43:21,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1994775826, now seen corresponding path program 1 times [2018-11-23 09:43:21,604 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 09:43:21,604 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_02295bed-37c5-4c02-ad02-c179ac314ede/bin-2019/uautomizer/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2018-11-23 09:43:21,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:43:21,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:43:21,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:43:21,646 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 09:43:21,647 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 09:43:21,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:43:21,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 09:43:21,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 09:43:21,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 09:43:21,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 09:43:21,659 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 4 states. [2018-11-23 09:43:21,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:43:21,666 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2018-11-23 09:43:21,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 09:43:21,667 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-11-23 09:43:21,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:43:21,667 INFO L225 Difference]: With dead ends: 46 [2018-11-23 09:43:21,668 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 09:43:21,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 09:43:21,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 09:43:21,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-11-23 09:43:21,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 09:43:21,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-23 09:43:21,671 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 35 [2018-11-23 09:43:21,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:43:21,673 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-23 09:43:21,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 09:43:21,673 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-23 09:43:21,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 09:43:21,673 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:43:21,674 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:43:21,674 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:43:21,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:43:21,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1330109311, now seen corresponding path program 1 times [2018-11-23 09:43:21,674 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 09:43:21,674 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_02295bed-37c5-4c02-ad02-c179ac314ede/bin-2019/uautomizer/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2018-11-23 09:43:21,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:43:21,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:43:21,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:43:21,730 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 09:43:21,730 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 09:43:21,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:43:21,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 09:43:21,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 09:43:21,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 09:43:21,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 09:43:21,743 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 4 states. [2018-11-23 09:43:21,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:43:21,755 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2018-11-23 09:43:21,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 09:43:21,756 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-11-23 09:43:21,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:43:21,756 INFO L225 Difference]: With dead ends: 46 [2018-11-23 09:43:21,757 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 09:43:21,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 09:43:21,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 09:43:21,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-11-23 09:43:21,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 09:43:21,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-23 09:43:21,760 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 36 [2018-11-23 09:43:21,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:43:21,761 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-23 09:43:21,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 09:43:21,761 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-23 09:43:21,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 09:43:21,761 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:43:21,762 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:43:21,763 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:43:21,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:43:21,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1036706304, now seen corresponding path program 1 times [2018-11-23 09:43:21,764 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 09:43:21,764 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_02295bed-37c5-4c02-ad02-c179ac314ede/bin-2019/uautomizer/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2018-11-23 09:43:21,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:43:21,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:43:21,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:43:21,905 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 09:43:21,905 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 09:43:21,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:43:21,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 09:43:21,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 09:43:21,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 09:43:21,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 09:43:21,913 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 9 states. [2018-11-23 09:43:22,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:43:22,051 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-11-23 09:43:22,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 09:43:22,052 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2018-11-23 09:43:22,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:43:22,052 INFO L225 Difference]: With dead ends: 33 [2018-11-23 09:43:22,052 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 09:43:22,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-11-23 09:43:22,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 09:43:22,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 09:43:22,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 09:43:22,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 09:43:22,053 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2018-11-23 09:43:22,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:43:22,053 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 09:43:22,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 09:43:22,054 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 09:43:22,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:43:22,056 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 09:43:22,177 INFO L448 ceAbstractionStarter]: For program point isnan_floatFINAL(line 54) no Hoare annotation was computed. [2018-11-23 09:43:22,177 INFO L451 ceAbstractionStarter]: At program point isnan_floatENTRY(line 54) the Hoare annotation is: true [2018-11-23 09:43:22,177 INFO L448 ceAbstractionStarter]: For program point isnan_floatEXIT(line 54) no Hoare annotation was computed. [2018-11-23 09:43:22,177 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 09:43:22,177 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 09:43:22,177 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 09:43:22,177 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 09:43:22,177 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 09:43:22,177 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 09:43:22,177 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 09:43:22,177 INFO L448 ceAbstractionStarter]: For program point L65(line 65) no Hoare annotation was computed. [2018-11-23 09:43:22,177 INFO L444 ceAbstractionStarter]: At program point L64(line 64) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 8 24) (_ +zero 8 24)))) (and (= main_~res~0 .cse0) (= main_~y~0 .cse0))) [2018-11-23 09:43:22,178 INFO L448 ceAbstractionStarter]: For program point L64-1(lines 64 67) no Hoare annotation was computed. [2018-11-23 09:43:22,178 INFO L444 ceAbstractionStarter]: At program point L62(line 62) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 8 24) (_ +zero 8 24)))) (and (= main_~y~0 .cse0) (= main_~x~0 .cse0))) [2018-11-23 09:43:22,178 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 56 70) the Hoare annotation is: true [2018-11-23 09:43:22,178 INFO L448 ceAbstractionStarter]: For program point L62-1(line 62) no Hoare annotation was computed. [2018-11-23 09:43:22,178 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 56 70) no Hoare annotation was computed. [2018-11-23 09:43:22,178 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 56 70) no Hoare annotation was computed. [2018-11-23 09:43:22,178 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2018-11-23 09:43:22,178 INFO L448 ceAbstractionStarter]: For program point fmax_floatEXIT(lines 42 51) no Hoare annotation was computed. [2018-11-23 09:43:22,178 INFO L451 ceAbstractionStarter]: At program point fmax_floatENTRY(lines 42 51) the Hoare annotation is: true [2018-11-23 09:43:22,178 INFO L448 ceAbstractionStarter]: For program point L50(line 50) no Hoare annotation was computed. [2018-11-23 09:43:22,178 INFO L448 ceAbstractionStarter]: For program point L50-2(line 50) no Hoare annotation was computed. [2018-11-23 09:43:22,178 INFO L444 ceAbstractionStarter]: At program point L47(line 47) the Hoare annotation is: (and (= |fmax_float_#in~y| fmax_float_~y) (= |fmax_float_#in~x| fmax_float_~x)) [2018-11-23 09:43:22,178 INFO L448 ceAbstractionStarter]: For program point L47-1(lines 47 49) no Hoare annotation was computed. [2018-11-23 09:43:22,179 INFO L444 ceAbstractionStarter]: At program point L43(line 43) the Hoare annotation is: (and (= |fmax_float_#in~y| fmax_float_~y) (= |fmax_float_#in~x| fmax_float_~x)) [2018-11-23 09:43:22,179 INFO L448 ceAbstractionStarter]: For program point L43-1(lines 43 45) no Hoare annotation was computed. [2018-11-23 09:43:22,179 INFO L448 ceAbstractionStarter]: For program point fmax_floatFINAL(lines 42 51) no Hoare annotation was computed. [2018-11-23 09:43:22,179 INFO L448 ceAbstractionStarter]: For program point L33(lines 33 39) no Hoare annotation was computed. [2018-11-23 09:43:22,179 INFO L448 ceAbstractionStarter]: For program point __fpclassify_floatFINAL(lines 19 40) no Hoare annotation was computed. [2018-11-23 09:43:22,179 INFO L448 ceAbstractionStarter]: For program point L36(lines 36 39) no Hoare annotation was computed. [2018-11-23 09:43:22,179 INFO L448 ceAbstractionStarter]: For program point L30(lines 30 39) no Hoare annotation was computed. [2018-11-23 09:43:22,179 INFO L448 ceAbstractionStarter]: For program point L22-1(lines 22 26) no Hoare annotation was computed. [2018-11-23 09:43:22,179 INFO L451 ceAbstractionStarter]: At program point L22-2(lines 22 26) the Hoare annotation is: true [2018-11-23 09:43:22,179 INFO L448 ceAbstractionStarter]: For program point L22-3(lines 19 40) no Hoare annotation was computed. [2018-11-23 09:43:22,179 INFO L451 ceAbstractionStarter]: At program point __fpclassify_floatENTRY(lines 19 40) the Hoare annotation is: true [2018-11-23 09:43:22,179 INFO L448 ceAbstractionStarter]: For program point __fpclassify_floatEXIT(lines 19 40) no Hoare annotation was computed. [2018-11-23 09:43:22,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 09:43:22 BoogieIcfgContainer [2018-11-23 09:43:22,183 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 09:43:22,184 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 09:43:22,184 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 09:43:22,184 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 09:43:22,184 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:43:19" (3/4) ... [2018-11-23 09:43:22,187 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 09:43:22,191 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure isnan_float [2018-11-23 09:43:22,191 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 09:43:22,192 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 09:43:22,192 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fmax_float [2018-11-23 09:43:22,192 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __fpclassify_float [2018-11-23 09:43:22,195 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2018-11-23 09:43:22,195 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-23 09:43:22,195 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 09:43:22,235 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_02295bed-37c5-4c02-ad02-c179ac314ede/bin-2019/uautomizer/witness.graphml [2018-11-23 09:43:22,235 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 09:43:22,235 INFO L168 Benchmark]: Toolchain (without parser) took 3049.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 191.4 MB). Free memory was 950.8 MB in the beginning and 1.2 GB in the end (delta: -228.6 MB). Peak memory consumption was 294.8 MB. Max. memory is 11.5 GB. [2018-11-23 09:43:22,237 INFO L168 Benchmark]: CDTParser took 0.13 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-23 09:43:22,237 INFO L168 Benchmark]: CACSL2BoogieTranslator took 195.20 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 934.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-23 09:43:22,237 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.07 ms. Allocated memory is still 1.0 GB. Free memory is still 934.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 09:43:22,237 INFO L168 Benchmark]: Boogie Preprocessor took 21.33 ms. Allocated memory is still 1.0 GB. Free memory is still 934.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 09:43:22,238 INFO L168 Benchmark]: RCFGBuilder took 245.11 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 934.7 MB in the beginning and 1.1 GB in the end (delta: -154.3 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-11-23 09:43:22,238 INFO L168 Benchmark]: TraceAbstraction took 2515.65 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 785.1 MB in the end (delta: 303.9 MB). Peak memory consumption was 303.9 MB. Max. memory is 11.5 GB. [2018-11-23 09:43:22,238 INFO L168 Benchmark]: Witness Printer took 51.16 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 71.3 MB). Free memory was 785.1 MB in the beginning and 1.2 GB in the end (delta: -394.3 MB). Peak memory consumption was 9.0 MB. Max. memory is 11.5 GB. [2018-11-23 09:43:22,240 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 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 195.20 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 934.7 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 18.07 ms. Allocated memory is still 1.0 GB. Free memory is still 934.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.33 ms. Allocated memory is still 1.0 GB. Free memory is still 934.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 245.11 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 934.7 MB in the beginning and 1.1 GB in the end (delta: -154.3 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2515.65 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 785.1 MB in the end (delta: 303.9 MB). Peak memory consumption was 303.9 MB. Max. memory is 11.5 GB. * Witness Printer took 51.16 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 71.3 MB). Free memory was 785.1 MB in the beginning and 1.2 GB in the end (delta: -394.3 MB). Peak memory consumption was 9.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 65]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 37 locations, 1 error locations. SAFE Result, 2.4s OverallTime, 13 OverallIterations, 2 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 498 SDtfs, 31 SDslu, 1315 SDs, 0 SdLazy, 221 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 403 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=0, traceCheckStatistics: No data available, 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: 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 19 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 28 PreInvPairs, 33 NumberOfFragments, 48 HoareAnnotationTreeSize, 28 FomulaSimplifications, 20 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 402 NumberOfCodeBlocks, 402 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 389 ConstructedInterpolants, 3 QuantifiedInterpolants, 21567 SizeOfPredicates, 15 NumberOfNonLiveVariables, 1053 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 42/42 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...