./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/float_req_bl_1230_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_6a0c05a5-f13c-46a8-827b-cc51dcc40a61/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6a0c05a5-f13c-46a8-827b-cc51dcc40a61/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6a0c05a5-f13c-46a8-827b-cc51dcc40a61/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6a0c05a5-f13c-46a8-827b-cc51dcc40a61/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1230_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_6a0c05a5-f13c-46a8-827b-cc51dcc40a61/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6a0c05a5-f13c-46a8-827b-cc51dcc40a61/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 31da98a788dd1938c78053bade42bc512d4e8954 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_6a0c05a5-f13c-46a8-827b-cc51dcc40a61/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6a0c05a5-f13c-46a8-827b-cc51dcc40a61/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6a0c05a5-f13c-46a8-827b-cc51dcc40a61/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6a0c05a5-f13c-46a8-827b-cc51dcc40a61/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1230_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_6a0c05a5-f13c-46a8-827b-cc51dcc40a61/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6a0c05a5-f13c-46a8-827b-cc51dcc40a61/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 31da98a788dd1938c78053bade42bc512d4e8954 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-22 21:30:55,573 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 21:30:55,575 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 21:30:55,583 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 21:30:55,583 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 21:30:55,584 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 21:30:55,585 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 21:30:55,586 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 21:30:55,587 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 21:30:55,588 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 21:30:55,588 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 21:30:55,589 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 21:30:55,589 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 21:30:55,590 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 21:30:55,591 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 21:30:55,591 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 21:30:55,592 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 21:30:55,593 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 21:30:55,594 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 21:30:55,596 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 21:30:55,596 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 21:30:55,597 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 21:30:55,599 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 21:30:55,599 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 21:30:55,599 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 21:30:55,599 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 21:30:55,600 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 21:30:55,601 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 21:30:55,601 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 21:30:55,602 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 21:30:55,602 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 21:30:55,603 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 21:30:55,603 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 21:30:55,603 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 21:30:55,604 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 21:30:55,604 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 21:30:55,604 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6a0c05a5-f13c-46a8-827b-cc51dcc40a61/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-22 21:30:55,614 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 21:30:55,614 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 21:30:55,615 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-22 21:30:55,615 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-22 21:30:55,615 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-22 21:30:55,615 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-22 21:30:55,615 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-22 21:30:55,616 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-22 21:30:55,616 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-22 21:30:55,616 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-22 21:30:55,616 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-22 21:30:55,616 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-22 21:30:55,616 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-22 21:30:55,617 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 21:30:55,617 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-22 21:30:55,617 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 21:30:55,617 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-22 21:30:55,617 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 21:30:55,617 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-22 21:30:55,618 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-22 21:30:55,618 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-22 21:30:55,618 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-22 21:30:55,618 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 21:30:55,618 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 21:30:55,618 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-22 21:30:55,618 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 21:30:55,619 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 21:30:55,619 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-22 21:30:55,619 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-22 21:30:55,619 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-22 21:30:55,619 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 21:30:55,619 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-22 21:30:55,619 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-22 21:30:55,620 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-22 21:30:55,620 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-22 21:30:55,620 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-22 21:30:55,620 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-22 21:30:55,620 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_6a0c05a5-f13c-46a8-827b-cc51dcc40a61/bin-2019/utaipan 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 -> Taipan 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 -> 31da98a788dd1938c78053bade42bc512d4e8954 [2018-11-22 21:30:55,645 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 21:30:55,653 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 21:30:55,655 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 21:30:55,656 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 21:30:55,656 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 21:30:55,657 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6a0c05a5-f13c-46a8-827b-cc51dcc40a61/bin-2019/utaipan/../../sv-benchmarks/c/float-newlib/float_req_bl_1230_true-unreach-call.c [2018-11-22 21:30:55,692 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6a0c05a5-f13c-46a8-827b-cc51dcc40a61/bin-2019/utaipan/data/d8b4b6a42/418733a8aae14d2ea113e7d46198a70d/FLAG595d8e163 [2018-11-22 21:30:56,016 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 21:30:56,016 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6a0c05a5-f13c-46a8-827b-cc51dcc40a61/sv-benchmarks/c/float-newlib/float_req_bl_1230_true-unreach-call.c [2018-11-22 21:30:56,021 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6a0c05a5-f13c-46a8-827b-cc51dcc40a61/bin-2019/utaipan/data/d8b4b6a42/418733a8aae14d2ea113e7d46198a70d/FLAG595d8e163 [2018-11-22 21:30:56,032 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6a0c05a5-f13c-46a8-827b-cc51dcc40a61/bin-2019/utaipan/data/d8b4b6a42/418733a8aae14d2ea113e7d46198a70d [2018-11-22 21:30:56,034 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 21:30:56,034 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 21:30:56,035 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 21:30:56,035 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 21:30:56,038 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 21:30:56,038 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:30:56" (1/1) ... [2018-11-22 21:30:56,040 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ef9d357 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:56, skipping insertion in model container [2018-11-22 21:30:56,040 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:30:56" (1/1) ... [2018-11-22 21:30:56,046 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 21:30:56,060 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 21:30:56,178 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 21:30:56,180 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 21:30:56,195 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 21:30:56,208 INFO L195 MainTranslator]: Completed translation [2018-11-22 21:30:56,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:56 WrapperNode [2018-11-22 21:30:56,209 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 21:30:56,209 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 21:30:56,209 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 21:30:56,209 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 21:30:56,215 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:56" (1/1) ... [2018-11-22 21:30:56,221 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:56" (1/1) ... [2018-11-22 21:30:56,225 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 21:30:56,226 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 21:30:56,226 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 21:30:56,226 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 21:30:56,266 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:56" (1/1) ... [2018-11-22 21:30:56,266 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:56" (1/1) ... [2018-11-22 21:30:56,267 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:56" (1/1) ... [2018-11-22 21:30:56,267 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:56" (1/1) ... [2018-11-22 21:30:56,275 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:56" (1/1) ... [2018-11-22 21:30:56,279 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:56" (1/1) ... [2018-11-22 21:30:56,280 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:56" (1/1) ... [2018-11-22 21:30:56,281 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 21:30:56,282 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 21:30:56,282 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 21:30:56,282 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 21:30:56,282 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a0c05a5-f13c-46a8-827b-cc51dcc40a61/bin-2019/utaipan/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-22 21:30:56,319 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_float [2018-11-22 21:30:56,320 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_float [2018-11-22 21:30:56,320 INFO L130 BoogieDeclarations]: Found specification of procedure fmin_float [2018-11-22 21:30:56,320 INFO L138 BoogieDeclarations]: Found implementation of procedure fmin_float [2018-11-22 21:30:56,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-22 21:30:56,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-22 21:30:56,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-22 21:30:56,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-22 21:30:56,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 21:30:56,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 21:30:56,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-22 21:30:56,321 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-22 21:30:56,321 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-22 21:30:56,321 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2018-11-22 21:30:56,321 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2018-11-22 21:30:56,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-22 21:30:56,512 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 21:30:56,512 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-22 21:30:56,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:30:56 BoogieIcfgContainer [2018-11-22 21:30:56,513 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 21:30:56,513 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-22 21:30:56,514 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-22 21:30:56,516 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-22 21:30:56,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:30:56" (1/3) ... [2018-11-22 21:30:56,517 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@257e3359 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:30:56, skipping insertion in model container [2018-11-22 21:30:56,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:56" (2/3) ... [2018-11-22 21:30:56,518 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@257e3359 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:30:56, skipping insertion in model container [2018-11-22 21:30:56,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:30:56" (3/3) ... [2018-11-22 21:30:56,519 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1230_true-unreach-call.c [2018-11-22 21:30:56,528 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-22 21:30:56,534 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-22 21:30:56,549 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-22 21:30:56,573 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-22 21:30:56,573 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-22 21:30:56,573 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-22 21:30:56,573 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 21:30:56,573 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 21:30:56,573 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-22 21:30:56,574 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 21:30:56,574 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-22 21:30:56,586 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-11-22 21:30:56,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-22 21:30:56,589 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:30:56,590 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-22 21:30:56,592 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:30:56,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:30:56,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1023937428, now seen corresponding path program 1 times [2018-11-22 21:30:56,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:30:56,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:30:56,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:30:56,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:30:56,625 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:30:56,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:30:56,687 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-22 21:30:56,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:30:56,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-22 21:30:56,690 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 21:30:56,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-22 21:30:56,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-22 21:30:56,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-22 21:30:56,702 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 2 states. [2018-11-22 21:30:56,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:30:56,722 INFO L93 Difference]: Finished difference Result 71 states and 92 transitions. [2018-11-22 21:30:56,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-22 21:30:56,723 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 26 [2018-11-22 21:30:56,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:30:56,730 INFO L225 Difference]: With dead ends: 71 [2018-11-22 21:30:56,730 INFO L226 Difference]: Without dead ends: 36 [2018-11-22 21:30:56,732 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-22 21:30:56,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-22 21:30:56,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-22 21:30:56,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-22 21:30:56,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2018-11-22 21:30:56,757 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 26 [2018-11-22 21:30:56,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:30:56,757 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2018-11-22 21:30:56,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-22 21:30:56,758 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2018-11-22 21:30:56,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-22 21:30:56,759 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:30:56,759 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-22 21:30:56,759 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:30:56,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:30:56,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1596536717, now seen corresponding path program 1 times [2018-11-22 21:30:56,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:30:56,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:30:56,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:30:56,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:30:56,760 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:30:56,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:30:56,818 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-22 21:30:56,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:30:56,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-22 21:30:56,819 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 21:30:56,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-22 21:30:56,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 21:30:56,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 21:30:56,821 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand 4 states. [2018-11-22 21:30:56,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:30:56,847 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2018-11-22 21:30:56,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-22 21:30:56,848 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-11-22 21:30:56,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:30:56,850 INFO L225 Difference]: With dead ends: 51 [2018-11-22 21:30:56,850 INFO L226 Difference]: Without dead ends: 40 [2018-11-22 21:30:56,851 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-22 21:30:56,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-22 21:30:56,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-22 21:30:56,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-22 21:30:56,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2018-11-22 21:30:56,856 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 27 [2018-11-22 21:30:56,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:30:56,857 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2018-11-22 21:30:56,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-22 21:30:56,857 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2018-11-22 21:30:56,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-22 21:30:56,858 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:30:56,858 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-22 21:30:56,858 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:30:56,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:30:56,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1459057619, now seen corresponding path program 1 times [2018-11-22 21:30:56,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:30:56,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:30:56,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:30:56,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:30:56,859 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:30:56,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:30:56,917 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-22 21:30:56,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:30:56,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-22 21:30:56,918 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 21:30:56,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-22 21:30:56,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 21:30:56,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 21:30:56,918 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 4 states. [2018-11-22 21:30:56,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:30:56,944 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2018-11-22 21:30:56,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-22 21:30:56,945 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-11-22 21:30:56,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:30:56,945 INFO L225 Difference]: With dead ends: 55 [2018-11-22 21:30:56,946 INFO L226 Difference]: Without dead ends: 44 [2018-11-22 21:30:56,946 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-22 21:30:56,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-22 21:30:56,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2018-11-22 21:30:56,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-22 21:30:56,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2018-11-22 21:30:56,950 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 30 [2018-11-22 21:30:56,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:30:56,950 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2018-11-22 21:30:56,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-22 21:30:56,951 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2018-11-22 21:30:56,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-22 21:30:56,951 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:30:56,952 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-22 21:30:56,952 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:30:56,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:30:56,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1328357868, now seen corresponding path program 1 times [2018-11-22 21:30:56,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:30:56,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:30:56,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:30:56,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:30:56,953 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:30:56,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:30:56,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:30:56,998 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|=2139095042, |old(#NULL.base)|=2139095048, |old(#NULL.offset)|=2139095042] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=2139095048, |old(#NULL.offset)|=2139095042] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=2139095048, |old(#NULL.offset)|=2139095042] [?] RET #75#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 := fmin_float(~x~0, ~y~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |fmin_float_#in~x|=2139095043.0, |fmin_float_#in~y|=2139095045.0] [?] ~x := #in~x;~y := #in~y; VAL [fmin_float_~x=2139095043.0, fmin_float_~y=2139095045.0, |#NULL.base|=0, |#NULL.offset|=0, |fmin_float_#in~x|=2139095043.0, |fmin_float_#in~y|=2139095045.0] [?] CALL call #t~ret2 := __fpclassify_float(~x); VAL [|#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_float_#in~x|=2139095043.0] [?] ~x := #in~x;havoc ~w~0; VAL [__fpclassify_float_~x=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_float_#in~x|=2139095043.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=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_float_#in~x|=2139095043.0] [?] goto; VAL [__fpclassify_float_~w~0=2139095041, __fpclassify_float_~x=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_float_#in~x|=2139095043.0] [?] assume !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296); VAL [__fpclassify_float_~w~0=2139095041, __fpclassify_float_~x=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_float_#in~x|=2139095043.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=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_float_#in~x|=2139095043.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=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_float_#in~x|=2139095043.0] [?] assume !(2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296);#res := 0; VAL [__fpclassify_float_~w~0=2139095041, __fpclassify_float_~x=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_float_#in~x|=2139095043.0, |__fpclassify_float_#res|=0] [?] assume true; VAL [__fpclassify_float_~w~0=2139095041, __fpclassify_float_~x=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_float_#in~x|=2139095043.0, |__fpclassify_float_#res|=0] [?] RET #71#return; VAL [fmin_float_~x=2139095043.0, fmin_float_~y=2139095045.0, |#NULL.base|=0, |#NULL.offset|=0, |fmin_float_#in~x|=2139095043.0, |fmin_float_#in~y|=2139095045.0, |fmin_float_#t~ret2|=0] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fmin_float_~x=2139095043.0, fmin_float_~y=2139095045.0, |#NULL.base|=0, |#NULL.offset|=0, |fmin_float_#in~x|=2139095043.0, |fmin_float_#in~y|=2139095045.0, |fmin_float_#t~ret2|=0] [?] assume 0 == #t~ret2;havoc #t~ret2;#res := ~y; VAL [fmin_float_~x=2139095043.0, fmin_float_~y=2139095045.0, |#NULL.base|=0, |#NULL.offset|=0, |fmin_float_#in~x|=2139095043.0, |fmin_float_#in~y|=2139095045.0, |fmin_float_#res|=2139095045.0] [?] assume true; VAL [fmin_float_~x=2139095043.0, fmin_float_~y=2139095045.0, |#NULL.base|=0, |#NULL.offset|=0, |fmin_float_#in~x|=2139095043.0, |fmin_float_#in~y|=2139095045.0, |fmin_float_#res|=2139095045.0] [?] RET #79#return; VAL [main_~x~0=2139095043.0, main_~y~0=2139095045.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret5|=2139095045.0] [?] ~res~0 := #t~ret5;havoc #t~ret5; VAL [main_~res~0=2139095045.0, main_~x~0=2139095043.0, main_~y~0=2139095045.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|=2139095045.0] [?] ~x := #in~x;#res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [isnan_float_~x=2139095045.0, |#NULL.base|=0, |#NULL.offset|=0, |isnan_float_#in~x|=2139095045.0, |isnan_float_#res|=0] [?] assume true; VAL [isnan_float_~x=2139095045.0, |#NULL.base|=0, |#NULL.offset|=0, |isnan_float_#in~x|=2139095045.0, |isnan_float_#res|=0] [?] RET #81#return; VAL [main_~res~0=2139095045.0, main_~x~0=2139095043.0, main_~y~0=2139095045.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret6|=0] [?] assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; VAL [main_~res~0=2139095045.0, main_~x~0=2139095043.0, main_~y~0=2139095045.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret6|=0] [?] assume 0 == #t~ret6;havoc #t~ret6; VAL [main_~res~0=2139095045.0, main_~x~0=2139095043.0, main_~y~0=2139095045.0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !false; VAL [main_~res~0=2139095045.0, main_~x~0=2139095043.0, main_~y~0=2139095045.0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=2139095048, #NULL.offset=2139095042, old(#NULL.base)=2139095048, old(#NULL.offset)=2139095042] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=2139095048, old(#NULL.offset)=2139095042] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=2139095048, old(#NULL.offset)=2139095042] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret7 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L54] ~x~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0); [L55] ~y~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0); VAL [#NULL.base=0, #NULL.offset=0] [L56] CALL call #t~ret5 := fmin_float(~x~0, ~y~0); VAL [#in~x=2.139095043E9, #in~y=2.139095045E9, #NULL.base=0, #NULL.offset=0] [L34-L41] ~x := #in~x; [L34-L41] ~y := #in~y; VAL [#in~x=2.139095043E9, #in~y=2.139095045E9, #NULL.base=0, #NULL.offset=0, ~x=2.139095043E9, ~y=2.139095045E9] [L35] CALL call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=2.139095043E9, #NULL.base=0, #NULL.offset=0] [L11-L32] ~x := #in~x; [L12] havoc ~w~0; VAL [#in~x=2.139095043E9, #NULL.base=0, #NULL.offset=0, ~x=2.139095043E9] [L15] call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.alloc(4); [L16] call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4); [L17] call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4); [L17] ~w~0 := #t~mem0; [L17] call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4); [L17] havoc #t~union1; [L17] havoc #t~mem0; [L15] call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset); [L15] havoc ~#gf_u~0.base, ~#gf_u~0.offset; VAL [#in~x=2.139095043E9, #NULL.base=0, #NULL.offset=0, ~w~0=2139095041, ~x=2.139095043E9] [L20-L31] assume !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296); VAL [#in~x=2.139095043E9, #NULL.base=0, #NULL.offset=0, ~w~0=2139095041, ~x=2.139095043E9] [L22-L31] assume !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)); VAL [#in~x=2.139095043E9, #NULL.base=0, #NULL.offset=0, ~w~0=2139095041, ~x=2.139095043E9] [L25-L31] assume !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)); VAL [#in~x=2.139095043E9, #NULL.base=0, #NULL.offset=0, ~w~0=2139095041, ~x=2.139095043E9] [L28-L31] assume !(2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296); [L31] #res := 0; VAL [#in~x=2.139095043E9, #NULL.base=0, #NULL.offset=0, #res=0, ~w~0=2139095041, ~x=2.139095043E9] [L11-L32] ensures true; VAL [#in~x=2.139095043E9, #NULL.base=0, #NULL.offset=0, #res=0, ~w~0=2139095041, ~x=2.139095043E9] [L35] RET call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=2.139095043E9, #in~y=2.139095045E9, #NULL.base=0, #NULL.offset=0, #t~ret2=0, ~x=2.139095043E9, ~y=2.139095045E9] [L35] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~x=2.139095043E9, #in~y=2.139095045E9, #NULL.base=0, #NULL.offset=0, #t~ret2=0, ~x=2.139095043E9, ~y=2.139095045E9] [L35-L36] assume 0 == #t~ret2; [L35] havoc #t~ret2; [L36] #res := ~y; VAL [#in~x=2.139095043E9, #in~y=2.139095045E9, #NULL.base=0, #NULL.offset=0, #res=2.139095045E9, ~x=2.139095043E9, ~y=2.139095045E9] [L34-L41] ensures true; VAL [#in~x=2.139095043E9, #in~y=2.139095045E9, #NULL.base=0, #NULL.offset=0, #res=2.139095045E9, ~x=2.139095043E9, ~y=2.139095045E9] [L56] RET call #t~ret5 := fmin_float(~x~0, ~y~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret5=2.139095045E9, ~x~0=2.139095043E9, ~y~0=2.139095045E9] [L56] ~res~0 := #t~ret5; [L56] havoc #t~ret5; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=2.139095045E9, ~x~0=2.139095043E9, ~y~0=2.139095045E9] [L58] CALL call #t~ret6 := isnan_float(~res~0); VAL [#in~x=2.139095045E9, #NULL.base=0, #NULL.offset=0] [L44] ~x := #in~x; [L44] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095045E9, #NULL.base=0, #NULL.offset=0, #res=0, ~x=2.139095045E9] [L44] ensures true; VAL [#in~x=2.139095045E9, #NULL.base=0, #NULL.offset=0, #res=0, ~x=2.139095045E9] [L58] RET call #t~ret6 := isnan_float(~res~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret6=0, ~res~0=2.139095045E9, ~x~0=2.139095043E9, ~y~0=2.139095045E9] [L58] assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret6=0, ~res~0=2.139095045E9, ~x~0=2.139095043E9, ~y~0=2.139095045E9] [L58-L61] assume 0 == #t~ret6; [L58] havoc #t~ret6; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=2.139095045E9, ~x~0=2.139095043E9, ~y~0=2.139095045E9] [L59] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=2.139095045E9, ~x~0=2.139095043E9, ~y~0=2.139095045E9] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=2139095048, #NULL.offset=2139095042, old(#NULL.base)=2139095048, old(#NULL.offset)=2139095042] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=2139095048, old(#NULL.offset)=2139095042] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=2139095048, old(#NULL.offset)=2139095042] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret7 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L54] ~x~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0); [L55] ~y~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0); VAL [#NULL.base=0, #NULL.offset=0] [L56] CALL call #t~ret5 := fmin_float(~x~0, ~y~0); VAL [#in~x=2.139095043E9, #in~y=2.139095045E9, #NULL.base=0, #NULL.offset=0] [L34-L41] ~x := #in~x; [L34-L41] ~y := #in~y; VAL [#in~x=2.139095043E9, #in~y=2.139095045E9, #NULL.base=0, #NULL.offset=0, ~x=2.139095043E9, ~y=2.139095045E9] [L35] CALL call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=2.139095043E9, #NULL.base=0, #NULL.offset=0] [L11-L32] ~x := #in~x; [L12] havoc ~w~0; VAL [#in~x=2.139095043E9, #NULL.base=0, #NULL.offset=0, ~x=2.139095043E9] [L15] call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.alloc(4); [L16] call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4); [L17] call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4); [L17] ~w~0 := #t~mem0; [L17] call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4); [L17] havoc #t~union1; [L17] havoc #t~mem0; [L15] call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset); [L15] havoc ~#gf_u~0.base, ~#gf_u~0.offset; VAL [#in~x=2.139095043E9, #NULL.base=0, #NULL.offset=0, ~w~0=2139095041, ~x=2.139095043E9] [L20-L31] assume !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296); VAL [#in~x=2.139095043E9, #NULL.base=0, #NULL.offset=0, ~w~0=2139095041, ~x=2.139095043E9] [L22-L31] assume !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)); VAL [#in~x=2.139095043E9, #NULL.base=0, #NULL.offset=0, ~w~0=2139095041, ~x=2.139095043E9] [L25-L31] assume !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)); VAL [#in~x=2.139095043E9, #NULL.base=0, #NULL.offset=0, ~w~0=2139095041, ~x=2.139095043E9] [L28-L31] assume !(2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296); [L31] #res := 0; VAL [#in~x=2.139095043E9, #NULL.base=0, #NULL.offset=0, #res=0, ~w~0=2139095041, ~x=2.139095043E9] [L11-L32] ensures true; VAL [#in~x=2.139095043E9, #NULL.base=0, #NULL.offset=0, #res=0, ~w~0=2139095041, ~x=2.139095043E9] [L35] RET call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=2.139095043E9, #in~y=2.139095045E9, #NULL.base=0, #NULL.offset=0, #t~ret2=0, ~x=2.139095043E9, ~y=2.139095045E9] [L35] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~x=2.139095043E9, #in~y=2.139095045E9, #NULL.base=0, #NULL.offset=0, #t~ret2=0, ~x=2.139095043E9, ~y=2.139095045E9] [L35-L36] assume 0 == #t~ret2; [L35] havoc #t~ret2; [L36] #res := ~y; VAL [#in~x=2.139095043E9, #in~y=2.139095045E9, #NULL.base=0, #NULL.offset=0, #res=2.139095045E9, ~x=2.139095043E9, ~y=2.139095045E9] [L34-L41] ensures true; VAL [#in~x=2.139095043E9, #in~y=2.139095045E9, #NULL.base=0, #NULL.offset=0, #res=2.139095045E9, ~x=2.139095043E9, ~y=2.139095045E9] [L56] RET call #t~ret5 := fmin_float(~x~0, ~y~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret5=2.139095045E9, ~x~0=2.139095043E9, ~y~0=2.139095045E9] [L56] ~res~0 := #t~ret5; [L56] havoc #t~ret5; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=2.139095045E9, ~x~0=2.139095043E9, ~y~0=2.139095045E9] [L58] CALL call #t~ret6 := isnan_float(~res~0); VAL [#in~x=2.139095045E9, #NULL.base=0, #NULL.offset=0] [L44] ~x := #in~x; [L44] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095045E9, #NULL.base=0, #NULL.offset=0, #res=0, ~x=2.139095045E9] [L44] ensures true; VAL [#in~x=2.139095045E9, #NULL.base=0, #NULL.offset=0, #res=0, ~x=2.139095045E9] [L58] RET call #t~ret6 := isnan_float(~res~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret6=0, ~res~0=2.139095045E9, ~x~0=2.139095043E9, ~y~0=2.139095045E9] [L58] assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret6=0, ~res~0=2.139095045E9, ~x~0=2.139095043E9, ~y~0=2.139095045E9] [L58-L61] assume 0 == #t~ret6; [L58] havoc #t~ret6; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=2.139095045E9, ~x~0=2.139095043E9, ~y~0=2.139095045E9] [L59] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=2.139095045E9, ~x~0=2.139095043E9, ~y~0=2.139095045E9] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=2139095048, #NULL!offset=2139095042, old(#NULL!base)=2139095048, old(#NULL!offset)=2139095042] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=2139095048, old(#NULL!offset)=2139095042] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret7 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L54] ~x~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0); [L55] ~y~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0); VAL [#NULL!base=0, #NULL!offset=0] [L56] CALL call #t~ret5 := fmin_float(~x~0, ~y~0); VAL [#in~x=2.139095043E9, #in~y=2.139095045E9, #NULL!base=0, #NULL!offset=0] [L34-L41] ~x := #in~x; [L34-L41] ~y := #in~y; VAL [#in~x=2.139095043E9, #in~y=2.139095045E9, #NULL!base=0, #NULL!offset=0, ~x=2.139095043E9, ~y=2.139095045E9] [L35] CALL call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0] [L11-L32] ~x := #in~x; [L12] havoc ~w~0; VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0, ~x=2.139095043E9] [L15] FCALL call ~#gf_u~0 := #Ultimate.alloc(4); [L16] FCALL call write~real(~x, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L17] FCALL call #t~mem0 := read~int({ base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L17] ~w~0 := #t~mem0; [L17] FCALL call write~real(#t~union1, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L17] havoc #t~union1; [L17] havoc #t~mem0; [L15] FCALL call ULTIMATE.dealloc(~#gf_u~0); [L15] havoc ~#gf_u~0; VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095043E9] [L20] COND FALSE !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296) VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095043E9] [L22-L23] COND FALSE !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)) VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095043E9] [L25-L26] COND FALSE !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)) VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095043E9] [L28] COND FALSE !(2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296) [L31] #res := 0; VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0, #res=0, ~w~0=2139095041, ~x=2.139095043E9] [L35] RET call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=2.139095043E9, #in~y=2.139095045E9, #NULL!base=0, #NULL!offset=0, #t~ret2=0, ~x=2.139095043E9, ~y=2.139095045E9] [L35] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~x=2.139095043E9, #in~y=2.139095045E9, #NULL!base=0, #NULL!offset=0, #t~ret2=0, ~x=2.139095043E9, ~y=2.139095045E9] [L35] COND TRUE 0 == #t~ret2 [L35] havoc #t~ret2; [L36] #res := ~y; VAL [#in~x=2.139095043E9, #in~y=2.139095045E9, #NULL!base=0, #NULL!offset=0, #res=2.139095045E9, ~x=2.139095043E9, ~y=2.139095045E9] [L56] RET call #t~ret5 := fmin_float(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret5=2.139095045E9, ~x~0=2.139095043E9, ~y~0=2.139095045E9] [L56] ~res~0 := #t~ret5; [L56] havoc #t~ret5; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095045E9, ~x~0=2.139095043E9, ~y~0=2.139095045E9] [L58] CALL call #t~ret6 := isnan_float(~res~0); VAL [#in~x=2.139095045E9, #NULL!base=0, #NULL!offset=0] [L44] ~x := #in~x; [L44] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095045E9, #NULL!base=0, #NULL!offset=0, #res=0, ~x=2.139095045E9] [L58] RET call #t~ret6 := isnan_float(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret6=0, ~res~0=2.139095045E9, ~x~0=2.139095043E9, ~y~0=2.139095045E9] [L58] assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret6=0, ~res~0=2.139095045E9, ~x~0=2.139095043E9, ~y~0=2.139095045E9] [L58] COND TRUE 0 == #t~ret6 [L58] havoc #t~ret6; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095045E9, ~x~0=2.139095043E9, ~y~0=2.139095045E9] [L59] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095045E9, ~x~0=2.139095043E9, ~y~0=2.139095045E9] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=2139095048, #NULL!offset=2139095042, old(#NULL!base)=2139095048, old(#NULL!offset)=2139095042] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=2139095048, old(#NULL!offset)=2139095042] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret7 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L54] ~x~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0); [L55] ~y~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0); VAL [#NULL!base=0, #NULL!offset=0] [L56] CALL call #t~ret5 := fmin_float(~x~0, ~y~0); VAL [#in~x=2.139095043E9, #in~y=2.139095045E9, #NULL!base=0, #NULL!offset=0] [L34-L41] ~x := #in~x; [L34-L41] ~y := #in~y; VAL [#in~x=2.139095043E9, #in~y=2.139095045E9, #NULL!base=0, #NULL!offset=0, ~x=2.139095043E9, ~y=2.139095045E9] [L35] CALL call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0] [L11-L32] ~x := #in~x; [L12] havoc ~w~0; VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0, ~x=2.139095043E9] [L15] FCALL call ~#gf_u~0 := #Ultimate.alloc(4); [L16] FCALL call write~real(~x, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L17] FCALL call #t~mem0 := read~int({ base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L17] ~w~0 := #t~mem0; [L17] FCALL call write~real(#t~union1, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L17] havoc #t~union1; [L17] havoc #t~mem0; [L15] FCALL call ULTIMATE.dealloc(~#gf_u~0); [L15] havoc ~#gf_u~0; VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095043E9] [L20] COND FALSE !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296) VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095043E9] [L22-L23] COND FALSE !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)) VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095043E9] [L25-L26] COND FALSE !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)) VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095043E9] [L28] COND FALSE !(2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296) [L31] #res := 0; VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0, #res=0, ~w~0=2139095041, ~x=2.139095043E9] [L35] RET call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=2.139095043E9, #in~y=2.139095045E9, #NULL!base=0, #NULL!offset=0, #t~ret2=0, ~x=2.139095043E9, ~y=2.139095045E9] [L35] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~x=2.139095043E9, #in~y=2.139095045E9, #NULL!base=0, #NULL!offset=0, #t~ret2=0, ~x=2.139095043E9, ~y=2.139095045E9] [L35] COND TRUE 0 == #t~ret2 [L35] havoc #t~ret2; [L36] #res := ~y; VAL [#in~x=2.139095043E9, #in~y=2.139095045E9, #NULL!base=0, #NULL!offset=0, #res=2.139095045E9, ~x=2.139095043E9, ~y=2.139095045E9] [L56] RET call #t~ret5 := fmin_float(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret5=2.139095045E9, ~x~0=2.139095043E9, ~y~0=2.139095045E9] [L56] ~res~0 := #t~ret5; [L56] havoc #t~ret5; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095045E9, ~x~0=2.139095043E9, ~y~0=2.139095045E9] [L58] CALL call #t~ret6 := isnan_float(~res~0); VAL [#in~x=2.139095045E9, #NULL!base=0, #NULL!offset=0] [L44] ~x := #in~x; [L44] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095045E9, #NULL!base=0, #NULL!offset=0, #res=0, ~x=2.139095045E9] [L58] RET call #t~ret6 := isnan_float(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret6=0, ~res~0=2.139095045E9, ~x~0=2.139095043E9, ~y~0=2.139095045E9] [L58] assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret6=0, ~res~0=2.139095045E9, ~x~0=2.139095043E9, ~y~0=2.139095045E9] [L58] COND TRUE 0 == #t~ret6 [L58] havoc #t~ret6; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095045E9, ~x~0=2.139095043E9, ~y~0=2.139095045E9] [L59] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095045E9, ~x~0=2.139095043E9, ~y~0=2.139095045E9] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=2139095048, #NULL!offset=2139095042, old(#NULL!base)=2139095048, old(#NULL!offset)=2139095042] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=2139095048, old(#NULL!offset)=2139095042] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret7 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L54] ~x~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0); [L55] ~y~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0); VAL [#NULL!base=0, #NULL!offset=0] [L56] CALL call #t~ret5 := fmin_float(~x~0, ~y~0); VAL [#in~x=2.139095043E9, #in~y=2.139095045E9, #NULL!base=0, #NULL!offset=0] [L34-L41] ~x := #in~x; [L34-L41] ~y := #in~y; VAL [#in~x=2.139095043E9, #in~y=2.139095045E9, #NULL!base=0, #NULL!offset=0, ~x=2.139095043E9, ~y=2.139095045E9] [L35] CALL call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0] [L11-L32] ~x := #in~x; [L12] havoc ~w~0; VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0, ~x=2.139095043E9] [L15] FCALL call ~#gf_u~0 := #Ultimate.alloc(4); [L16] FCALL call write~real(~x, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L17] FCALL call #t~mem0 := read~int({ base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L17] ~w~0 := #t~mem0; [L17] FCALL call write~real(#t~union1, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L17] havoc #t~union1; [L17] havoc #t~mem0; [L15] FCALL call ULTIMATE.dealloc(~#gf_u~0); [L15] havoc ~#gf_u~0; VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095043E9] [L20] COND FALSE !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296) VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095043E9] [L22-L23] COND FALSE !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)) VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095043E9] [L25-L26] COND FALSE !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)) VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095043E9] [L28] COND FALSE !(2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296) [L31] #res := 0; VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0, #res=0, ~w~0=2139095041, ~x=2.139095043E9] [L35] RET call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=2.139095043E9, #in~y=2.139095045E9, #NULL!base=0, #NULL!offset=0, #t~ret2=0, ~x=2.139095043E9, ~y=2.139095045E9] [L35] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~x=2.139095043E9, #in~y=2.139095045E9, #NULL!base=0, #NULL!offset=0, #t~ret2=0, ~x=2.139095043E9, ~y=2.139095045E9] [L35] COND TRUE 0 == #t~ret2 [L35] havoc #t~ret2; [L36] #res := ~y; VAL [#in~x=2.139095043E9, #in~y=2.139095045E9, #NULL!base=0, #NULL!offset=0, #res=2.139095045E9, ~x=2.139095043E9, ~y=2.139095045E9] [L56] RET call #t~ret5 := fmin_float(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret5=2.139095045E9, ~x~0=2.139095043E9, ~y~0=2.139095045E9] [L56] ~res~0 := #t~ret5; [L56] havoc #t~ret5; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095045E9, ~x~0=2.139095043E9, ~y~0=2.139095045E9] [L58] CALL call #t~ret6 := isnan_float(~res~0); VAL [#in~x=2.139095045E9, #NULL!base=0, #NULL!offset=0] [L44] ~x := #in~x; [L44] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095045E9, #NULL!base=0, #NULL!offset=0, #res=0, ~x=2.139095045E9] [L58] RET call #t~ret6 := isnan_float(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret6=0, ~res~0=2.139095045E9, ~x~0=2.139095043E9, ~y~0=2.139095045E9] [L58] assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret6=0, ~res~0=2.139095045E9, ~x~0=2.139095043E9, ~y~0=2.139095045E9] [L58] COND TRUE 0 == #t~ret6 [L58] havoc #t~ret6; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095045E9, ~x~0=2.139095043E9, ~y~0=2.139095045E9] [L59] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095045E9, ~x~0=2.139095043E9, ~y~0=2.139095045E9] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=2139095048, #NULL!offset=2139095042, old(#NULL!base)=2139095048, old(#NULL!offset)=2139095042] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=2139095048, old(#NULL!offset)=2139095042] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret7 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L54] ~x~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0); [L55] ~y~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0); VAL [#NULL!base=0, #NULL!offset=0] [L56] CALL call #t~ret5 := fmin_float(~x~0, ~y~0); VAL [#in~x=2.139095043E9, #in~y=2.139095045E9, #NULL!base=0, #NULL!offset=0] [L34-L41] ~x := #in~x; [L34-L41] ~y := #in~y; VAL [#in~x=2.139095043E9, #in~y=2.139095045E9, #NULL!base=0, #NULL!offset=0, ~x=2.139095043E9, ~y=2.139095045E9] [L35] CALL call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0] [L11-L32] ~x := #in~x; [L12] havoc ~w~0; VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0, ~x=2.139095043E9] [L15] FCALL call ~#gf_u~0 := #Ultimate.alloc(4); [L16] FCALL call write~real(~x, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L17] FCALL call #t~mem0 := read~int({ base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L17] ~w~0 := #t~mem0; [L17] FCALL call write~real(#t~union1, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L17] havoc #t~union1; [L17] havoc #t~mem0; [L15] FCALL call ULTIMATE.dealloc(~#gf_u~0); [L15] havoc ~#gf_u~0; VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095043E9] [L20] COND FALSE !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296) VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095043E9] [L22-L23] COND FALSE !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)) VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095043E9] [L25-L26] COND FALSE !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)) VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095043E9] [L28] COND FALSE !(2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296) [L31] #res := 0; VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0, #res=0, ~w~0=2139095041, ~x=2.139095043E9] [L35] RET call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=2.139095043E9, #in~y=2.139095045E9, #NULL!base=0, #NULL!offset=0, #t~ret2=0, ~x=2.139095043E9, ~y=2.139095045E9] [L35] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~x=2.139095043E9, #in~y=2.139095045E9, #NULL!base=0, #NULL!offset=0, #t~ret2=0, ~x=2.139095043E9, ~y=2.139095045E9] [L35] COND TRUE 0 == #t~ret2 [L35] havoc #t~ret2; [L36] #res := ~y; VAL [#in~x=2.139095043E9, #in~y=2.139095045E9, #NULL!base=0, #NULL!offset=0, #res=2.139095045E9, ~x=2.139095043E9, ~y=2.139095045E9] [L56] RET call #t~ret5 := fmin_float(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret5=2.139095045E9, ~x~0=2.139095043E9, ~y~0=2.139095045E9] [L56] ~res~0 := #t~ret5; [L56] havoc #t~ret5; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095045E9, ~x~0=2.139095043E9, ~y~0=2.139095045E9] [L58] CALL call #t~ret6 := isnan_float(~res~0); VAL [#in~x=2.139095045E9, #NULL!base=0, #NULL!offset=0] [L44] ~x := #in~x; [L44] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095045E9, #NULL!base=0, #NULL!offset=0, #res=0, ~x=2.139095045E9] [L58] RET call #t~ret6 := isnan_float(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret6=0, ~res~0=2.139095045E9, ~x~0=2.139095043E9, ~y~0=2.139095045E9] [L58] assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret6=0, ~res~0=2.139095045E9, ~x~0=2.139095043E9, ~y~0=2.139095045E9] [L58] COND TRUE 0 == #t~ret6 [L58] havoc #t~ret6; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095045E9, ~x~0=2.139095043E9, ~y~0=2.139095045E9] [L59] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095045E9, ~x~0=2.139095043E9, ~y~0=2.139095045E9] [L54] float x = 0.0f / 0.0f; [L55] float y = 0.0f / 0.0f; [L56] CALL, EXPR fmin_float(x, y) VAL [\old(x)=2139095043, \old(y)=2139095045] [L35] CALL, EXPR __fpclassify_float(x) VAL [\old(x)=2139095043] [L12] __uint32_t w; VAL [\old(x)=2139095043, x=2139095043] [L15] ieee_float_shape_type gf_u; [L16] gf_u.value = (x) [L17] EXPR gf_u.word [L17] (w) = gf_u.word [L20] COND FALSE !(w == 0x00000000 || w == 0x80000000) VAL [\old(x)=2139095043, w=2139095041, x=2139095043] [L22-L23] COND FALSE !((w >= 0x00800000 && w <= 0x7f7fffff) || (w >= 0x80800000 && w <= 0xff7fffff)) VAL [\old(x)=2139095043, w=2139095041, x=2139095043] [L25-L26] COND FALSE !((w >= 0x00000001 && w <= 0x007fffff) || (w >= 0x80000001 && w <= 0x807fffff)) VAL [\old(x)=2139095043, w=2139095041, x=2139095043] [L28] COND FALSE !(w == 0x7f800000 || w == 0xff800000) [L31] return 0; VAL [\old(x)=2139095043, \result=0, w=2139095041, x=2139095043] [L35] RET, EXPR __fpclassify_float(x) VAL [\old(x)=2139095043, \old(y)=2139095045, __fpclassify_float(x)=0, x=2139095043, y=2139095045] [L35] COND TRUE __fpclassify_float(x) == 0 [L36] return y; VAL [\old(x)=2139095043, \old(y)=2139095045, \result=2139095045, x=2139095043, y=2139095045] [L56] RET, EXPR fmin_float(x, y) VAL [fmin_float(x, y)=2139095045, x=2139095043, y=2139095045] [L56] float res = fmin_float(x, y); [L58] CALL, EXPR isnan_float(res) VAL [\old(x)=2139095045] [L44] return x != x; VAL [\old(x)=2139095045, \result=0, x=2139095045] [L58] RET, EXPR isnan_float(res) VAL [isnan_float(res)=0, res=2139095045, x=2139095043, y=2139095045] [L58] COND TRUE !isnan_float(res) [L59] __VERIFIER_error() VAL [res=2139095045, x=2139095043, y=2139095045] ----- [2018-11-22 21:30:57,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 09:30:57 BoogieIcfgContainer [2018-11-22 21:30:57,036 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-22 21:30:57,037 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 21:30:57,037 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 21:30:57,037 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 21:30:57,038 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:30:56" (3/4) ... [2018-11-22 21:30:57,040 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-22 21:30:57,040 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 21:30:57,041 INFO L168 Benchmark]: Toolchain (without parser) took 1007.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 176.2 MB). Free memory was 959.1 MB in the beginning and 1.1 GB in the end (delta: -138.1 MB). Peak memory consumption was 38.0 MB. Max. memory is 11.5 GB. [2018-11-22 21:30:57,042 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 21:30:57,042 INFO L168 Benchmark]: CACSL2BoogieTranslator took 173.87 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 945.7 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-22 21:30:57,043 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.17 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 21:30:57,043 INFO L168 Benchmark]: Boogie Preprocessor took 55.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 176.2 MB). Free memory was 945.7 MB in the beginning and 1.2 GB in the end (delta: -225.6 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-22 21:30:57,044 INFO L168 Benchmark]: RCFGBuilder took 231.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. [2018-11-22 21:30:57,044 INFO L168 Benchmark]: TraceAbstraction took 523.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 11.5 GB. [2018-11-22 21:30:57,045 INFO L168 Benchmark]: Witness Printer took 3.69 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 21:30:57,047 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 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 173.87 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 945.7 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 55.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 176.2 MB). Free memory was 945.7 MB in the beginning and 1.2 GB in the end (delta: -225.6 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 231.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 523.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 11.5 GB. * Witness Printer took 3.69 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 59]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 44, overapproximation of someBinaryArithmeticFLOAToperation at line 54. Possible FailurePath: [L54] float x = 0.0f / 0.0f; [L55] float y = 0.0f / 0.0f; [L56] CALL, EXPR fmin_float(x, y) VAL [\old(x)=2139095043, \old(y)=2139095045] [L35] CALL, EXPR __fpclassify_float(x) VAL [\old(x)=2139095043] [L12] __uint32_t w; VAL [\old(x)=2139095043, x=2139095043] [L15] ieee_float_shape_type gf_u; [L16] gf_u.value = (x) [L17] EXPR gf_u.word [L17] (w) = gf_u.word [L20] COND FALSE !(w == 0x00000000 || w == 0x80000000) VAL [\old(x)=2139095043, w=2139095041, x=2139095043] [L22-L23] COND FALSE !((w >= 0x00800000 && w <= 0x7f7fffff) || (w >= 0x80800000 && w <= 0xff7fffff)) VAL [\old(x)=2139095043, w=2139095041, x=2139095043] [L25-L26] COND FALSE !((w >= 0x00000001 && w <= 0x007fffff) || (w >= 0x80000001 && w <= 0x807fffff)) VAL [\old(x)=2139095043, w=2139095041, x=2139095043] [L28] COND FALSE !(w == 0x7f800000 || w == 0xff800000) [L31] return 0; VAL [\old(x)=2139095043, \result=0, w=2139095041, x=2139095043] [L35] RET, EXPR __fpclassify_float(x) VAL [\old(x)=2139095043, \old(y)=2139095045, __fpclassify_float(x)=0, x=2139095043, y=2139095045] [L35] COND TRUE __fpclassify_float(x) == 0 [L36] return y; VAL [\old(x)=2139095043, \old(y)=2139095045, \result=2139095045, x=2139095043, y=2139095045] [L56] RET, EXPR fmin_float(x, y) VAL [fmin_float(x, y)=2139095045, x=2139095043, y=2139095045] [L56] float res = fmin_float(x, y); [L58] CALL, EXPR isnan_float(res) VAL [\old(x)=2139095045] [L44] return x != x; VAL [\old(x)=2139095045, \result=0, x=2139095045] [L58] RET, EXPR isnan_float(res) VAL [isnan_float(res)=0, res=2139095045, x=2139095043, y=2139095045] [L58] COND TRUE !isnan_float(res) [L59] __VERIFIER_error() VAL [res=2139095045, x=2139095043, y=2139095045] - 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-22 21:30:58,433 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 21:30:58,434 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 21:30:58,443 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 21:30:58,443 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 21:30:58,444 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 21:30:58,445 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 21:30:58,446 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 21:30:58,447 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 21:30:58,448 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 21:30:58,449 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 21:30:58,449 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 21:30:58,449 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 21:30:58,450 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 21:30:58,451 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 21:30:58,452 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 21:30:58,452 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 21:30:58,453 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 21:30:58,455 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 21:30:58,456 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 21:30:58,457 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 21:30:58,457 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 21:30:58,459 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 21:30:58,459 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 21:30:58,459 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 21:30:58,460 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 21:30:58,461 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 21:30:58,461 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 21:30:58,462 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 21:30:58,463 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 21:30:58,463 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 21:30:58,463 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 21:30:58,464 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 21:30:58,464 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 21:30:58,464 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 21:30:58,465 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 21:30:58,465 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6a0c05a5-f13c-46a8-827b-cc51dcc40a61/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-11-22 21:30:58,475 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 21:30:58,476 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 21:30:58,476 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-22 21:30:58,476 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-22 21:30:58,477 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-22 21:30:58,477 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-22 21:30:58,477 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-22 21:30:58,477 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-22 21:30:58,477 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-22 21:30:58,477 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-22 21:30:58,478 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 21:30:58,478 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-22 21:30:58,478 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-22 21:30:58,478 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 21:30:58,479 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-22 21:30:58,479 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-22 21:30:58,479 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-22 21:30:58,479 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-22 21:30:58,479 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-22 21:30:58,479 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-22 21:30:58,479 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 21:30:58,480 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 21:30:58,480 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-22 21:30:58,480 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 21:30:58,480 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 21:30:58,480 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-22 21:30:58,480 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-22 21:30:58,481 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-22 21:30:58,481 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 21:30:58,481 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-22 21:30:58,481 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-22 21:30:58,481 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-22 21:30:58,481 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-22 21:30:58,481 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-22 21:30:58,482 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-22 21:30:58,482 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_6a0c05a5-f13c-46a8-827b-cc51dcc40a61/bin-2019/utaipan 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 -> Taipan 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 -> 31da98a788dd1938c78053bade42bc512d4e8954 [2018-11-22 21:30:58,512 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 21:30:58,521 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 21:30:58,524 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 21:30:58,525 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 21:30:58,525 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 21:30:58,526 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6a0c05a5-f13c-46a8-827b-cc51dcc40a61/bin-2019/utaipan/../../sv-benchmarks/c/float-newlib/float_req_bl_1230_true-unreach-call.c [2018-11-22 21:30:58,571 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6a0c05a5-f13c-46a8-827b-cc51dcc40a61/bin-2019/utaipan/data/b54a40243/19caa2cf2c75441daea951c806e75c83/FLAGa38bc36b1 [2018-11-22 21:30:58,965 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 21:30:58,966 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6a0c05a5-f13c-46a8-827b-cc51dcc40a61/sv-benchmarks/c/float-newlib/float_req_bl_1230_true-unreach-call.c [2018-11-22 21:30:58,970 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6a0c05a5-f13c-46a8-827b-cc51dcc40a61/bin-2019/utaipan/data/b54a40243/19caa2cf2c75441daea951c806e75c83/FLAGa38bc36b1 [2018-11-22 21:30:58,981 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6a0c05a5-f13c-46a8-827b-cc51dcc40a61/bin-2019/utaipan/data/b54a40243/19caa2cf2c75441daea951c806e75c83 [2018-11-22 21:30:58,983 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 21:30:58,983 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 21:30:58,984 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 21:30:58,984 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 21:30:58,987 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 21:30:58,988 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:30:58" (1/1) ... [2018-11-22 21:30:58,990 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29d0518e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:58, skipping insertion in model container [2018-11-22 21:30:58,990 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:30:58" (1/1) ... [2018-11-22 21:30:58,996 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 21:30:59,012 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 21:30:59,142 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 21:30:59,146 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 21:30:59,160 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 21:30:59,174 INFO L195 MainTranslator]: Completed translation [2018-11-22 21:30:59,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:59 WrapperNode [2018-11-22 21:30:59,175 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 21:30:59,175 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 21:30:59,175 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 21:30:59,176 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 21:30:59,180 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:59" (1/1) ... [2018-11-22 21:30:59,186 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:59" (1/1) ... [2018-11-22 21:30:59,191 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 21:30:59,192 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 21:30:59,192 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 21:30:59,192 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 21:30:59,197 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:59" (1/1) ... [2018-11-22 21:30:59,198 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:59" (1/1) ... [2018-11-22 21:30:59,200 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:59" (1/1) ... [2018-11-22 21:30:59,200 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:59" (1/1) ... [2018-11-22 21:30:59,208 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:59" (1/1) ... [2018-11-22 21:30:59,212 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:59" (1/1) ... [2018-11-22 21:30:59,214 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:59" (1/1) ... [2018-11-22 21:30:59,216 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 21:30:59,217 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 21:30:59,217 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 21:30:59,217 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 21:30:59,217 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:59" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a0c05a5-f13c-46a8-827b-cc51dcc40a61/bin-2019/utaipan/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-22 21:30:59,304 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_float [2018-11-22 21:30:59,304 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_float [2018-11-22 21:30:59,304 INFO L130 BoogieDeclarations]: Found specification of procedure fmin_float [2018-11-22 21:30:59,304 INFO L138 BoogieDeclarations]: Found implementation of procedure fmin_float [2018-11-22 21:30:59,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-22 21:30:59,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-22 21:30:59,304 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-22 21:30:59,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-22 21:30:59,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 21:30:59,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 21:30:59,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2018-11-22 21:30:59,305 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-22 21:30:59,305 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-22 21:30:59,305 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2018-11-22 21:30:59,305 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2018-11-22 21:30:59,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-22 21:30:59,456 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-22 21:30:59,479 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 21:30:59,479 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-22 21:30:59,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:30:59 BoogieIcfgContainer [2018-11-22 21:30:59,479 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 21:30:59,480 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-22 21:30:59,480 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-22 21:30:59,482 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-22 21:30:59,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:30:58" (1/3) ... [2018-11-22 21:30:59,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dbe6d3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:30:59, skipping insertion in model container [2018-11-22 21:30:59,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:59" (2/3) ... [2018-11-22 21:30:59,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dbe6d3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:30:59, skipping insertion in model container [2018-11-22 21:30:59,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:30:59" (3/3) ... [2018-11-22 21:30:59,484 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1230_true-unreach-call.c [2018-11-22 21:30:59,490 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-22 21:30:59,496 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-22 21:30:59,508 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-22 21:30:59,528 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-22 21:30:59,529 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-22 21:30:59,529 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-22 21:30:59,529 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-22 21:30:59,529 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 21:30:59,529 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 21:30:59,529 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-22 21:30:59,530 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 21:30:59,530 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-22 21:30:59,540 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2018-11-22 21:30:59,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-22 21:30:59,544 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:30:59,544 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-22 21:30:59,546 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:30:59,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:30:59,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1898238320, now seen corresponding path program 1 times [2018-11-22 21:30:59,552 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-22 21:30:59,552 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a0c05a5-f13c-46a8-827b-cc51dcc40a61/bin-2019/utaipan/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-22 21:30:59,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:30:59,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:30:59,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:30:59,616 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-22 21:30:59,616 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 21:30:59,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:30:59,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-22 21:30:59,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-22 21:30:59,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-22 21:30:59,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-22 21:30:59,636 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 2 states. [2018-11-22 21:30:59,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:30:59,651 INFO L93 Difference]: Finished difference Result 65 states and 86 transitions. [2018-11-22 21:30:59,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-22 21:30:59,653 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2018-11-22 21:30:59,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:30:59,661 INFO L225 Difference]: With dead ends: 65 [2018-11-22 21:30:59,661 INFO L226 Difference]: Without dead ends: 33 [2018-11-22 21:30:59,664 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-22 21:30:59,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-22 21:30:59,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-22 21:30:59,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-22 21:30:59,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2018-11-22 21:30:59,691 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 24 [2018-11-22 21:30:59,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:30:59,692 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2018-11-22 21:30:59,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-22 21:30:59,692 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2018-11-22 21:30:59,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-22 21:30:59,694 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:30:59,694 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-22 21:30:59,694 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:30:59,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:30:59,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1313917914, now seen corresponding path program 1 times [2018-11-22 21:30:59,695 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-22 21:30:59,695 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a0c05a5-f13c-46a8-827b-cc51dcc40a61/bin-2019/utaipan/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-22 21:30:59,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:30:59,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:30:59,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:30:59,767 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-22 21:30:59,767 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 21:30:59,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:30:59,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-22 21:30:59,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-22 21:30:59,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 21:30:59,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 21:30:59,780 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand 4 states. [2018-11-22 21:30:59,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:30:59,820 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-11-22 21:30:59,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-22 21:30:59,821 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-11-22 21:30:59,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:30:59,823 INFO L225 Difference]: With dead ends: 46 [2018-11-22 21:30:59,823 INFO L226 Difference]: Without dead ends: 36 [2018-11-22 21:30:59,824 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-22 21:30:59,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-22 21:30:59,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-22 21:30:59,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-22 21:30:59,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2018-11-22 21:30:59,831 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 25 [2018-11-22 21:30:59,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:30:59,831 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2018-11-22 21:30:59,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-22 21:30:59,832 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2018-11-22 21:30:59,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-22 21:30:59,832 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:30:59,832 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-22 21:30:59,833 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:30:59,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:30:59,833 INFO L82 PathProgramCache]: Analyzing trace with hash 659959827, now seen corresponding path program 1 times [2018-11-22 21:30:59,833 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-22 21:30:59,833 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a0c05a5-f13c-46a8-827b-cc51dcc40a61/bin-2019/utaipan/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-22 21:30:59,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:30:59,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:30:59,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:30:59,897 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-22 21:30:59,897 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 21:30:59,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:30:59,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-22 21:30:59,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-22 21:30:59,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 21:30:59,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 21:30:59,909 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand 4 states. [2018-11-22 21:30:59,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:30:59,950 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2018-11-22 21:30:59,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-22 21:30:59,951 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-11-22 21:30:59,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:30:59,952 INFO L225 Difference]: With dead ends: 49 [2018-11-22 21:30:59,952 INFO L226 Difference]: Without dead ends: 39 [2018-11-22 21:30:59,952 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-22 21:30:59,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-22 21:30:59,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2018-11-22 21:30:59,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-22 21:30:59,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2018-11-22 21:30:59,957 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 26 [2018-11-22 21:30:59,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:30:59,957 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2018-11-22 21:30:59,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-22 21:30:59,957 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2018-11-22 21:30:59,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-22 21:30:59,958 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:30:59,958 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-22 21:30:59,959 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:30:59,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:30:59,959 INFO L82 PathProgramCache]: Analyzing trace with hash 547015626, now seen corresponding path program 1 times [2018-11-22 21:30:59,959 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-22 21:30:59,959 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a0c05a5-f13c-46a8-827b-cc51dcc40a61/bin-2019/utaipan/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-22 21:30:59,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:30:59,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:30:59,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:31:00,017 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-22 21:31:00,018 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 21:31:00,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:31:00,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-22 21:31:00,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-22 21:31:00,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 21:31:00,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 21:31:00,025 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand 4 states. [2018-11-22 21:31:00,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:31:00,041 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2018-11-22 21:31:00,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-22 21:31:00,042 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-11-22 21:31:00,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:31:00,043 INFO L225 Difference]: With dead ends: 49 [2018-11-22 21:31:00,043 INFO L226 Difference]: Without dead ends: 39 [2018-11-22 21:31:00,043 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-22 21:31:00,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-22 21:31:00,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2018-11-22 21:31:00,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-22 21:31:00,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2018-11-22 21:31:00,048 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 27 [2018-11-22 21:31:00,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:31:00,049 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2018-11-22 21:31:00,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-22 21:31:00,049 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2018-11-22 21:31:00,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-22 21:31:00,050 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:31:00,050 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-22 21:31:00,050 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:31:00,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:31:00,050 INFO L82 PathProgramCache]: Analyzing trace with hash 167100663, now seen corresponding path program 1 times [2018-11-22 21:31:00,050 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-22 21:31:00,050 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a0c05a5-f13c-46a8-827b-cc51dcc40a61/bin-2019/utaipan/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-22 21:31:00,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:31:00,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:31:00,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:31:00,102 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-22 21:31:00,102 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 21:31:00,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:31:00,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-22 21:31:00,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-22 21:31:00,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 21:31:00,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 21:31:00,111 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand 4 states. [2018-11-22 21:31:00,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:31:00,133 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2018-11-22 21:31:00,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-22 21:31:00,137 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-11-22 21:31:00,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:31:00,138 INFO L225 Difference]: With dead ends: 49 [2018-11-22 21:31:00,138 INFO L226 Difference]: Without dead ends: 39 [2018-11-22 21:31:00,139 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-22 21:31:00,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-22 21:31:00,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2018-11-22 21:31:00,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-22 21:31:00,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2018-11-22 21:31:00,143 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 28 [2018-11-22 21:31:00,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:31:00,144 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2018-11-22 21:31:00,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-22 21:31:00,144 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2018-11-22 21:31:00,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-22 21:31:00,145 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:31:00,145 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-22 21:31:00,145 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:31:00,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:31:00,145 INFO L82 PathProgramCache]: Analyzing trace with hash -126302344, now seen corresponding path program 1 times [2018-11-22 21:31:00,146 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-22 21:31:00,146 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a0c05a5-f13c-46a8-827b-cc51dcc40a61/bin-2019/utaipan/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-22 21:31:00,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:31:00,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:31:00,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:31:00,346 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-22 21:31:00,347 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 21:31:00,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:31:00,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-22 21:31:00,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-22 21:31:00,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-22 21:31:00,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-22 21:31:00,361 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand 9 states. [2018-11-22 21:31:00,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:31:00,613 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2018-11-22 21:31:00,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-22 21:31:00,613 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-11-22 21:31:00,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:31:00,614 INFO L225 Difference]: With dead ends: 43 [2018-11-22 21:31:00,614 INFO L226 Difference]: Without dead ends: 36 [2018-11-22 21:31:00,615 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-22 21:31:00,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-22 21:31:00,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2018-11-22 21:31:00,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-22 21:31:00,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2018-11-22 21:31:00,620 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 28 [2018-11-22 21:31:00,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:31:00,620 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2018-11-22 21:31:00,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-22 21:31:00,620 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2018-11-22 21:31:00,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-22 21:31:00,621 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:31:00,621 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-22 21:31:00,622 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:31:00,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:31:00,623 INFO L82 PathProgramCache]: Analyzing trace with hash -114502674, now seen corresponding path program 1 times [2018-11-22 21:31:00,623 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-22 21:31:00,623 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a0c05a5-f13c-46a8-827b-cc51dcc40a61/bin-2019/utaipan/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-22 21:31:00,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:31:00,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:31:00,675 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:31:00,696 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-22 21:31:00,697 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 21:31:00,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:31:00,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-22 21:31:00,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-22 21:31:00,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 21:31:00,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 21:31:00,708 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand 4 states. [2018-11-22 21:31:00,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:31:00,722 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2018-11-22 21:31:00,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-22 21:31:00,723 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2018-11-22 21:31:00,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:31:00,723 INFO L225 Difference]: With dead ends: 46 [2018-11-22 21:31:00,724 INFO L226 Difference]: Without dead ends: 36 [2018-11-22 21:31:00,724 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-22 21:31:00,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-22 21:31:00,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-22 21:31:00,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-22 21:31:00,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2018-11-22 21:31:00,729 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 33 [2018-11-22 21:31:00,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:31:00,729 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2018-11-22 21:31:00,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-22 21:31:00,729 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2018-11-22 21:31:00,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-22 21:31:00,731 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:31:00,731 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-22 21:31:00,731 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:31:00,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:31:00,732 INFO L82 PathProgramCache]: Analyzing trace with hash -957719579, now seen corresponding path program 1 times [2018-11-22 21:31:00,732 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-22 21:31:00,732 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a0c05a5-f13c-46a8-827b-cc51dcc40a61/bin-2019/utaipan/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-22 21:31:00,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:31:00,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:31:00,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:31:00,788 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-22 21:31:00,788 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 21:31:00,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:31:00,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-22 21:31:00,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-22 21:31:00,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 21:31:00,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 21:31:00,796 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand 4 states. [2018-11-22 21:31:00,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:31:00,811 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2018-11-22 21:31:00,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-22 21:31:00,812 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-11-22 21:31:00,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:31:00,812 INFO L225 Difference]: With dead ends: 49 [2018-11-22 21:31:00,812 INFO L226 Difference]: Without dead ends: 39 [2018-11-22 21:31:00,813 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-22 21:31:00,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-22 21:31:00,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2018-11-22 21:31:00,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-22 21:31:00,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2018-11-22 21:31:00,816 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 34 [2018-11-22 21:31:00,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:31:00,816 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2018-11-22 21:31:00,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-22 21:31:00,817 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2018-11-22 21:31:00,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-22 21:31:00,817 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:31:00,817 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-22 21:31:00,817 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:31:00,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:31:00,818 INFO L82 PathProgramCache]: Analyzing trace with hash -2106425557, now seen corresponding path program 1 times [2018-11-22 21:31:00,818 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-22 21:31:00,818 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a0c05a5-f13c-46a8-827b-cc51dcc40a61/bin-2019/utaipan/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-22 21:31:00,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:31:00,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:31:00,859 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:31:01,006 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-22 21:31:01,006 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 21:31:01,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:31:01,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-22 21:31:01,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-22 21:31:01,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-22 21:31:01,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-22 21:31:01,015 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand 10 states. [2018-11-22 21:31:01,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:31:01,255 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2018-11-22 21:31:01,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-22 21:31:01,256 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2018-11-22 21:31:01,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:31:01,257 INFO L225 Difference]: With dead ends: 44 [2018-11-22 21:31:01,257 INFO L226 Difference]: Without dead ends: 36 [2018-11-22 21:31:01,257 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-22 21:31:01,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-22 21:31:01,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-22 21:31:01,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-22 21:31:01,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2018-11-22 21:31:01,260 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 35 [2018-11-22 21:31:01,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:31:01,260 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2018-11-22 21:31:01,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-22 21:31:01,261 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2018-11-22 21:31:01,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-22 21:31:01,261 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:31:01,261 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-22 21:31:01,262 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:31:01,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:31:01,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1487477161, now seen corresponding path program 1 times [2018-11-22 21:31:01,262 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-22 21:31:01,262 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a0c05a5-f13c-46a8-827b-cc51dcc40a61/bin-2019/utaipan/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-22 21:31:01,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:31:01,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:31:01,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:31:01,364 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-22 21:31:01,364 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 21:31:01,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:31:01,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-22 21:31:01,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-22 21:31:01,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-22 21:31:01,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-22 21:31:01,372 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand 5 states. [2018-11-22 21:31:01,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:31:01,471 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-11-22 21:31:01,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-22 21:31:01,472 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-11-22 21:31:01,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:31:01,473 INFO L225 Difference]: With dead ends: 46 [2018-11-22 21:31:01,473 INFO L226 Difference]: Without dead ends: 33 [2018-11-22 21:31:01,473 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-22 21:31:01,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-22 21:31:01,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-22 21:31:01,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-22 21:31:01,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-22 21:31:01,476 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 35 [2018-11-22 21:31:01,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:31:01,476 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-22 21:31:01,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-22 21:31:01,476 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-22 21:31:01,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-22 21:31:01,477 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:31:01,477 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-22 21:31:01,477 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:31:01,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:31:01,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1793715410, now seen corresponding path program 1 times [2018-11-22 21:31:01,478 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-22 21:31:01,478 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a0c05a5-f13c-46a8-827b-cc51dcc40a61/bin-2019/utaipan/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-22 21:31:01,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:31:01,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:31:01,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:31:01,517 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-22 21:31:01,517 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 21:31:01,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:31:01,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-22 21:31:01,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-22 21:31:01,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 21:31:01,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 21:31:01,525 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 4 states. [2018-11-22 21:31:01,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:31:01,533 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2018-11-22 21:31:01,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-22 21:31:01,533 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-11-22 21:31:01,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:31:01,534 INFO L225 Difference]: With dead ends: 46 [2018-11-22 21:31:01,534 INFO L226 Difference]: Without dead ends: 35 [2018-11-22 21:31:01,535 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-22 21:31:01,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-22 21:31:01,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-11-22 21:31:01,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-22 21:31:01,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-22 21:31:01,538 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 35 [2018-11-22 21:31:01,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:31:01,538 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-22 21:31:01,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-22 21:31:01,539 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-22 21:31:01,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-22 21:31:01,539 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:31:01,539 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-22 21:31:01,539 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:31:01,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:31:01,540 INFO L82 PathProgramCache]: Analyzing trace with hash 15242121, now seen corresponding path program 1 times [2018-11-22 21:31:01,540 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-22 21:31:01,540 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a0c05a5-f13c-46a8-827b-cc51dcc40a61/bin-2019/utaipan/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-22 21:31:01,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:31:01,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:31:01,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:31:01,593 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-22 21:31:01,593 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 21:31:01,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:31:01,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-22 21:31:01,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-22 21:31:01,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 21:31:01,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 21:31:01,601 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 4 states. [2018-11-22 21:31:01,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:31:01,619 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2018-11-22 21:31:01,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-22 21:31:01,620 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-11-22 21:31:01,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:31:01,620 INFO L225 Difference]: With dead ends: 46 [2018-11-22 21:31:01,620 INFO L226 Difference]: Without dead ends: 35 [2018-11-22 21:31:01,621 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-22 21:31:01,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-22 21:31:01,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-11-22 21:31:01,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-22 21:31:01,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-22 21:31:01,625 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 36 [2018-11-22 21:31:01,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:31:01,625 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-22 21:31:01,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-22 21:31:01,625 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-22 21:31:01,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-22 21:31:01,626 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:31:01,626 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-22 21:31:01,626 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:31:01,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:31:01,627 INFO L82 PathProgramCache]: Analyzing trace with hash -278160886, now seen corresponding path program 1 times [2018-11-22 21:31:01,627 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-22 21:31:01,627 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a0c05a5-f13c-46a8-827b-cc51dcc40a61/bin-2019/utaipan/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-22 21:31:01,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:31:01,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:31:01,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:31:01,782 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-22 21:31:01,782 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 21:31:01,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:31:01,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-22 21:31:01,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-22 21:31:01,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-22 21:31:01,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-22 21:31:01,795 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 9 states. [2018-11-22 21:31:01,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:31:01,916 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-11-22 21:31:01,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-22 21:31:01,916 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2018-11-22 21:31:01,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:31:01,916 INFO L225 Difference]: With dead ends: 33 [2018-11-22 21:31:01,916 INFO L226 Difference]: Without dead ends: 0 [2018-11-22 21:31:01,917 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-22 21:31:01,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-22 21:31:01,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-22 21:31:01,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-22 21:31:01,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-22 21:31:01,917 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2018-11-22 21:31:01,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:31:01,917 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 21:31:01,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-22 21:31:01,918 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-22 21:31:01,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-22 21:31:01,921 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-22 21:31:02,016 INFO L448 ceAbstractionStarter]: For program point isnan_floatFINAL(line 44) no Hoare annotation was computed. [2018-11-22 21:31:02,017 INFO L451 ceAbstractionStarter]: At program point isnan_floatENTRY(line 44) the Hoare annotation is: true [2018-11-22 21:31:02,017 INFO L448 ceAbstractionStarter]: For program point isnan_floatEXIT(line 44) no Hoare annotation was computed. [2018-11-22 21:31:02,017 INFO L451 ceAbstractionStarter]: At program point fmin_floatENTRY(lines 34 41) the Hoare annotation is: true [2018-11-22 21:31:02,017 INFO L448 ceAbstractionStarter]: For program point fmin_floatEXIT(lines 34 41) no Hoare annotation was computed. [2018-11-22 21:31:02,017 INFO L448 ceAbstractionStarter]: For program point fmin_floatFINAL(lines 34 41) no Hoare annotation was computed. [2018-11-22 21:31:02,017 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-11-22 21:31:02,017 INFO L448 ceAbstractionStarter]: For program point L40-2(line 40) no Hoare annotation was computed. [2018-11-22 21:31:02,017 INFO L444 ceAbstractionStarter]: At program point L37(line 37) the Hoare annotation is: (and (= fmin_float_~x |fmin_float_#in~x|) (= fmin_float_~y |fmin_float_#in~y|)) [2018-11-22 21:31:02,017 INFO L448 ceAbstractionStarter]: For program point L37-1(lines 37 38) no Hoare annotation was computed. [2018-11-22 21:31:02,017 INFO L444 ceAbstractionStarter]: At program point L35(line 35) the Hoare annotation is: (and (= fmin_float_~x |fmin_float_#in~x|) (= fmin_float_~y |fmin_float_#in~y|)) [2018-11-22 21:31:02,018 INFO L448 ceAbstractionStarter]: For program point L35-1(lines 35 36) no Hoare annotation was computed. [2018-11-22 21:31:02,018 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-22 21:31:02,018 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-22 21:31:02,018 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-22 21:31:02,018 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-22 21:31:02,018 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-22 21:31:02,018 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-22 21:31:02,018 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-22 21:31:02,018 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 46 64) the Hoare annotation is: true [2018-11-22 21:31:02,018 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 46 64) no Hoare annotation was computed. [2018-11-22 21:31:02,018 INFO L448 ceAbstractionStarter]: For program point L59(line 59) no Hoare annotation was computed. [2018-11-22 21:31:02,018 INFO L444 ceAbstractionStarter]: At program point L58(line 58) 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-22 21:31:02,018 INFO L448 ceAbstractionStarter]: For program point L58-1(lines 58 61) no Hoare annotation was computed. [2018-11-22 21:31:02,019 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 46 64) no Hoare annotation was computed. [2018-11-22 21:31:02,019 INFO L444 ceAbstractionStarter]: At program point L56(line 56) 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-22 21:31:02,019 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 59) no Hoare annotation was computed. [2018-11-22 21:31:02,019 INFO L448 ceAbstractionStarter]: For program point L56-1(line 56) no Hoare annotation was computed. [2018-11-22 21:31:02,019 INFO L448 ceAbstractionStarter]: For program point __fpclassify_floatFINAL(lines 11 32) no Hoare annotation was computed. [2018-11-22 21:31:02,019 INFO L448 ceAbstractionStarter]: For program point L25(lines 25 31) no Hoare annotation was computed. [2018-11-22 21:31:02,019 INFO L448 ceAbstractionStarter]: For program point L28(lines 28 31) no Hoare annotation was computed. [2018-11-22 21:31:02,019 INFO L448 ceAbstractionStarter]: For program point L22(lines 22 31) no Hoare annotation was computed. [2018-11-22 21:31:02,019 INFO L448 ceAbstractionStarter]: For program point L14-1(lines 14 18) no Hoare annotation was computed. [2018-11-22 21:31:02,019 INFO L451 ceAbstractionStarter]: At program point __fpclassify_floatENTRY(lines 11 32) the Hoare annotation is: true [2018-11-22 21:31:02,019 INFO L451 ceAbstractionStarter]: At program point L14-2(lines 14 18) the Hoare annotation is: true [2018-11-22 21:31:02,019 INFO L448 ceAbstractionStarter]: For program point L14-3(lines 11 32) no Hoare annotation was computed. [2018-11-22 21:31:02,019 INFO L448 ceAbstractionStarter]: For program point __fpclassify_floatEXIT(lines 11 32) no Hoare annotation was computed. [2018-11-22 21:31:02,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 09:31:02 BoogieIcfgContainer [2018-11-22 21:31:02,026 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-22 21:31:02,026 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 21:31:02,026 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 21:31:02,026 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 21:31:02,027 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:30:59" (3/4) ... [2018-11-22 21:31:02,029 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-22 21:31:02,033 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure isnan_float [2018-11-22 21:31:02,034 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fmin_float [2018-11-22 21:31:02,034 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-22 21:31:02,034 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-22 21:31:02,034 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __fpclassify_float [2018-11-22 21:31:02,037 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2018-11-22 21:31:02,037 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-22 21:31:02,037 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-22 21:31:02,071 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_6a0c05a5-f13c-46a8-827b-cc51dcc40a61/bin-2019/utaipan/witness.graphml [2018-11-22 21:31:02,072 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 21:31:02,072 INFO L168 Benchmark]: Toolchain (without parser) took 3089.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 213.4 MB). Free memory was 949.7 MB in the beginning and 1.2 GB in the end (delta: -238.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 21:31:02,073 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 21:31:02,074 INFO L168 Benchmark]: CACSL2BoogieTranslator took 191.00 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 933.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-22 21:31:02,074 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.02 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 21:31:02,074 INFO L168 Benchmark]: Boogie Preprocessor took 24.66 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 21:31:02,074 INFO L168 Benchmark]: RCFGBuilder took 262.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -190.7 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. [2018-11-22 21:31:02,075 INFO L168 Benchmark]: TraceAbstraction took 2545.87 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 59.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -71.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 21:31:02,075 INFO L168 Benchmark]: Witness Printer took 45.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-11-22 21:31:02,077 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.16 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 191.00 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 933.6 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 16.02 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.66 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 262.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -190.7 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2545.87 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 59.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -71.0 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 45.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 59]: 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: 14]: 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.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 497 SDtfs, 31 SDslu, 1313 SDs, 0 SdLazy, 224 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, 21389 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...