./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_1250_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ae489eb7-ea58-49db-963e-bdef2ba600fc/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ae489eb7-ea58-49db-963e-bdef2ba600fc/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ae489eb7-ea58-49db-963e-bdef2ba600fc/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ae489eb7-ea58-49db-963e-bdef2ba600fc/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1250_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_ae489eb7-ea58-49db-963e-bdef2ba600fc/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ae489eb7-ea58-49db-963e-bdef2ba600fc/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 01b6390e563edc58f3f7d1f239b082df891f9006 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_ae489eb7-ea58-49db-963e-bdef2ba600fc/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ae489eb7-ea58-49db-963e-bdef2ba600fc/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ae489eb7-ea58-49db-963e-bdef2ba600fc/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ae489eb7-ea58-49db-963e-bdef2ba600fc/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1250_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_ae489eb7-ea58-49db-963e-bdef2ba600fc/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ae489eb7-ea58-49db-963e-bdef2ba600fc/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 01b6390e563edc58f3f7d1f239b082df891f9006 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 02:36:56,801 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 02:36:56,802 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 02:36:56,809 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 02:36:56,809 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 02:36:56,810 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 02:36:56,811 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 02:36:56,812 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 02:36:56,813 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 02:36:56,813 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 02:36:56,814 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 02:36:56,814 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 02:36:56,815 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 02:36:56,815 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 02:36:56,816 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 02:36:56,817 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 02:36:56,817 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 02:36:56,819 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 02:36:56,820 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 02:36:56,821 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 02:36:56,822 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 02:36:56,822 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 02:36:56,824 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 02:36:56,824 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 02:36:56,824 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 02:36:56,825 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 02:36:56,826 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 02:36:56,826 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 02:36:56,827 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 02:36:56,827 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 02:36:56,828 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 02:36:56,828 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 02:36:56,828 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 02:36:56,828 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 02:36:56,829 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 02:36:56,830 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 02:36:56,830 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ae489eb7-ea58-49db-963e-bdef2ba600fc/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 02:36:56,839 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 02:36:56,839 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 02:36:56,840 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 02:36:56,840 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 02:36:56,840 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 02:36:56,840 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 02:36:56,840 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 02:36:56,840 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 02:36:56,840 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 02:36:56,840 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 02:36:56,841 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 02:36:56,841 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 02:36:56,841 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 02:36:56,841 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 02:36:56,841 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 02:36:56,842 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 02:36:56,842 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 02:36:56,842 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 02:36:56,842 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 02:36:56,842 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 02:36:56,842 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 02:36:56,842 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 02:36:56,843 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 02:36:56,843 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 02:36:56,843 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 02:36:56,843 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 02:36:56,843 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 02:36:56,843 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 02:36:56,843 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 02:36:56,843 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 02:36:56,844 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 02:36:56,844 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 02:36:56,844 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 02:36:56,844 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 02:36:56,844 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 02:36:56,844 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 02:36:56,844 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 02:36:56,844 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_ae489eb7-ea58-49db-963e-bdef2ba600fc/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 -> 01b6390e563edc58f3f7d1f239b082df891f9006 [2018-11-23 02:36:56,867 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 02:36:56,876 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 02:36:56,878 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 02:36:56,879 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 02:36:56,879 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 02:36:56,879 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ae489eb7-ea58-49db-963e-bdef2ba600fc/bin-2019/utaipan/../../sv-benchmarks/c/float-newlib/double_req_bl_1250_true-unreach-call.c [2018-11-23 02:36:56,916 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ae489eb7-ea58-49db-963e-bdef2ba600fc/bin-2019/utaipan/data/11bfecbd3/f2cecb0364d74e3b92a2921fe37c2436/FLAGe7dfa780b [2018-11-23 02:36:57,227 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 02:36:57,228 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ae489eb7-ea58-49db-963e-bdef2ba600fc/sv-benchmarks/c/float-newlib/double_req_bl_1250_true-unreach-call.c [2018-11-23 02:36:57,233 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ae489eb7-ea58-49db-963e-bdef2ba600fc/bin-2019/utaipan/data/11bfecbd3/f2cecb0364d74e3b92a2921fe37c2436/FLAGe7dfa780b [2018-11-23 02:36:57,242 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ae489eb7-ea58-49db-963e-bdef2ba600fc/bin-2019/utaipan/data/11bfecbd3/f2cecb0364d74e3b92a2921fe37c2436 [2018-11-23 02:36:57,244 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 02:36:57,245 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 02:36:57,245 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 02:36:57,245 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 02:36:57,248 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 02:36:57,248 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:36:57" (1/1) ... [2018-11-23 02:36:57,251 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bf86f17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:57, skipping insertion in model container [2018-11-23 02:36:57,251 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:36:57" (1/1) ... [2018-11-23 02:36:57,258 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 02:36:57,276 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 02:36:57,390 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:36:57,392 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 02:36:57,409 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:36:57,425 INFO L195 MainTranslator]: Completed translation [2018-11-23 02:36:57,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:57 WrapperNode [2018-11-23 02:36:57,426 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 02:36:57,426 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 02:36:57,426 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 02:36:57,426 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 02:36:57,431 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:57" (1/1) ... [2018-11-23 02:36:57,438 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:57" (1/1) ... [2018-11-23 02:36:57,442 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 02:36:57,442 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 02:36:57,442 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 02:36:57,443 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 02:36:57,487 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:57" (1/1) ... [2018-11-23 02:36:57,487 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:57" (1/1) ... [2018-11-23 02:36:57,489 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:57" (1/1) ... [2018-11-23 02:36:57,490 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:57" (1/1) ... [2018-11-23 02:36:57,496 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:57" (1/1) ... [2018-11-23 02:36:57,500 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:57" (1/1) ... [2018-11-23 02:36:57,501 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:57" (1/1) ... [2018-11-23 02:36:57,503 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 02:36:57,504 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 02:36:57,504 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 02:36:57,504 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 02:36:57,504 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ae489eb7-ea58-49db-963e-bdef2ba600fc/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-23 02:36:57,537 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_double [2018-11-23 02:36:57,537 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_double [2018-11-23 02:36:57,537 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 02:36:57,538 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 02:36:57,538 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2018-11-23 02:36:57,538 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2018-11-23 02:36:57,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 02:36:57,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 02:36:57,538 INFO L130 BoogieDeclarations]: Found specification of procedure fmax_double [2018-11-23 02:36:57,538 INFO L138 BoogieDeclarations]: Found implementation of procedure fmax_double [2018-11-23 02:36:57,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-23 02:36:57,539 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 02:36:57,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 02:36:57,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 02:36:57,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 02:36:57,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 02:36:57,692 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 02:36:57,693 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 02:36:57,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:36:57 BoogieIcfgContainer [2018-11-23 02:36:57,693 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 02:36:57,694 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 02:36:57,694 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 02:36:57,696 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 02:36:57,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:36:57" (1/3) ... [2018-11-23 02:36:57,697 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f0c2793 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:36:57, skipping insertion in model container [2018-11-23 02:36:57,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:36:57" (2/3) ... [2018-11-23 02:36:57,697 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f0c2793 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:36:57, skipping insertion in model container [2018-11-23 02:36:57,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:36:57" (3/3) ... [2018-11-23 02:36:57,699 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1250_true-unreach-call.c [2018-11-23 02:36:57,707 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 02:36:57,714 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 02:36:57,727 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 02:36:57,750 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 02:36:57,750 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 02:36:57,750 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 02:36:57,750 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 02:36:57,751 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 02:36:57,751 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 02:36:57,751 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 02:36:57,751 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 02:36:57,766 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-11-23 02:36:57,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 02:36:57,771 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:36:57,772 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:36:57,773 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:36:57,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:36:57,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1777529962, now seen corresponding path program 1 times [2018-11-23 02:36:57,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:36:57,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:36:57,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:36:57,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:36:57,815 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:36:57,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:36:57,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:36:57,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:36:57,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 02:36:57,873 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 02:36:57,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 02:36:57,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 02:36:57,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 02:36:57,886 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 2 states. [2018-11-23 02:36:57,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:36:57,900 INFO L93 Difference]: Finished difference Result 71 states and 92 transitions. [2018-11-23 02:36:57,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 02:36:57,901 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 26 [2018-11-23 02:36:57,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:36:57,909 INFO L225 Difference]: With dead ends: 71 [2018-11-23 02:36:57,909 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 02:36:57,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 02:36:57,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 02:36:57,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-23 02:36:57,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 02:36:57,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2018-11-23 02:36:57,941 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 26 [2018-11-23 02:36:57,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:36:57,942 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2018-11-23 02:36:57,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 02:36:57,942 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2018-11-23 02:36:57,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 02:36:57,943 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:36:57,943 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:36:57,943 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:36:57,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:36:57,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1782564235, now seen corresponding path program 1 times [2018-11-23 02:36:57,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:36:57,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:36:57,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:36:57,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:36:57,945 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:36:57,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:36:58,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:36:58,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:36:58,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 02:36:58,011 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 02:36:58,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 02:36:58,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 02:36:58,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 02:36:58,013 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand 4 states. [2018-11-23 02:36:58,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:36:58,037 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2018-11-23 02:36:58,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 02:36:58,037 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-11-23 02:36:58,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:36:58,040 INFO L225 Difference]: With dead ends: 51 [2018-11-23 02:36:58,040 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 02:36:58,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 02:36:58,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 02:36:58,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-23 02:36:58,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 02:36:58,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2018-11-23 02:36:58,049 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 27 [2018-11-23 02:36:58,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:36:58,049 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2018-11-23 02:36:58,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 02:36:58,049 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2018-11-23 02:36:58,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 02:36:58,050 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:36:58,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, 1, 1] [2018-11-23 02:36:58,050 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:36:58,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:36:58,050 INFO L82 PathProgramCache]: Analyzing trace with hash 105963089, now seen corresponding path program 1 times [2018-11-23 02:36:58,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:36:58,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:36:58,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:36:58,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:36:58,052 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:36:58,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:36:58,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:36:58,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:36:58,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 02:36:58,094 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 02:36:58,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 02:36:58,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 02:36:58,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 02:36:58,095 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 4 states. [2018-11-23 02:36:58,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:36:58,129 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2018-11-23 02:36:58,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 02:36:58,129 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-11-23 02:36:58,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:36:58,130 INFO L225 Difference]: With dead ends: 55 [2018-11-23 02:36:58,130 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 02:36:58,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 02:36:58,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 02:36:58,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2018-11-23 02:36:58,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 02:36:58,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2018-11-23 02:36:58,134 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 30 [2018-11-23 02:36:58,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:36:58,134 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2018-11-23 02:36:58,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 02:36:58,134 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2018-11-23 02:36:58,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 02:36:58,135 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:36:58,135 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:36:58,135 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:36:58,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:36:58,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1613514898, now seen corresponding path program 1 times [2018-11-23 02:36:58,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:36:58,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:36:58,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:36:58,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:36:58,137 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:36:58,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:36:58,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:36:58,185 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=4294967304, |#NULL.offset|=4294967298, |old(#NULL.base)|=4294967304, |old(#NULL.offset)|=4294967298] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=4294967304, |old(#NULL.offset)|=4294967298] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=4294967304, |old(#NULL.offset)|=4294967298] [?] RET #75#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret9 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0);~y~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret7 := fmax_double(~x~0, ~y~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |fmax_double_#in~x|=4294967302.0, |fmax_double_#in~y|=4294967303.0] [?] ~x := #in~x;~y := #in~y; VAL [fmax_double_~x=4294967302.0, fmax_double_~y=4294967303.0, |#NULL.base|=0, |#NULL.offset|=0, |fmax_double_#in~x|=4294967302.0, |fmax_double_#in~y|=4294967303.0] [?] CALL call #t~ret4 := __fpclassify_double(~x); VAL [|#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=4294967302.0] [?] ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; VAL [__fpclassify_double_~x=4294967302.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=4294967302.0] [?] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8);call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8);call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4);~msw~0 := #t~mem0;call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~mem0;havoc #t~union1;call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4);~lsw~0 := #t~mem2;call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~union3;havoc #t~mem2;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [__fpclassify_double_~lsw~0=4294967297, __fpclassify_double_~msw~0=4293918721, __fpclassify_double_~x=4294967302.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=4294967302.0] [?] goto; VAL [__fpclassify_double_~lsw~0=4294967297, __fpclassify_double_~msw~0=4293918721, __fpclassify_double_~x=4294967302.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=4294967302.0] [?] assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); VAL [__fpclassify_double_~lsw~0=4294967297, __fpclassify_double_~msw~0=4293918721, __fpclassify_double_~x=4294967302.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=4294967302.0] [?] assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); VAL [__fpclassify_double_~lsw~0=4294967297, __fpclassify_double_~msw~0=4293918721, __fpclassify_double_~x=4294967302.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=4294967302.0] [?] assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); VAL [__fpclassify_double_~lsw~0=4294967297, __fpclassify_double_~msw~0=4293918721, __fpclassify_double_~x=4294967302.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=4294967302.0] [?] assume !((2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296));#res := 0; VAL [__fpclassify_double_~lsw~0=4294967297, __fpclassify_double_~msw~0=4293918721, __fpclassify_double_~x=4294967302.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=4294967302.0, |__fpclassify_double_#res|=0] [?] assume true; VAL [__fpclassify_double_~lsw~0=4294967297, __fpclassify_double_~msw~0=4293918721, __fpclassify_double_~x=4294967302.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=4294967302.0, |__fpclassify_double_#res|=0] [?] RET #71#return; VAL [fmax_double_~x=4294967302.0, fmax_double_~y=4294967303.0, |#NULL.base|=0, |#NULL.offset|=0, |fmax_double_#in~x|=4294967302.0, |fmax_double_#in~y|=4294967303.0, |fmax_double_#t~ret4|=0] [?] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; VAL [fmax_double_~x=4294967302.0, fmax_double_~y=4294967303.0, |#NULL.base|=0, |#NULL.offset|=0, |fmax_double_#in~x|=4294967302.0, |fmax_double_#in~y|=4294967303.0, |fmax_double_#t~ret4|=0] [?] assume 0 == #t~ret4;havoc #t~ret4;#res := ~y; VAL [fmax_double_~x=4294967302.0, fmax_double_~y=4294967303.0, |#NULL.base|=0, |#NULL.offset|=0, |fmax_double_#in~x|=4294967302.0, |fmax_double_#in~y|=4294967303.0, |fmax_double_#res|=4294967303.0] [?] assume true; VAL [fmax_double_~x=4294967302.0, fmax_double_~y=4294967303.0, |#NULL.base|=0, |#NULL.offset|=0, |fmax_double_#in~x|=4294967302.0, |fmax_double_#in~y|=4294967303.0, |fmax_double_#res|=4294967303.0] [?] RET #79#return; VAL [main_~x~0=4294967302.0, main_~y~0=4294967303.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret7|=4294967303.0] [?] ~res~0 := #t~ret7;havoc #t~ret7; VAL [main_~res~0=4294967303.0, main_~x~0=4294967302.0, main_~y~0=4294967303.0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret8 := isnan_double(~res~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |isnan_double_#in~x|=4294967303.0] [?] ~x := #in~x;#res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); VAL [isnan_double_~x=4294967303.0, |#NULL.base|=0, |#NULL.offset|=0, |isnan_double_#in~x|=4294967303.0, |isnan_double_#res|=0] [?] assume true; VAL [isnan_double_~x=4294967303.0, |#NULL.base|=0, |#NULL.offset|=0, |isnan_double_#in~x|=4294967303.0, |isnan_double_#res|=0] [?] RET #81#return; VAL [main_~res~0=4294967303.0, main_~x~0=4294967302.0, main_~y~0=4294967303.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret8|=0] [?] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; VAL [main_~res~0=4294967303.0, main_~x~0=4294967302.0, main_~y~0=4294967303.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret8|=0] [?] assume 0 == #t~ret8;havoc #t~ret8; VAL [main_~res~0=4294967303.0, main_~x~0=4294967302.0, main_~y~0=4294967303.0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !false; VAL [main_~res~0=4294967303.0, main_~x~0=4294967302.0, main_~y~0=4294967303.0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=4294967304, #NULL.offset=4294967298, old(#NULL.base)=4294967304, old(#NULL.offset)=4294967298] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=4294967304, old(#NULL.offset)=4294967298] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=4294967304, old(#NULL.offset)=4294967298] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret9 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L67] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); [L68] ~y~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); VAL [#NULL.base=0, #NULL.offset=0] [L69] CALL call #t~ret7 := fmax_double(~x~0, ~y~0); VAL [#in~x=4.294967302E9, #in~y=4.294967303E9, #NULL.base=0, #NULL.offset=0] [L53-L61] ~x := #in~x; [L53-L61] ~y := #in~y; VAL [#in~x=4.294967302E9, #in~y=4.294967303E9, #NULL.base=0, #NULL.offset=0, ~x=4.294967302E9, ~y=4.294967303E9] [L55] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.294967302E9, #NULL.base=0, #NULL.offset=0] [L26-L51] ~x := #in~x; [L27] havoc ~msw~0; [L27] havoc ~lsw~0; VAL [#in~x=4.294967302E9, #NULL.base=0, #NULL.offset=0, ~x=4.294967302E9] [L30] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8); [L31] call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L32] call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); [L32] ~msw~0 := #t~mem0; [L32] call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L32] havoc #t~mem0; [L32] havoc #t~union1; [L33] call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); [L33] ~lsw~0 := #t~mem2; [L33] call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L33] havoc #t~union3; [L33] havoc #t~mem2; [L30] call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); [L30] havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [#in~x=4.294967302E9, #NULL.base=0, #NULL.offset=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967302E9] [L36-L50] assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); VAL [#in~x=4.294967302E9, #NULL.base=0, #NULL.offset=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967302E9] [L39-L50] assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); VAL [#in~x=4.294967302E9, #NULL.base=0, #NULL.offset=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967302E9] [L42-L50] assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); VAL [#in~x=4.294967302E9, #NULL.base=0, #NULL.offset=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967302E9] [L46-L50] assume !((2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); [L50] #res := 0; VAL [#in~x=4.294967302E9, #NULL.base=0, #NULL.offset=0, #res=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967302E9] [L26-L51] ensures true; VAL [#in~x=4.294967302E9, #NULL.base=0, #NULL.offset=0, #res=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967302E9] [L55] RET call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.294967302E9, #in~y=4.294967303E9, #NULL.base=0, #NULL.offset=0, #t~ret4=0, ~x=4.294967302E9, ~y=4.294967303E9] [L55] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; VAL [#in~x=4.294967302E9, #in~y=4.294967303E9, #NULL.base=0, #NULL.offset=0, #t~ret4=0, ~x=4.294967302E9, ~y=4.294967303E9] [L55-L56] assume 0 == #t~ret4; [L55] havoc #t~ret4; [L56] #res := ~y; VAL [#in~x=4.294967302E9, #in~y=4.294967303E9, #NULL.base=0, #NULL.offset=0, #res=4.294967303E9, ~x=4.294967302E9, ~y=4.294967303E9] [L53-L61] ensures true; VAL [#in~x=4.294967302E9, #in~y=4.294967303E9, #NULL.base=0, #NULL.offset=0, #res=4.294967303E9, ~x=4.294967302E9, ~y=4.294967303E9] [L69] RET call #t~ret7 := fmax_double(~x~0, ~y~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=4.294967303E9, ~x~0=4.294967302E9, ~y~0=4.294967303E9] [L69] ~res~0 := #t~ret7; [L69] havoc #t~ret7; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=4.294967303E9, ~x~0=4.294967302E9, ~y~0=4.294967303E9] [L71] CALL call #t~ret8 := isnan_double(~res~0); VAL [#in~x=4.294967303E9, #NULL.base=0, #NULL.offset=0] [L16] ~x := #in~x; [L16] #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=4.294967303E9, #NULL.base=0, #NULL.offset=0, #res=0, ~x=4.294967303E9] [L16] ensures true; VAL [#in~x=4.294967303E9, #NULL.base=0, #NULL.offset=0, #res=0, ~x=4.294967303E9] [L71] RET call #t~ret8 := isnan_double(~res~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret8=0, ~res~0=4.294967303E9, ~x~0=4.294967302E9, ~y~0=4.294967303E9] [L71] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret8=0, ~res~0=4.294967303E9, ~x~0=4.294967302E9, ~y~0=4.294967303E9] [L71-L74] assume 0 == #t~ret8; [L71] havoc #t~ret8; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=4.294967303E9, ~x~0=4.294967302E9, ~y~0=4.294967303E9] [L72] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=4.294967303E9, ~x~0=4.294967302E9, ~y~0=4.294967303E9] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=4294967304, #NULL.offset=4294967298, old(#NULL.base)=4294967304, old(#NULL.offset)=4294967298] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=4294967304, old(#NULL.offset)=4294967298] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=4294967304, old(#NULL.offset)=4294967298] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret9 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L67] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); [L68] ~y~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); VAL [#NULL.base=0, #NULL.offset=0] [L69] CALL call #t~ret7 := fmax_double(~x~0, ~y~0); VAL [#in~x=4.294967302E9, #in~y=4.294967303E9, #NULL.base=0, #NULL.offset=0] [L53-L61] ~x := #in~x; [L53-L61] ~y := #in~y; VAL [#in~x=4.294967302E9, #in~y=4.294967303E9, #NULL.base=0, #NULL.offset=0, ~x=4.294967302E9, ~y=4.294967303E9] [L55] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.294967302E9, #NULL.base=0, #NULL.offset=0] [L26-L51] ~x := #in~x; [L27] havoc ~msw~0; [L27] havoc ~lsw~0; VAL [#in~x=4.294967302E9, #NULL.base=0, #NULL.offset=0, ~x=4.294967302E9] [L30] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8); [L31] call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L32] call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); [L32] ~msw~0 := #t~mem0; [L32] call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L32] havoc #t~mem0; [L32] havoc #t~union1; [L33] call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); [L33] ~lsw~0 := #t~mem2; [L33] call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L33] havoc #t~union3; [L33] havoc #t~mem2; [L30] call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); [L30] havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [#in~x=4.294967302E9, #NULL.base=0, #NULL.offset=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967302E9] [L36-L50] assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); VAL [#in~x=4.294967302E9, #NULL.base=0, #NULL.offset=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967302E9] [L39-L50] assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); VAL [#in~x=4.294967302E9, #NULL.base=0, #NULL.offset=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967302E9] [L42-L50] assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); VAL [#in~x=4.294967302E9, #NULL.base=0, #NULL.offset=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967302E9] [L46-L50] assume !((2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); [L50] #res := 0; VAL [#in~x=4.294967302E9, #NULL.base=0, #NULL.offset=0, #res=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967302E9] [L26-L51] ensures true; VAL [#in~x=4.294967302E9, #NULL.base=0, #NULL.offset=0, #res=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967302E9] [L55] RET call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.294967302E9, #in~y=4.294967303E9, #NULL.base=0, #NULL.offset=0, #t~ret4=0, ~x=4.294967302E9, ~y=4.294967303E9] [L55] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; VAL [#in~x=4.294967302E9, #in~y=4.294967303E9, #NULL.base=0, #NULL.offset=0, #t~ret4=0, ~x=4.294967302E9, ~y=4.294967303E9] [L55-L56] assume 0 == #t~ret4; [L55] havoc #t~ret4; [L56] #res := ~y; VAL [#in~x=4.294967302E9, #in~y=4.294967303E9, #NULL.base=0, #NULL.offset=0, #res=4.294967303E9, ~x=4.294967302E9, ~y=4.294967303E9] [L53-L61] ensures true; VAL [#in~x=4.294967302E9, #in~y=4.294967303E9, #NULL.base=0, #NULL.offset=0, #res=4.294967303E9, ~x=4.294967302E9, ~y=4.294967303E9] [L69] RET call #t~ret7 := fmax_double(~x~0, ~y~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=4.294967303E9, ~x~0=4.294967302E9, ~y~0=4.294967303E9] [L69] ~res~0 := #t~ret7; [L69] havoc #t~ret7; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=4.294967303E9, ~x~0=4.294967302E9, ~y~0=4.294967303E9] [L71] CALL call #t~ret8 := isnan_double(~res~0); VAL [#in~x=4.294967303E9, #NULL.base=0, #NULL.offset=0] [L16] ~x := #in~x; [L16] #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=4.294967303E9, #NULL.base=0, #NULL.offset=0, #res=0, ~x=4.294967303E9] [L16] ensures true; VAL [#in~x=4.294967303E9, #NULL.base=0, #NULL.offset=0, #res=0, ~x=4.294967303E9] [L71] RET call #t~ret8 := isnan_double(~res~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret8=0, ~res~0=4.294967303E9, ~x~0=4.294967302E9, ~y~0=4.294967303E9] [L71] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret8=0, ~res~0=4.294967303E9, ~x~0=4.294967302E9, ~y~0=4.294967303E9] [L71-L74] assume 0 == #t~ret8; [L71] havoc #t~ret8; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=4.294967303E9, ~x~0=4.294967302E9, ~y~0=4.294967303E9] [L72] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=4.294967303E9, ~x~0=4.294967302E9, ~y~0=4.294967303E9] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=4294967304, #NULL!offset=4294967298, old(#NULL!base)=4294967304, old(#NULL!offset)=4294967298] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=4294967304, old(#NULL!offset)=4294967298] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret9 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L67] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); [L68] ~y~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); VAL [#NULL!base=0, #NULL!offset=0] [L69] CALL call #t~ret7 := fmax_double(~x~0, ~y~0); VAL [#in~x=4.294967302E9, #in~y=4.294967303E9, #NULL!base=0, #NULL!offset=0] [L53-L61] ~x := #in~x; [L53-L61] ~y := #in~y; VAL [#in~x=4.294967302E9, #in~y=4.294967303E9, #NULL!base=0, #NULL!offset=0, ~x=4.294967302E9, ~y=4.294967303E9] [L55] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.294967302E9, #NULL!base=0, #NULL!offset=0] [L26-L51] ~x := #in~x; [L27] havoc ~msw~0; [L27] havoc ~lsw~0; VAL [#in~x=4.294967302E9, #NULL!base=0, #NULL!offset=0, ~x=4.294967302E9] [L30] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L31] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L32] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L32] ~msw~0 := #t~mem0; [L32] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L32] havoc #t~mem0; [L32] havoc #t~union1; [L33] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L33] ~lsw~0 := #t~mem2; [L33] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L33] havoc #t~union3; [L33] havoc #t~mem2; [L30] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L30] havoc ~#ew_u~0; VAL [#in~x=4.294967302E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967302E9] [L36-L37] COND FALSE !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) VAL [#in~x=4.294967302E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967302E9] [L39-L40] COND FALSE !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)) VAL [#in~x=4.294967302E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967302E9] [L42-L43] COND FALSE !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)) VAL [#in~x=4.294967302E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967302E9] [L46-L47] COND FALSE !((2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) [L50] #res := 0; VAL [#in~x=4.294967302E9, #NULL!base=0, #NULL!offset=0, #res=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967302E9] [L55] RET call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.294967302E9, #in~y=4.294967303E9, #NULL!base=0, #NULL!offset=0, #t~ret4=0, ~x=4.294967302E9, ~y=4.294967303E9] [L55] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; VAL [#in~x=4.294967302E9, #in~y=4.294967303E9, #NULL!base=0, #NULL!offset=0, #t~ret4=0, ~x=4.294967302E9, ~y=4.294967303E9] [L55] COND TRUE 0 == #t~ret4 [L55] havoc #t~ret4; [L56] #res := ~y; VAL [#in~x=4.294967302E9, #in~y=4.294967303E9, #NULL!base=0, #NULL!offset=0, #res=4.294967303E9, ~x=4.294967302E9, ~y=4.294967303E9] [L69] RET call #t~ret7 := fmax_double(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=4.294967303E9, ~x~0=4.294967302E9, ~y~0=4.294967303E9] [L69] ~res~0 := #t~ret7; [L69] havoc #t~ret7; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=4.294967303E9, ~x~0=4.294967302E9, ~y~0=4.294967303E9] [L71] CALL call #t~ret8 := isnan_double(~res~0); VAL [#in~x=4.294967303E9, #NULL!base=0, #NULL!offset=0] [L16] ~x := #in~x; [L16] #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=4.294967303E9, #NULL!base=0, #NULL!offset=0, #res=0, ~x=4.294967303E9] [L71] RET call #t~ret8 := isnan_double(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~res~0=4.294967303E9, ~x~0=4.294967302E9, ~y~0=4.294967303E9] [L71] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~res~0=4.294967303E9, ~x~0=4.294967302E9, ~y~0=4.294967303E9] [L71] COND TRUE 0 == #t~ret8 [L71] havoc #t~ret8; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=4.294967303E9, ~x~0=4.294967302E9, ~y~0=4.294967303E9] [L72] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=4.294967303E9, ~x~0=4.294967302E9, ~y~0=4.294967303E9] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=4294967304, #NULL!offset=4294967298, old(#NULL!base)=4294967304, old(#NULL!offset)=4294967298] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=4294967304, old(#NULL!offset)=4294967298] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret9 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L67] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); [L68] ~y~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); VAL [#NULL!base=0, #NULL!offset=0] [L69] CALL call #t~ret7 := fmax_double(~x~0, ~y~0); VAL [#in~x=4.294967302E9, #in~y=4.294967303E9, #NULL!base=0, #NULL!offset=0] [L53-L61] ~x := #in~x; [L53-L61] ~y := #in~y; VAL [#in~x=4.294967302E9, #in~y=4.294967303E9, #NULL!base=0, #NULL!offset=0, ~x=4.294967302E9, ~y=4.294967303E9] [L55] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.294967302E9, #NULL!base=0, #NULL!offset=0] [L26-L51] ~x := #in~x; [L27] havoc ~msw~0; [L27] havoc ~lsw~0; VAL [#in~x=4.294967302E9, #NULL!base=0, #NULL!offset=0, ~x=4.294967302E9] [L30] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L31] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L32] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L32] ~msw~0 := #t~mem0; [L32] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L32] havoc #t~mem0; [L32] havoc #t~union1; [L33] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L33] ~lsw~0 := #t~mem2; [L33] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L33] havoc #t~union3; [L33] havoc #t~mem2; [L30] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L30] havoc ~#ew_u~0; VAL [#in~x=4.294967302E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967302E9] [L36-L37] COND FALSE !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) VAL [#in~x=4.294967302E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967302E9] [L39-L40] COND FALSE !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)) VAL [#in~x=4.294967302E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967302E9] [L42-L43] COND FALSE !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)) VAL [#in~x=4.294967302E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967302E9] [L46-L47] COND FALSE !((2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) [L50] #res := 0; VAL [#in~x=4.294967302E9, #NULL!base=0, #NULL!offset=0, #res=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967302E9] [L55] RET call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.294967302E9, #in~y=4.294967303E9, #NULL!base=0, #NULL!offset=0, #t~ret4=0, ~x=4.294967302E9, ~y=4.294967303E9] [L55] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; VAL [#in~x=4.294967302E9, #in~y=4.294967303E9, #NULL!base=0, #NULL!offset=0, #t~ret4=0, ~x=4.294967302E9, ~y=4.294967303E9] [L55] COND TRUE 0 == #t~ret4 [L55] havoc #t~ret4; [L56] #res := ~y; VAL [#in~x=4.294967302E9, #in~y=4.294967303E9, #NULL!base=0, #NULL!offset=0, #res=4.294967303E9, ~x=4.294967302E9, ~y=4.294967303E9] [L69] RET call #t~ret7 := fmax_double(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=4.294967303E9, ~x~0=4.294967302E9, ~y~0=4.294967303E9] [L69] ~res~0 := #t~ret7; [L69] havoc #t~ret7; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=4.294967303E9, ~x~0=4.294967302E9, ~y~0=4.294967303E9] [L71] CALL call #t~ret8 := isnan_double(~res~0); VAL [#in~x=4.294967303E9, #NULL!base=0, #NULL!offset=0] [L16] ~x := #in~x; [L16] #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=4.294967303E9, #NULL!base=0, #NULL!offset=0, #res=0, ~x=4.294967303E9] [L71] RET call #t~ret8 := isnan_double(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~res~0=4.294967303E9, ~x~0=4.294967302E9, ~y~0=4.294967303E9] [L71] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~res~0=4.294967303E9, ~x~0=4.294967302E9, ~y~0=4.294967303E9] [L71] COND TRUE 0 == #t~ret8 [L71] havoc #t~ret8; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=4.294967303E9, ~x~0=4.294967302E9, ~y~0=4.294967303E9] [L72] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=4.294967303E9, ~x~0=4.294967302E9, ~y~0=4.294967303E9] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=4294967304, #NULL!offset=4294967298, old(#NULL!base)=4294967304, old(#NULL!offset)=4294967298] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=4294967304, old(#NULL!offset)=4294967298] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret9 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L67] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); [L68] ~y~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); VAL [#NULL!base=0, #NULL!offset=0] [L69] CALL call #t~ret7 := fmax_double(~x~0, ~y~0); VAL [#in~x=4.294967302E9, #in~y=4.294967303E9, #NULL!base=0, #NULL!offset=0] [L53-L61] ~x := #in~x; [L53-L61] ~y := #in~y; VAL [#in~x=4.294967302E9, #in~y=4.294967303E9, #NULL!base=0, #NULL!offset=0, ~x=4.294967302E9, ~y=4.294967303E9] [L55] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.294967302E9, #NULL!base=0, #NULL!offset=0] [L26-L51] ~x := #in~x; [L27] havoc ~msw~0; [L27] havoc ~lsw~0; VAL [#in~x=4.294967302E9, #NULL!base=0, #NULL!offset=0, ~x=4.294967302E9] [L30] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L31] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L32] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L32] ~msw~0 := #t~mem0; [L32] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L32] havoc #t~mem0; [L32] havoc #t~union1; [L33] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L33] ~lsw~0 := #t~mem2; [L33] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L33] havoc #t~union3; [L33] havoc #t~mem2; [L30] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L30] havoc ~#ew_u~0; VAL [#in~x=4.294967302E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967302E9] [L36-L37] COND FALSE !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) VAL [#in~x=4.294967302E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967302E9] [L39-L40] COND FALSE !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)) VAL [#in~x=4.294967302E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967302E9] [L42-L43] COND FALSE !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)) VAL [#in~x=4.294967302E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967302E9] [L46-L47] COND FALSE !((2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) [L50] #res := 0; VAL [#in~x=4.294967302E9, #NULL!base=0, #NULL!offset=0, #res=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967302E9] [L55] RET call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.294967302E9, #in~y=4.294967303E9, #NULL!base=0, #NULL!offset=0, #t~ret4=0, ~x=4.294967302E9, ~y=4.294967303E9] [L55] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; VAL [#in~x=4.294967302E9, #in~y=4.294967303E9, #NULL!base=0, #NULL!offset=0, #t~ret4=0, ~x=4.294967302E9, ~y=4.294967303E9] [L55] COND TRUE 0 == #t~ret4 [L55] havoc #t~ret4; [L56] #res := ~y; VAL [#in~x=4.294967302E9, #in~y=4.294967303E9, #NULL!base=0, #NULL!offset=0, #res=4.294967303E9, ~x=4.294967302E9, ~y=4.294967303E9] [L69] RET call #t~ret7 := fmax_double(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=4.294967303E9, ~x~0=4.294967302E9, ~y~0=4.294967303E9] [L69] ~res~0 := #t~ret7; [L69] havoc #t~ret7; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=4.294967303E9, ~x~0=4.294967302E9, ~y~0=4.294967303E9] [L71] CALL call #t~ret8 := isnan_double(~res~0); VAL [#in~x=4.294967303E9, #NULL!base=0, #NULL!offset=0] [L16] ~x := #in~x; [L16] #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=4.294967303E9, #NULL!base=0, #NULL!offset=0, #res=0, ~x=4.294967303E9] [L71] RET call #t~ret8 := isnan_double(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~res~0=4.294967303E9, ~x~0=4.294967302E9, ~y~0=4.294967303E9] [L71] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~res~0=4.294967303E9, ~x~0=4.294967302E9, ~y~0=4.294967303E9] [L71] COND TRUE 0 == #t~ret8 [L71] havoc #t~ret8; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=4.294967303E9, ~x~0=4.294967302E9, ~y~0=4.294967303E9] [L72] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=4.294967303E9, ~x~0=4.294967302E9, ~y~0=4.294967303E9] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=4294967304, #NULL!offset=4294967298, old(#NULL!base)=4294967304, old(#NULL!offset)=4294967298] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=4294967304, old(#NULL!offset)=4294967298] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret9 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L67] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); [L68] ~y~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); VAL [#NULL!base=0, #NULL!offset=0] [L69] CALL call #t~ret7 := fmax_double(~x~0, ~y~0); VAL [#in~x=4.294967302E9, #in~y=4.294967303E9, #NULL!base=0, #NULL!offset=0] [L53-L61] ~x := #in~x; [L53-L61] ~y := #in~y; VAL [#in~x=4.294967302E9, #in~y=4.294967303E9, #NULL!base=0, #NULL!offset=0, ~x=4.294967302E9, ~y=4.294967303E9] [L55] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.294967302E9, #NULL!base=0, #NULL!offset=0] [L26-L51] ~x := #in~x; [L27] havoc ~msw~0; [L27] havoc ~lsw~0; VAL [#in~x=4.294967302E9, #NULL!base=0, #NULL!offset=0, ~x=4.294967302E9] [L30] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L31] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L32] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L32] ~msw~0 := #t~mem0; [L32] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L32] havoc #t~mem0; [L32] havoc #t~union1; [L33] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L33] ~lsw~0 := #t~mem2; [L33] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L33] havoc #t~union3; [L33] havoc #t~mem2; [L30] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L30] havoc ~#ew_u~0; VAL [#in~x=4.294967302E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967302E9] [L36-L37] COND FALSE !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) VAL [#in~x=4.294967302E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967302E9] [L39-L40] COND FALSE !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)) VAL [#in~x=4.294967302E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967302E9] [L42-L43] COND FALSE !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)) VAL [#in~x=4.294967302E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967302E9] [L46-L47] COND FALSE !((2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) [L50] #res := 0; VAL [#in~x=4.294967302E9, #NULL!base=0, #NULL!offset=0, #res=0, ~lsw~0=4294967297, ~msw~0=4293918721, ~x=4.294967302E9] [L55] RET call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=4.294967302E9, #in~y=4.294967303E9, #NULL!base=0, #NULL!offset=0, #t~ret4=0, ~x=4.294967302E9, ~y=4.294967303E9] [L55] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; VAL [#in~x=4.294967302E9, #in~y=4.294967303E9, #NULL!base=0, #NULL!offset=0, #t~ret4=0, ~x=4.294967302E9, ~y=4.294967303E9] [L55] COND TRUE 0 == #t~ret4 [L55] havoc #t~ret4; [L56] #res := ~y; VAL [#in~x=4.294967302E9, #in~y=4.294967303E9, #NULL!base=0, #NULL!offset=0, #res=4.294967303E9, ~x=4.294967302E9, ~y=4.294967303E9] [L69] RET call #t~ret7 := fmax_double(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=4.294967303E9, ~x~0=4.294967302E9, ~y~0=4.294967303E9] [L69] ~res~0 := #t~ret7; [L69] havoc #t~ret7; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=4.294967303E9, ~x~0=4.294967302E9, ~y~0=4.294967303E9] [L71] CALL call #t~ret8 := isnan_double(~res~0); VAL [#in~x=4.294967303E9, #NULL!base=0, #NULL!offset=0] [L16] ~x := #in~x; [L16] #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=4.294967303E9, #NULL!base=0, #NULL!offset=0, #res=0, ~x=4.294967303E9] [L71] RET call #t~ret8 := isnan_double(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~res~0=4.294967303E9, ~x~0=4.294967302E9, ~y~0=4.294967303E9] [L71] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~res~0=4.294967303E9, ~x~0=4.294967302E9, ~y~0=4.294967303E9] [L71] COND TRUE 0 == #t~ret8 [L71] havoc #t~ret8; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=4.294967303E9, ~x~0=4.294967302E9, ~y~0=4.294967303E9] [L72] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=4.294967303E9, ~x~0=4.294967302E9, ~y~0=4.294967303E9] [L67] double x = 0.0 / 0.0; [L68] double y = 0.0 / 0.0; [L69] CALL, EXPR fmax_double(x, y) VAL [\old(x)=4294967302, \old(y)=4294967303] [L55] CALL, EXPR __fpclassify_double(x) VAL [\old(x)=4294967302] [L27] __uint32_t msw, lsw; VAL [\old(x)=4294967302, x=4294967302] [L30] ieee_double_shape_type ew_u; [L31] ew_u.value = (x) [L32] EXPR ew_u.parts.msw [L32] (msw) = ew_u.parts.msw [L33] EXPR ew_u.parts.lsw [L33] (lsw) = ew_u.parts.lsw [L36-L37] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) VAL [\old(x)=4294967302, lsw=4294967297, msw=4293918721, x=4294967302] [L39-L40] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) VAL [\old(x)=4294967302, lsw=4294967297, msw=4293918721, x=4294967302] [L42-L43] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) VAL [\old(x)=4294967302, lsw=4294967297, msw=4293918721, x=4294967302] [L46-L47] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L50] return 0; VAL [\old(x)=4294967302, \result=0, lsw=4294967297, msw=4293918721, x=4294967302] [L55] RET, EXPR __fpclassify_double(x) VAL [\old(x)=4294967302, \old(y)=4294967303, __fpclassify_double(x)=0, x=4294967302, y=4294967303] [L55] COND TRUE __fpclassify_double(x) == 0 [L56] return y; VAL [\old(x)=4294967302, \old(y)=4294967303, \result=4294967303, x=4294967302, y=4294967303] [L69] RET, EXPR fmax_double(x, y) VAL [fmax_double(x, y)=4294967303, x=4294967302, y=4294967303] [L69] double res = fmax_double(x, y); [L71] CALL, EXPR isnan_double(res) VAL [\old(x)=4294967303] [L16] return x != x; VAL [\old(x)=4294967303, \result=0, x=4294967303] [L71] RET, EXPR isnan_double(res) VAL [isnan_double(res)=0, res=4294967303, x=4294967302, y=4294967303] [L71] COND TRUE !isnan_double(res) [L72] __VERIFIER_error() VAL [res=4294967303, x=4294967302, y=4294967303] ----- [2018-11-23 02:36:58,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:36:58 BoogieIcfgContainer [2018-11-23 02:36:58,224 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 02:36:58,224 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 02:36:58,224 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 02:36:58,224 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 02:36:58,225 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:36:57" (3/4) ... [2018-11-23 02:36:58,228 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 02:36:58,228 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 02:36:58,229 INFO L168 Benchmark]: Toolchain (without parser) took 984.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 959.8 MB in the beginning and 1.1 GB in the end (delta: -115.7 MB). Peak memory consumption was 34.8 MB. Max. memory is 11.5 GB. [2018-11-23 02:36:58,230 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:36:58,231 INFO L168 Benchmark]: CACSL2BoogieTranslator took 180.71 ms. Allocated memory is still 1.0 GB. Free memory was 959.8 MB in the beginning and 946.4 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-23 02:36:58,231 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.00 ms. Allocated memory is still 1.0 GB. Free memory is still 946.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:36:58,231 INFO L168 Benchmark]: Boogie Preprocessor took 60.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 946.4 MB in the beginning and 1.1 GB in the end (delta: -199.1 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-11-23 02:36:58,232 INFO L168 Benchmark]: RCFGBuilder took 189.54 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: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2018-11-23 02:36:58,232 INFO L168 Benchmark]: TraceAbstraction took 530.17 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: 48.0 MB). Peak memory consumption was 48.0 MB. Max. memory is 11.5 GB. [2018-11-23 02:36:58,233 INFO L168 Benchmark]: Witness Printer took 4.44 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-23 02:36:58,236 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 180.71 ms. Allocated memory is still 1.0 GB. Free memory was 959.8 MB in the beginning and 946.4 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.00 ms. Allocated memory is still 1.0 GB. Free memory is still 946.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 60.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 946.4 MB in the beginning and 1.1 GB in the end (delta: -199.1 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 189.54 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: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 530.17 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: 48.0 MB). Peak memory consumption was 48.0 MB. Max. memory is 11.5 GB. * Witness Printer took 4.44 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: 72]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 16, overapproximation of someBinaryArithmeticDOUBLEoperation at line 67. Possible FailurePath: [L67] double x = 0.0 / 0.0; [L68] double y = 0.0 / 0.0; [L69] CALL, EXPR fmax_double(x, y) VAL [\old(x)=4294967302, \old(y)=4294967303] [L55] CALL, EXPR __fpclassify_double(x) VAL [\old(x)=4294967302] [L27] __uint32_t msw, lsw; VAL [\old(x)=4294967302, x=4294967302] [L30] ieee_double_shape_type ew_u; [L31] ew_u.value = (x) [L32] EXPR ew_u.parts.msw [L32] (msw) = ew_u.parts.msw [L33] EXPR ew_u.parts.lsw [L33] (lsw) = ew_u.parts.lsw [L36-L37] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) VAL [\old(x)=4294967302, lsw=4294967297, msw=4293918721, x=4294967302] [L39-L40] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) VAL [\old(x)=4294967302, lsw=4294967297, msw=4293918721, x=4294967302] [L42-L43] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) VAL [\old(x)=4294967302, lsw=4294967297, msw=4293918721, x=4294967302] [L46-L47] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L50] return 0; VAL [\old(x)=4294967302, \result=0, lsw=4294967297, msw=4293918721, x=4294967302] [L55] RET, EXPR __fpclassify_double(x) VAL [\old(x)=4294967302, \old(y)=4294967303, __fpclassify_double(x)=0, x=4294967302, y=4294967303] [L55] COND TRUE __fpclassify_double(x) == 0 [L56] return y; VAL [\old(x)=4294967302, \old(y)=4294967303, \result=4294967303, x=4294967302, y=4294967303] [L69] RET, EXPR fmax_double(x, y) VAL [fmax_double(x, y)=4294967303, x=4294967302, y=4294967303] [L69] double res = fmax_double(x, y); [L71] CALL, EXPR isnan_double(res) VAL [\old(x)=4294967303] [L16] return x != x; VAL [\old(x)=4294967303, \result=0, x=4294967303] [L71] RET, EXPR isnan_double(res) VAL [isnan_double(res)=0, res=4294967303, x=4294967302, y=4294967303] [L71] COND TRUE !isnan_double(res) [L72] __VERIFIER_error() VAL [res=4294967303, x=4294967302, y=4294967303] - 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.0s InterpolantComputationTime, 113 NumberOfCodeBlocks, 113 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 80 ConstructedInterpolants, 0 QuantifiedInterpolants, 2582 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-aa41828 [2018-11-23 02:36:59,667 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 02:36:59,668 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 02:36:59,677 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 02:36:59,677 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 02:36:59,678 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 02:36:59,679 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 02:36:59,680 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 02:36:59,681 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 02:36:59,682 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 02:36:59,682 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 02:36:59,682 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 02:36:59,683 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 02:36:59,684 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 02:36:59,685 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 02:36:59,685 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 02:36:59,686 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 02:36:59,687 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 02:36:59,688 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 02:36:59,689 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 02:36:59,690 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 02:36:59,691 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 02:36:59,693 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 02:36:59,693 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 02:36:59,693 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 02:36:59,694 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 02:36:59,694 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 02:36:59,695 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 02:36:59,695 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 02:36:59,696 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 02:36:59,696 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 02:36:59,697 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 02:36:59,697 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 02:36:59,697 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 02:36:59,698 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 02:36:59,698 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 02:36:59,698 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ae489eb7-ea58-49db-963e-bdef2ba600fc/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-11-23 02:36:59,709 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 02:36:59,709 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 02:36:59,710 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 02:36:59,710 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 02:36:59,710 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 02:36:59,710 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 02:36:59,710 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 02:36:59,710 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 02:36:59,711 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 02:36:59,711 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 02:36:59,711 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 02:36:59,711 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 02:36:59,712 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 02:36:59,712 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 02:36:59,712 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 02:36:59,712 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 02:36:59,712 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 02:36:59,712 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 02:36:59,712 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 02:36:59,712 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 02:36:59,713 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 02:36:59,713 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 02:36:59,713 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 02:36:59,713 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 02:36:59,713 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 02:36:59,713 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 02:36:59,713 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 02:36:59,714 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 02:36:59,714 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 02:36:59,714 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 02:36:59,714 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 02:36:59,714 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-23 02:36:59,714 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 02:36:59,714 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 02:36:59,715 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 02:36:59,715 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_ae489eb7-ea58-49db-963e-bdef2ba600fc/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 -> 01b6390e563edc58f3f7d1f239b082df891f9006 [2018-11-23 02:36:59,745 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 02:36:59,755 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 02:36:59,757 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 02:36:59,759 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 02:36:59,759 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 02:36:59,760 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ae489eb7-ea58-49db-963e-bdef2ba600fc/bin-2019/utaipan/../../sv-benchmarks/c/float-newlib/double_req_bl_1250_true-unreach-call.c [2018-11-23 02:36:59,802 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ae489eb7-ea58-49db-963e-bdef2ba600fc/bin-2019/utaipan/data/606cdcf77/552a9a8aab7e41edb413625ac64b96c0/FLAGfdc19ae1a [2018-11-23 02:37:00,131 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 02:37:00,132 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ae489eb7-ea58-49db-963e-bdef2ba600fc/sv-benchmarks/c/float-newlib/double_req_bl_1250_true-unreach-call.c [2018-11-23 02:37:00,136 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ae489eb7-ea58-49db-963e-bdef2ba600fc/bin-2019/utaipan/data/606cdcf77/552a9a8aab7e41edb413625ac64b96c0/FLAGfdc19ae1a [2018-11-23 02:37:00,566 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ae489eb7-ea58-49db-963e-bdef2ba600fc/bin-2019/utaipan/data/606cdcf77/552a9a8aab7e41edb413625ac64b96c0 [2018-11-23 02:37:00,568 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 02:37:00,569 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 02:37:00,570 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 02:37:00,570 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 02:37:00,572 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 02:37:00,572 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:37:00" (1/1) ... [2018-11-23 02:37:00,575 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@713512cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:37:00, skipping insertion in model container [2018-11-23 02:37:00,575 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:37:00" (1/1) ... [2018-11-23 02:37:00,583 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 02:37:00,600 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 02:37:00,738 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:37:00,742 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 02:37:00,761 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:37:00,780 INFO L195 MainTranslator]: Completed translation [2018-11-23 02:37:00,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:37:00 WrapperNode [2018-11-23 02:37:00,780 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 02:37:00,781 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 02:37:00,781 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 02:37:00,781 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 02:37:00,786 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:37:00" (1/1) ... [2018-11-23 02:37:00,793 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:37:00" (1/1) ... [2018-11-23 02:37:00,797 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 02:37:00,797 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 02:37:00,798 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 02:37:00,798 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 02:37:00,803 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:37:00" (1/1) ... [2018-11-23 02:37:00,804 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:37:00" (1/1) ... [2018-11-23 02:37:00,806 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:37:00" (1/1) ... [2018-11-23 02:37:00,806 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:37:00" (1/1) ... [2018-11-23 02:37:00,815 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:37:00" (1/1) ... [2018-11-23 02:37:00,819 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:37:00" (1/1) ... [2018-11-23 02:37:00,821 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:37:00" (1/1) ... [2018-11-23 02:37:00,823 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 02:37:00,824 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 02:37:00,824 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 02:37:00,824 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 02:37:00,824 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:37:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ae489eb7-ea58-49db-963e-bdef2ba600fc/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-23 02:37:00,910 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_double [2018-11-23 02:37:00,910 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_double [2018-11-23 02:37:00,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-11-23 02:37:00,910 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 02:37:00,910 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 02:37:00,910 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2018-11-23 02:37:00,910 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2018-11-23 02:37:00,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 02:37:00,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 02:37:00,911 INFO L130 BoogieDeclarations]: Found specification of procedure fmax_double [2018-11-23 02:37:00,911 INFO L138 BoogieDeclarations]: Found implementation of procedure fmax_double [2018-11-23 02:37:00,911 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 02:37:00,911 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 02:37:00,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 02:37:00,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 02:37:00,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 02:37:01,027 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 02:37:01,099 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 02:37:01,099 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 02:37:01,099 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:37:01 BoogieIcfgContainer [2018-11-23 02:37:01,099 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 02:37:01,100 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 02:37:01,100 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 02:37:01,102 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 02:37:01,103 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:37:00" (1/3) ... [2018-11-23 02:37:01,103 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@419f1f28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:37:01, skipping insertion in model container [2018-11-23 02:37:01,103 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:37:00" (2/3) ... [2018-11-23 02:37:01,104 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@419f1f28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:37:01, skipping insertion in model container [2018-11-23 02:37:01,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:37:01" (3/3) ... [2018-11-23 02:37:01,106 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1250_true-unreach-call.c [2018-11-23 02:37:01,112 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 02:37:01,117 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 02:37:01,126 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 02:37:01,143 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 02:37:01,144 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 02:37:01,144 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 02:37:01,144 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 02:37:01,144 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 02:37:01,144 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 02:37:01,144 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 02:37:01,144 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 02:37:01,145 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 02:37:01,156 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2018-11-23 02:37:01,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 02:37:01,160 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:37:01,160 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:37:01,161 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:37:01,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:37:01,165 INFO L82 PathProgramCache]: Analyzing trace with hash 656433164, now seen corresponding path program 1 times [2018-11-23 02:37:01,168 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:37:01,169 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ae489eb7-ea58-49db-963e-bdef2ba600fc/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-23 02:37:01,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:37:01,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:37:01,225 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:37:01,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:37:01,240 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 02:37:01,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:37:01,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 02:37:01,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 02:37:01,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 02:37:01,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 02:37:01,264 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 2 states. [2018-11-23 02:37:01,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:37:01,278 INFO L93 Difference]: Finished difference Result 65 states and 86 transitions. [2018-11-23 02:37:01,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 02:37:01,280 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2018-11-23 02:37:01,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:37:01,288 INFO L225 Difference]: With dead ends: 65 [2018-11-23 02:37:01,288 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 02:37:01,291 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 02:37:01,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 02:37:01,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-23 02:37:01,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 02:37:01,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2018-11-23 02:37:01,324 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 24 [2018-11-23 02:37:01,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:37:01,324 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2018-11-23 02:37:01,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 02:37:01,325 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2018-11-23 02:37:01,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 02:37:01,326 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:37:01,326 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:37:01,327 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:37:01,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:37:01,327 INFO L82 PathProgramCache]: Analyzing trace with hash 123034921, now seen corresponding path program 1 times [2018-11-23 02:37:01,328 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:37:01,328 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ae489eb7-ea58-49db-963e-bdef2ba600fc/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-23 02:37:01,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:37:01,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:37:01,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:37:01,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:37:01,405 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 02:37:01,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:37:01,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 02:37:01,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 02:37:01,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 02:37:01,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 02:37:01,418 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand 4 states. [2018-11-23 02:37:01,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:37:01,459 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-11-23 02:37:01,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 02:37:01,460 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-11-23 02:37:01,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:37:01,462 INFO L225 Difference]: With dead ends: 46 [2018-11-23 02:37:01,462 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 02:37:01,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 02:37:01,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 02:37:01,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-23 02:37:01,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 02:37:01,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2018-11-23 02:37:01,467 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 25 [2018-11-23 02:37:01,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:37:01,467 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2018-11-23 02:37:01,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 02:37:01,468 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2018-11-23 02:37:01,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 02:37:01,468 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:37:01,468 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:37:01,468 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:37:01,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:37:01,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1807372911, now seen corresponding path program 1 times [2018-11-23 02:37:01,469 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:37:01,469 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ae489eb7-ea58-49db-963e-bdef2ba600fc/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-23 02:37:01,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:37:01,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:37:01,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:37:01,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:37:01,529 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 02:37:01,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:37:01,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 02:37:01,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 02:37:01,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 02:37:01,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 02:37:01,536 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand 4 states. [2018-11-23 02:37:01,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:37:01,580 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2018-11-23 02:37:01,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 02:37:01,581 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-11-23 02:37:01,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:37:01,581 INFO L225 Difference]: With dead ends: 49 [2018-11-23 02:37:01,582 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 02:37:01,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 02:37:01,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 02:37:01,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2018-11-23 02:37:01,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 02:37:01,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2018-11-23 02:37:01,587 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 26 [2018-11-23 02:37:01,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:37:01,587 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2018-11-23 02:37:01,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 02:37:01,587 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2018-11-23 02:37:01,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 02:37:01,588 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:37:01,588 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:37:01,588 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:37:01,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:37:01,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1308631021, now seen corresponding path program 1 times [2018-11-23 02:37:01,589 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:37:01,589 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ae489eb7-ea58-49db-963e-bdef2ba600fc/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-23 02:37:01,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:37:01,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:37:01,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:37:01,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:37:01,686 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 02:37:01,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:37:01,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 02:37:01,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 02:37:01,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 02:37:01,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 02:37:01,696 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand 4 states. [2018-11-23 02:37:01,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:37:01,733 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2018-11-23 02:37:01,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 02:37:01,734 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-11-23 02:37:01,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:37:01,734 INFO L225 Difference]: With dead ends: 49 [2018-11-23 02:37:01,735 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 02:37:01,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 02:37:01,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 02:37:01,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2018-11-23 02:37:01,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 02:37:01,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2018-11-23 02:37:01,740 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 27 [2018-11-23 02:37:01,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:37:01,740 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2018-11-23 02:37:01,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 02:37:01,740 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2018-11-23 02:37:01,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 02:37:01,741 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:37:01,741 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:37:01,741 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:37:01,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:37:01,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1853889587, now seen corresponding path program 1 times [2018-11-23 02:37:01,742 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:37:01,742 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ae489eb7-ea58-49db-963e-bdef2ba600fc/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-23 02:37:01,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:37:01,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:37:01,785 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:37:01,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:37:01,799 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 02:37:01,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:37:01,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 02:37:01,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 02:37:01,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 02:37:01,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 02:37:01,807 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand 4 states. [2018-11-23 02:37:01,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:37:01,835 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2018-11-23 02:37:01,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 02:37:01,836 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-11-23 02:37:01,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:37:01,836 INFO L225 Difference]: With dead ends: 49 [2018-11-23 02:37:01,837 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 02:37:01,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 02:37:01,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 02:37:01,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2018-11-23 02:37:01,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 02:37:01,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2018-11-23 02:37:01,840 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 28 [2018-11-23 02:37:01,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:37:01,840 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2018-11-23 02:37:01,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 02:37:01,841 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2018-11-23 02:37:01,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 02:37:01,841 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:37:01,842 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:37:01,842 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:37:01,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:37:01,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1560486580, now seen corresponding path program 1 times [2018-11-23 02:37:01,842 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:37:01,842 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ae489eb7-ea58-49db-963e-bdef2ba600fc/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-23 02:37:01,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:37:01,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:37:01,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:37:02,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:37:02,009 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 02:37:02,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:37:02,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 02:37:02,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 02:37:02,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 02:37:02,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 02:37:02,018 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand 9 states. [2018-11-23 02:37:02,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:37:02,467 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2018-11-23 02:37:02,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 02:37:02,468 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-11-23 02:37:02,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:37:02,468 INFO L225 Difference]: With dead ends: 43 [2018-11-23 02:37:02,468 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 02:37:02,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-11-23 02:37:02,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 02:37:02,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2018-11-23 02:37:02,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 02:37:02,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2018-11-23 02:37:02,472 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 28 [2018-11-23 02:37:02,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:37:02,472 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2018-11-23 02:37:02,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 02:37:02,472 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2018-11-23 02:37:02,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 02:37:02,473 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:37:02,473 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:37:02,473 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:37:02,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:37:02,474 INFO L82 PathProgramCache]: Analyzing trace with hash -132849900, now seen corresponding path program 1 times [2018-11-23 02:37:02,474 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:37:02,474 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ae489eb7-ea58-49db-963e-bdef2ba600fc/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-23 02:37:02,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:37:02,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:37:02,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:37:02,560 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 02:37:02,560 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 02:37:02,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:37:02,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 02:37:02,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 02:37:02,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 02:37:02,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 02:37:02,574 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand 4 states. [2018-11-23 02:37:02,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:37:02,602 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2018-11-23 02:37:02,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 02:37:02,603 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2018-11-23 02:37:02,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:37:02,604 INFO L225 Difference]: With dead ends: 46 [2018-11-23 02:37:02,604 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 02:37:02,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 02:37:02,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 02:37:02,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-23 02:37:02,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 02:37:02,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2018-11-23 02:37:02,608 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 33 [2018-11-23 02:37:02,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:37:02,608 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2018-11-23 02:37:02,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 02:37:02,608 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2018-11-23 02:37:02,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 02:37:02,609 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:37:02,609 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:37:02,609 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:37:02,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:37:02,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1974935426, now seen corresponding path program 1 times [2018-11-23 02:37:02,610 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:37:02,610 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ae489eb7-ea58-49db-963e-bdef2ba600fc/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-23 02:37:02,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:37:02,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:37:02,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:37:02,693 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 02:37:02,693 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 02:37:02,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:37:02,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 02:37:02,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 02:37:02,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 02:37:02,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 02:37:02,702 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand 4 states. [2018-11-23 02:37:02,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:37:02,722 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2018-11-23 02:37:02,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 02:37:02,723 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-11-23 02:37:02,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:37:02,724 INFO L225 Difference]: With dead ends: 49 [2018-11-23 02:37:02,724 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 02:37:02,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 02:37:02,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 02:37:02,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2018-11-23 02:37:02,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 02:37:02,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2018-11-23 02:37:02,728 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 34 [2018-11-23 02:37:02,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:37:02,728 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2018-11-23 02:37:02,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 02:37:02,728 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2018-11-23 02:37:02,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 02:37:02,729 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:37:02,729 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:37:02,729 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:37:02,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:37:02,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1277705297, now seen corresponding path program 1 times [2018-11-23 02:37:02,730 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:37:02,730 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ae489eb7-ea58-49db-963e-bdef2ba600fc/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-23 02:37:02,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:37:02,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:37:02,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:37:02,920 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 02:37:02,920 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 02:37:02,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:37:02,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-23 02:37:02,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 02:37:02,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 02:37:02,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-23 02:37:02,929 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand 10 states. [2018-11-23 02:37:03,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:37:03,247 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2018-11-23 02:37:03,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 02:37:03,248 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2018-11-23 02:37:03,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:37:03,249 INFO L225 Difference]: With dead ends: 44 [2018-11-23 02:37:03,249 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 02:37:03,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-11-23 02:37:03,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 02:37:03,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-23 02:37:03,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 02:37:03,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2018-11-23 02:37:03,253 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 35 [2018-11-23 02:37:03,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:37:03,254 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2018-11-23 02:37:03,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 02:37:03,254 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2018-11-23 02:37:03,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 02:37:03,255 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:37:03,255 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:37:03,255 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:37:03,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:37:03,255 INFO L82 PathProgramCache]: Analyzing trace with hash 576640719, now seen corresponding path program 1 times [2018-11-23 02:37:03,256 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:37:03,256 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ae489eb7-ea58-49db-963e-bdef2ba600fc/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-23 02:37:03,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:37:03,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:37:03,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:37:03,435 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 02:37:03,436 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 02:37:03,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:37:03,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 02:37:03,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 02:37:03,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 02:37:03,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 02:37:03,445 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand 5 states. [2018-11-23 02:37:03,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:37:03,620 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-11-23 02:37:03,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 02:37:03,622 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-11-23 02:37:03,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:37:03,622 INFO L225 Difference]: With dead ends: 46 [2018-11-23 02:37:03,622 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 02:37:03,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 02:37:03,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 02:37:03,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-23 02:37:03,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 02:37:03,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-23 02:37:03,626 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 35 [2018-11-23 02:37:03,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:37:03,626 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-23 02:37:03,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 02:37:03,627 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-23 02:37:03,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 02:37:03,627 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:37:03,627 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:37:03,628 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:37:03,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:37:03,628 INFO L82 PathProgramCache]: Analyzing trace with hash -123656616, now seen corresponding path program 1 times [2018-11-23 02:37:03,628 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:37:03,628 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ae489eb7-ea58-49db-963e-bdef2ba600fc/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-23 02:37:03,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:37:03,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:37:03,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:37:03,698 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 02:37:03,698 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 02:37:03,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:37:03,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 02:37:03,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 02:37:03,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 02:37:03,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 02:37:03,711 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 4 states. [2018-11-23 02:37:03,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:37:03,730 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2018-11-23 02:37:03,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 02:37:03,730 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-11-23 02:37:03,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:37:03,731 INFO L225 Difference]: With dead ends: 46 [2018-11-23 02:37:03,731 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 02:37:03,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 02:37:03,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 02:37:03,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-11-23 02:37:03,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 02:37:03,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-23 02:37:03,734 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 35 [2018-11-23 02:37:03,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:37:03,734 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-23 02:37:03,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 02:37:03,734 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-23 02:37:03,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 02:37:03,734 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:37:03,735 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:37:03,735 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:37:03,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:37:03,735 INFO L82 PathProgramCache]: Analyzing trace with hash 257799618, now seen corresponding path program 1 times [2018-11-23 02:37:03,735 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:37:03,735 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ae489eb7-ea58-49db-963e-bdef2ba600fc/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-23 02:37:03,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:37:03,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:37:03,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:37:03,805 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 02:37:03,806 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 02:37:03,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:37:03,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 02:37:03,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 02:37:03,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 02:37:03,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 02:37:03,819 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 4 states. [2018-11-23 02:37:03,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:37:03,836 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2018-11-23 02:37:03,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 02:37:03,836 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-11-23 02:37:03,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:37:03,837 INFO L225 Difference]: With dead ends: 46 [2018-11-23 02:37:03,837 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 02:37:03,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 02:37:03,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 02:37:03,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-11-23 02:37:03,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 02:37:03,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-23 02:37:03,840 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 36 [2018-11-23 02:37:03,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:37:03,840 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-23 02:37:03,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 02:37:03,841 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-23 02:37:03,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 02:37:03,841 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:37:03,841 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:37:03,842 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:37:03,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:37:03,842 INFO L82 PathProgramCache]: Analyzing trace with hash -35603389, now seen corresponding path program 1 times [2018-11-23 02:37:03,842 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:37:03,842 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ae489eb7-ea58-49db-963e-bdef2ba600fc/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-23 02:37:03,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:37:03,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:37:03,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:37:04,001 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 02:37:04,001 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 02:37:04,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:37:04,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 02:37:04,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 02:37:04,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 02:37:04,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 02:37:04,010 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 9 states. [2018-11-23 02:37:04,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:37:04,219 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-11-23 02:37:04,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 02:37:04,220 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2018-11-23 02:37:04,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:37:04,220 INFO L225 Difference]: With dead ends: 33 [2018-11-23 02:37:04,220 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 02:37:04,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-11-23 02:37:04,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 02:37:04,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 02:37:04,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 02:37:04,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 02:37:04,221 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2018-11-23 02:37:04,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:37:04,222 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 02:37:04,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 02:37:04,222 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 02:37:04,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 02:37:04,225 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 02:37:04,363 INFO L451 ceAbstractionStarter]: At program point isnan_doubleENTRY(line 16) the Hoare annotation is: true [2018-11-23 02:37:04,363 INFO L448 ceAbstractionStarter]: For program point isnan_doubleEXIT(line 16) no Hoare annotation was computed. [2018-11-23 02:37:04,363 INFO L448 ceAbstractionStarter]: For program point isnan_doubleFINAL(line 16) no Hoare annotation was computed. [2018-11-23 02:37:04,363 INFO L448 ceAbstractionStarter]: For program point L29-1(lines 29 34) no Hoare annotation was computed. [2018-11-23 02:37:04,363 INFO L451 ceAbstractionStarter]: At program point L29-2(lines 29 34) the Hoare annotation is: true [2018-11-23 02:37:04,363 INFO L448 ceAbstractionStarter]: For program point __fpclassify_doubleFINAL(lines 26 51) no Hoare annotation was computed. [2018-11-23 02:37:04,363 INFO L448 ceAbstractionStarter]: For program point L29-3(lines 26 51) no Hoare annotation was computed. [2018-11-23 02:37:04,363 INFO L448 ceAbstractionStarter]: For program point L46(lines 46 50) no Hoare annotation was computed. [2018-11-23 02:37:04,363 INFO L451 ceAbstractionStarter]: At program point __fpclassify_doubleENTRY(lines 26 51) the Hoare annotation is: true [2018-11-23 02:37:04,364 INFO L448 ceAbstractionStarter]: For program point L42(lines 42 50) no Hoare annotation was computed. [2018-11-23 02:37:04,364 INFO L448 ceAbstractionStarter]: For program point __fpclassify_doubleEXIT(lines 26 51) no Hoare annotation was computed. [2018-11-23 02:37:04,364 INFO L448 ceAbstractionStarter]: For program point L39(lines 39 50) no Hoare annotation was computed. [2018-11-23 02:37:04,364 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 02:37:04,364 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 02:37:04,364 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 02:37:04,364 INFO L448 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2018-11-23 02:37:04,364 INFO L448 ceAbstractionStarter]: For program point L60-2(line 60) no Hoare annotation was computed. [2018-11-23 02:37:04,364 INFO L444 ceAbstractionStarter]: At program point L57(line 57) the Hoare annotation is: (and (= fmax_double_~x |fmax_double_#in~x|) (= fmax_double_~y |fmax_double_#in~y|)) [2018-11-23 02:37:04,364 INFO L451 ceAbstractionStarter]: At program point fmax_doubleENTRY(lines 53 61) the Hoare annotation is: true [2018-11-23 02:37:04,364 INFO L448 ceAbstractionStarter]: For program point L57-1(lines 57 58) no Hoare annotation was computed. [2018-11-23 02:37:04,364 INFO L444 ceAbstractionStarter]: At program point L55(line 55) the Hoare annotation is: (and (= fmax_double_~x |fmax_double_#in~x|) (= fmax_double_~y |fmax_double_#in~y|)) [2018-11-23 02:37:04,364 INFO L448 ceAbstractionStarter]: For program point L55-1(lines 55 56) no Hoare annotation was computed. [2018-11-23 02:37:04,364 INFO L448 ceAbstractionStarter]: For program point fmax_doubleFINAL(lines 53 61) no Hoare annotation was computed. [2018-11-23 02:37:04,364 INFO L448 ceAbstractionStarter]: For program point fmax_doubleEXIT(lines 53 61) no Hoare annotation was computed. [2018-11-23 02:37:04,364 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 02:37:04,364 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 02:37:04,364 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 02:37:04,364 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 02:37:04,365 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 72) no Hoare annotation was computed. [2018-11-23 02:37:04,365 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 63 76) the Hoare annotation is: true [2018-11-23 02:37:04,365 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 63 76) no Hoare annotation was computed. [2018-11-23 02:37:04,365 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 63 76) no Hoare annotation was computed. [2018-11-23 02:37:04,365 INFO L448 ceAbstractionStarter]: For program point L72(line 72) no Hoare annotation was computed. [2018-11-23 02:37:04,365 INFO L444 ceAbstractionStarter]: At program point L71(line 71) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))) (and (= main_~y~0 .cse0) (= main_~res~0 .cse0))) [2018-11-23 02:37:04,365 INFO L448 ceAbstractionStarter]: For program point L71-1(lines 71 74) no Hoare annotation was computed. [2018-11-23 02:37:04,365 INFO L444 ceAbstractionStarter]: At program point L69(line 69) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))) (and (= main_~x~0 .cse0) (= main_~y~0 .cse0))) [2018-11-23 02:37:04,365 INFO L448 ceAbstractionStarter]: For program point L69-1(line 69) no Hoare annotation was computed. [2018-11-23 02:37:04,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:37:04 BoogieIcfgContainer [2018-11-23 02:37:04,369 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 02:37:04,369 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 02:37:04,369 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 02:37:04,369 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 02:37:04,370 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:37:01" (3/4) ... [2018-11-23 02:37:04,372 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 02:37:04,376 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure isnan_double [2018-11-23 02:37:04,376 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __fpclassify_double [2018-11-23 02:37:04,376 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 02:37:04,376 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fmax_double [2018-11-23 02:37:04,376 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 02:37:04,379 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2018-11-23 02:37:04,379 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-23 02:37:04,379 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 02:37:04,412 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_ae489eb7-ea58-49db-963e-bdef2ba600fc/bin-2019/utaipan/witness.graphml [2018-11-23 02:37:04,412 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 02:37:04,413 INFO L168 Benchmark]: Toolchain (without parser) took 3844.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 193.5 MB). Free memory was 943.8 MB in the beginning and 1.2 GB in the end (delta: -230.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:37:04,414 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 973.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:37:04,414 INFO L168 Benchmark]: CACSL2BoogieTranslator took 210.93 ms. Allocated memory is still 1.0 GB. Free memory was 943.8 MB in the beginning and 927.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-23 02:37:04,414 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.38 ms. Allocated memory is still 1.0 GB. Free memory is still 927.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:37:04,415 INFO L168 Benchmark]: Boogie Preprocessor took 25.74 ms. Allocated memory is still 1.0 GB. Free memory is still 927.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:37:04,415 INFO L168 Benchmark]: RCFGBuilder took 275.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 927.7 MB in the beginning and 1.1 GB in the end (delta: -169.9 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. [2018-11-23 02:37:04,415 INFO L168 Benchmark]: TraceAbstraction took 3269.11 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -83.7 MB). Peak memory consumption was 302.5 MB. Max. memory is 11.5 GB. [2018-11-23 02:37:04,415 INFO L168 Benchmark]: Witness Printer took 43.03 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2018-11-23 02:37:04,417 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 973.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 210.93 ms. Allocated memory is still 1.0 GB. Free memory was 943.8 MB in the beginning and 927.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 16.38 ms. Allocated memory is still 1.0 GB. Free memory is still 927.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.74 ms. Allocated memory is still 1.0 GB. Free memory is still 927.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 275.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 927.7 MB in the beginning and 1.1 GB in the end (delta: -169.9 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3269.11 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -83.7 MB). Peak memory consumption was 302.5 MB. Max. memory is 11.5 GB. * Witness Printer took 43.03 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 72]: 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: 29]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 37 locations, 1 error locations. SAFE Result, 3.2s OverallTime, 13 OverallIterations, 2 TraceHistogramMax, 1.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 498 SDtfs, 31 SDslu, 1315 SDs, 0 SdLazy, 221 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 403 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.9s 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.5s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 402 NumberOfCodeBlocks, 402 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 389 ConstructedInterpolants, 3 QuantifiedInterpolants, 21655 SizeOfPredicates, 15 NumberOfNonLiveVariables, 1167 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...