./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/float_req_bl_1270b.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_ee2acea4-24e4-47d8-ae0e-38bf876c75dc/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ee2acea4-24e4-47d8-ae0e-38bf876c75dc/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ee2acea4-24e4-47d8-ae0e-38bf876c75dc/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ee2acea4-24e4-47d8-ae0e-38bf876c75dc/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1270b.c -s /tmp/vcloud-vcloud-master/worker/run_dir_ee2acea4-24e4-47d8-ae0e-38bf876c75dc/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ee2acea4-24e4-47d8-ae0e-38bf876c75dc/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1203da81dc5c48f4dda347acec83e1939b55600b ............................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_ee2acea4-24e4-47d8-ae0e-38bf876c75dc/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ee2acea4-24e4-47d8-ae0e-38bf876c75dc/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ee2acea4-24e4-47d8-ae0e-38bf876c75dc/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ee2acea4-24e4-47d8-ae0e-38bf876c75dc/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1270b.c -s /tmp/vcloud-vcloud-master/worker/run_dir_ee2acea4-24e4-47d8-ae0e-38bf876c75dc/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ee2acea4-24e4-47d8-ae0e-38bf876c75dc/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1203da81dc5c48f4dda347acec83e1939b55600b ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 05:24:14,976 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 05:24:14,978 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 05:24:14,992 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 05:24:14,992 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 05:24:14,993 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 05:24:14,995 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 05:24:15,003 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 05:24:15,005 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 05:24:15,006 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 05:24:15,007 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 05:24:15,008 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 05:24:15,008 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 05:24:15,009 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 05:24:15,010 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 05:24:15,011 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 05:24:15,012 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 05:24:15,013 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 05:24:15,014 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 05:24:15,016 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 05:24:15,018 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 05:24:15,019 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 05:24:15,020 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 05:24:15,020 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 05:24:15,023 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 05:24:15,023 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 05:24:15,023 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 05:24:15,024 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 05:24:15,025 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 05:24:15,026 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 05:24:15,026 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 05:24:15,027 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 05:24:15,027 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 05:24:15,028 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 05:24:15,029 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 05:24:15,029 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 05:24:15,030 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 05:24:15,030 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 05:24:15,030 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 05:24:15,031 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 05:24:15,032 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 05:24:15,033 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ee2acea4-24e4-47d8-ae0e-38bf876c75dc/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 05:24:15,045 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 05:24:15,053 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 05:24:15,055 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 05:24:15,055 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 05:24:15,055 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 05:24:15,056 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 05:24:15,056 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 05:24:15,056 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 05:24:15,056 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 05:24:15,057 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 05:24:15,057 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 05:24:15,058 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 05:24:15,058 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 05:24:15,058 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 05:24:15,058 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 05:24:15,059 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 05:24:15,059 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 05:24:15,059 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 05:24:15,059 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 05:24:15,060 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 05:24:15,060 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 05:24:15,060 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 05:24:15,060 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 05:24:15,060 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 05:24:15,061 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 05:24:15,061 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 05:24:15,061 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 05:24:15,061 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 05:24:15,061 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/run_dir_ee2acea4-24e4-47d8-ae0e-38bf876c75dc/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1203da81dc5c48f4dda347acec83e1939b55600b [2019-11-20 05:24:15,214 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 05:24:15,228 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 05:24:15,237 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 05:24:15,244 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 05:24:15,245 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 05:24:15,246 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ee2acea4-24e4-47d8-ae0e-38bf876c75dc/bin/uautomizer/../../sv-benchmarks/c/float-newlib/float_req_bl_1270b.c [2019-11-20 05:24:15,298 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ee2acea4-24e4-47d8-ae0e-38bf876c75dc/bin/uautomizer/data/15c01cbdf/3785a71b46024bb2af9efdab6ff5ef86/FLAG04147f9af [2019-11-20 05:24:15,744 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 05:24:15,744 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ee2acea4-24e4-47d8-ae0e-38bf876c75dc/sv-benchmarks/c/float-newlib/float_req_bl_1270b.c [2019-11-20 05:24:15,756 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ee2acea4-24e4-47d8-ae0e-38bf876c75dc/bin/uautomizer/data/15c01cbdf/3785a71b46024bb2af9efdab6ff5ef86/FLAG04147f9af [2019-11-20 05:24:15,772 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ee2acea4-24e4-47d8-ae0e-38bf876c75dc/bin/uautomizer/data/15c01cbdf/3785a71b46024bb2af9efdab6ff5ef86 [2019-11-20 05:24:15,775 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 05:24:15,777 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 05:24:15,779 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 05:24:15,779 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 05:24:15,783 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 05:24:15,783 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:24:15" (1/1) ... [2019-11-20 05:24:15,786 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cf41693 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:24:15, skipping insertion in model container [2019-11-20 05:24:15,786 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:24:15" (1/1) ... [2019-11-20 05:24:15,792 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 05:24:15,814 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 05:24:16,063 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 05:24:16,066 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 05:24:16,112 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 05:24:16,131 INFO L192 MainTranslator]: Completed translation [2019-11-20 05:24:16,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:24:16 WrapperNode [2019-11-20 05:24:16,131 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 05:24:16,132 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 05:24:16,132 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 05:24:16,132 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 05:24:16,139 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:24:16" (1/1) ... [2019-11-20 05:24:16,154 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:24:16" (1/1) ... [2019-11-20 05:24:16,215 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 05:24:16,225 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 05:24:16,225 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 05:24:16,225 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 05:24:16,237 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:24:16" (1/1) ... [2019-11-20 05:24:16,237 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:24:16" (1/1) ... [2019-11-20 05:24:16,257 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:24:16" (1/1) ... [2019-11-20 05:24:16,257 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:24:16" (1/1) ... [2019-11-20 05:24:16,289 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:24:16" (1/1) ... [2019-11-20 05:24:16,306 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:24:16" (1/1) ... [2019-11-20 05:24:16,316 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:24:16" (1/1) ... [2019-11-20 05:24:16,320 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 05:24:16,324 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 05:24:16,324 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 05:24:16,325 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 05:24:16,326 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:24:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee2acea4-24e4-47d8-ae0e-38bf876c75dc/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 05:24:16,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 05:24:16,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2019-11-20 05:24:16,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-20 05:24:16,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-11-20 05:24:16,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 05:24:16,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 05:24:16,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-20 05:24:16,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 05:24:17,148 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 05:24:17,148 INFO L285 CfgBuilder]: Removed 52 assume(true) statements. [2019-11-20 05:24:17,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:24:17 BoogieIcfgContainer [2019-11-20 05:24:17,150 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 05:24:17,151 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 05:24:17,151 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 05:24:17,153 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 05:24:17,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:24:15" (1/3) ... [2019-11-20 05:24:17,154 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@88c5f48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:24:17, skipping insertion in model container [2019-11-20 05:24:17,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:24:16" (2/3) ... [2019-11-20 05:24:17,155 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@88c5f48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:24:17, skipping insertion in model container [2019-11-20 05:24:17,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:24:17" (3/3) ... [2019-11-20 05:24:17,161 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1270b.c [2019-11-20 05:24:17,170 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 05:24:17,177 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 05:24:17,186 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 05:24:17,209 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 05:24:17,209 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 05:24:17,209 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 05:24:17,209 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 05:24:17,210 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 05:24:17,210 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 05:24:17,210 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 05:24:17,211 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 05:24:17,225 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states. [2019-11-20 05:24:17,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-20 05:24:17,231 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:24:17,231 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:24:17,232 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:24:17,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:24:17,236 INFO L82 PathProgramCache]: Analyzing trace with hash 311741284, now seen corresponding path program 1 times [2019-11-20 05:24:17,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:24:17,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717899581] [2019-11-20 05:24:17,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:24:17,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:24:17,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:24:17,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717899581] [2019-11-20 05:24:17,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:24:17,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 05:24:17,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122726047] [2019-11-20 05:24:17,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-20 05:24:17,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:24:17,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-20 05:24:17,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 05:24:17,351 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 2 states. [2019-11-20 05:24:17,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:24:17,377 INFO L93 Difference]: Finished difference Result 212 states and 358 transitions. [2019-11-20 05:24:17,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-20 05:24:17,378 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-20 05:24:17,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:24:17,388 INFO L225 Difference]: With dead ends: 212 [2019-11-20 05:24:17,388 INFO L226 Difference]: Without dead ends: 104 [2019-11-20 05:24:17,391 INFO L630 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 [2019-11-20 05:24:17,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-20 05:24:17,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-11-20 05:24:17,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-20 05:24:17,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 136 transitions. [2019-11-20 05:24:17,430 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 136 transitions. Word has length 16 [2019-11-20 05:24:17,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:24:17,431 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 136 transitions. [2019-11-20 05:24:17,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-20 05:24:17,431 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 136 transitions. [2019-11-20 05:24:17,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 05:24:17,432 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:24:17,432 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:24:17,433 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:24:17,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:24:17,433 INFO L82 PathProgramCache]: Analyzing trace with hash 2055151297, now seen corresponding path program 1 times [2019-11-20 05:24:17,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:24:17,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678715366] [2019-11-20 05:24:17,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:24:17,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 05:24:17,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 05:24:17,589 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 05:24:17,590 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-20 05:24:17,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 05:24:17 BoogieIcfgContainer [2019-11-20 05:24:17,620 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 05:24:17,620 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 05:24:17,620 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 05:24:17,620 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 05:24:17,621 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:24:17" (3/4) ... [2019-11-20 05:24:17,624 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-20 05:24:17,624 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 05:24:17,626 INFO L168 Benchmark]: Toolchain (without parser) took 1848.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 948.7 MB in the beginning and 1.0 GB in the end (delta: -74.2 MB). Peak memory consumption was 52.7 MB. Max. memory is 11.5 GB. [2019-11-20 05:24:17,626 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 05:24:17,627 INFO L168 Benchmark]: CACSL2BoogieTranslator took 352.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -168.9 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2019-11-20 05:24:17,628 INFO L168 Benchmark]: Boogie Procedure Inliner took 92.30 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: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2019-11-20 05:24:17,628 INFO L168 Benchmark]: Boogie Preprocessor took 99.36 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: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 11.5 GB. [2019-11-20 05:24:17,629 INFO L168 Benchmark]: RCFGBuilder took 825.57 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: 57.7 MB). Peak memory consumption was 57.7 MB. Max. memory is 11.5 GB. [2019-11-20 05:24:17,629 INFO L168 Benchmark]: TraceAbstraction took 469.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 28.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. [2019-11-20 05:24:17,630 INFO L168 Benchmark]: Witness Printer took 4.26 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 05:24:17,633 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 352.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -168.9 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 92.30 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: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 99.36 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: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 825.57 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: 57.7 MB). Peak memory consumption was 57.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 469.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 28.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. * Witness Printer took 4.26 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 235]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryArithmeticFLOAToperation at line 118, overapproximation of bitwiseAnd at line 218. Possible FailurePath: [L12] static const float one_sqrt = 1.0, tiny_sqrt = 1.0e-30; VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L229] float x = -1.0f / 0.0f; [L230] float y = __VERIFIER_nondet_float(); [L82] float a = x, b = y, t1, t2, y1, y2, w; [L83] __int32_t j, k, ha, hb; VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L86] ieee_float_shape_type gf_u; [L87] gf_u.value = (x) [L88] EXPR gf_u.word [L88] (ha) = gf_u.word [L90] ha &= 0x7fffffffL VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L92] ieee_float_shape_type gf_u; [L93] gf_u.value = (y) [L94] EXPR gf_u.word [L94] (hb) = gf_u.word [L96] hb &= 0x7fffffffL VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L97] COND FALSE !(hb > ha) [L104] a = x [L105] b = y VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L108] ieee_float_shape_type sf_u; [L109] sf_u.word = (ha) [L110] EXPR sf_u.value [L110] (a) = sf_u.value [L113] ieee_float_shape_type sf_u; [L114] sf_u.word = (hb) [L115] EXPR sf_u.value [L115] (b) = sf_u.value [L117] COND TRUE (ha - hb) > 0xf000000L [L118] return a + b; VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L232] float res = __ieee754_hypotf(x, y); [L212] __int32_t ix; VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L214] ieee_float_shape_type gf_u; [L215] gf_u.value = (x) [L216] EXPR gf_u.word [L216] (ix) = gf_u.word [L218] ix &= 0x7fffffff [L219] return ((ix) == 0x7f800000L); VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L234] COND TRUE !isinf_float(res) [L235] __VERIFIER_error() VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 107 locations, 1 error locations. Result: UNSAFE, OverallTime: 0.4s, OverallIterations: 2, TraceHistogramMax: 1, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 139 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 37 NumberOfCodeBlocks, 37 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 225 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: 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.24-678e011 [2019-11-20 05:24:19,580 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 05:24:19,582 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 05:24:19,597 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 05:24:19,598 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 05:24:19,600 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 05:24:19,601 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 05:24:19,610 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 05:24:19,615 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 05:24:19,618 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 05:24:19,619 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 05:24:19,620 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 05:24:19,621 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 05:24:19,623 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 05:24:19,625 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 05:24:19,626 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 05:24:19,628 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 05:24:19,628 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 05:24:19,631 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 05:24:19,634 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 05:24:19,637 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 05:24:19,638 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 05:24:19,639 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 05:24:19,640 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 05:24:19,642 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 05:24:19,642 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 05:24:19,642 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 05:24:19,643 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 05:24:19,643 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 05:24:19,644 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 05:24:19,644 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 05:24:19,645 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 05:24:19,646 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 05:24:19,646 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 05:24:19,647 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 05:24:19,647 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 05:24:19,648 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 05:24:19,648 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 05:24:19,648 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 05:24:19,649 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 05:24:19,650 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 05:24:19,650 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ee2acea4-24e4-47d8-ae0e-38bf876c75dc/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-20 05:24:19,675 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 05:24:19,685 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 05:24:19,687 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 05:24:19,687 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 05:24:19,687 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 05:24:19,688 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 05:24:19,688 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 05:24:19,688 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 05:24:19,688 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 05:24:19,689 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 05:24:19,689 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 05:24:19,689 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 05:24:19,689 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 05:24:19,690 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 05:24:19,690 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 05:24:19,690 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 05:24:19,691 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 05:24:19,691 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 05:24:19,691 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 05:24:19,692 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 05:24:19,692 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 05:24:19,692 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 05:24:19,692 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 05:24:19,693 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 05:24:19,693 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 05:24:19,693 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 05:24:19,693 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 05:24:19,694 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 05:24:19,694 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 05:24:19,695 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 05:24:19,695 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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/run_dir_ee2acea4-24e4-47d8-ae0e-38bf876c75dc/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1203da81dc5c48f4dda347acec83e1939b55600b [2019-11-20 05:24:19,972 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 05:24:19,991 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 05:24:19,994 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 05:24:19,997 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 05:24:19,997 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 05:24:19,998 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ee2acea4-24e4-47d8-ae0e-38bf876c75dc/bin/uautomizer/../../sv-benchmarks/c/float-newlib/float_req_bl_1270b.c [2019-11-20 05:24:20,057 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ee2acea4-24e4-47d8-ae0e-38bf876c75dc/bin/uautomizer/data/760c542e7/e2086506970940fca377593f2b12e28a/FLAG75030e604 [2019-11-20 05:24:20,483 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 05:24:20,484 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ee2acea4-24e4-47d8-ae0e-38bf876c75dc/sv-benchmarks/c/float-newlib/float_req_bl_1270b.c [2019-11-20 05:24:20,491 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ee2acea4-24e4-47d8-ae0e-38bf876c75dc/bin/uautomizer/data/760c542e7/e2086506970940fca377593f2b12e28a/FLAG75030e604 [2019-11-20 05:24:20,893 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ee2acea4-24e4-47d8-ae0e-38bf876c75dc/bin/uautomizer/data/760c542e7/e2086506970940fca377593f2b12e28a [2019-11-20 05:24:20,895 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 05:24:20,896 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 05:24:20,897 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 05:24:20,897 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 05:24:20,902 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 05:24:20,903 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:24:20" (1/1) ... [2019-11-20 05:24:20,905 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bb862d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:24:20, skipping insertion in model container [2019-11-20 05:24:20,911 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:24:20" (1/1) ... [2019-11-20 05:24:20,916 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 05:24:20,957 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 05:24:21,241 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 05:24:21,252 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 05:24:21,391 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 05:24:21,419 INFO L192 MainTranslator]: Completed translation [2019-11-20 05:24:21,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:24:21 WrapperNode [2019-11-20 05:24:21,420 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 05:24:21,420 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 05:24:21,421 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 05:24:21,421 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 05:24:21,430 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:24:21" (1/1) ... [2019-11-20 05:24:21,459 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:24:21" (1/1) ... [2019-11-20 05:24:21,509 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 05:24:21,510 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 05:24:21,510 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 05:24:21,510 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 05:24:21,519 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:24:21" (1/1) ... [2019-11-20 05:24:21,519 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:24:21" (1/1) ... [2019-11-20 05:24:21,540 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:24:21" (1/1) ... [2019-11-20 05:24:21,542 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:24:21" (1/1) ... [2019-11-20 05:24:21,560 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:24:21" (1/1) ... [2019-11-20 05:24:21,569 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:24:21" (1/1) ... [2019-11-20 05:24:21,573 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:24:21" (1/1) ... [2019-11-20 05:24:21,585 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 05:24:21,585 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 05:24:21,585 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 05:24:21,585 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 05:24:21,586 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:24:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee2acea4-24e4-47d8-ae0e-38bf876c75dc/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 05:24:21,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 05:24:21,642 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2019-11-20 05:24:21,642 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-20 05:24:21,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 05:24:21,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 05:24:21,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2019-11-20 05:24:21,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-20 05:24:21,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 05:24:27,638 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 05:24:27,639 INFO L285 CfgBuilder]: Removed 52 assume(true) statements. [2019-11-20 05:24:27,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:24:27 BoogieIcfgContainer [2019-11-20 05:24:27,640 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 05:24:27,641 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 05:24:27,641 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 05:24:27,644 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 05:24:27,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:24:20" (1/3) ... [2019-11-20 05:24:27,645 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51137669 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:24:27, skipping insertion in model container [2019-11-20 05:24:27,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:24:21" (2/3) ... [2019-11-20 05:24:27,646 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51137669 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:24:27, skipping insertion in model container [2019-11-20 05:24:27,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:24:27" (3/3) ... [2019-11-20 05:24:27,647 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1270b.c [2019-11-20 05:24:27,654 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 05:24:27,660 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 05:24:27,668 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 05:24:27,689 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 05:24:27,690 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 05:24:27,690 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 05:24:27,690 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 05:24:27,690 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 05:24:27,690 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 05:24:27,690 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 05:24:27,691 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 05:24:27,706 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states. [2019-11-20 05:24:27,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-20 05:24:27,712 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:24:27,713 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:24:27,714 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:24:27,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:24:27,719 INFO L82 PathProgramCache]: Analyzing trace with hash 311741284, now seen corresponding path program 1 times [2019-11-20 05:24:27,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 05:24:27,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1895177927] [2019-11-20 05:24:27,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee2acea4-24e4-47d8-ae0e-38bf876c75dc/bin/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-11-20 05:24:27,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:24:27,862 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-20 05:24:27,866 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:24:27,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:24:27,878 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 05:24:27,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:24:27,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1895177927] [2019-11-20 05:24:27,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:24:27,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-20 05:24:27,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598238765] [2019-11-20 05:24:27,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-20 05:24:27,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 05:24:27,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-20 05:24:27,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 05:24:27,904 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 2 states. [2019-11-20 05:24:27,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:24:27,933 INFO L93 Difference]: Finished difference Result 212 states and 358 transitions. [2019-11-20 05:24:27,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-20 05:24:27,937 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-20 05:24:27,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:24:27,948 INFO L225 Difference]: With dead ends: 212 [2019-11-20 05:24:27,949 INFO L226 Difference]: Without dead ends: 104 [2019-11-20 05:24:27,952 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 05:24:27,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-20 05:24:27,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-11-20 05:24:27,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-20 05:24:27,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 136 transitions. [2019-11-20 05:24:27,989 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 136 transitions. Word has length 16 [2019-11-20 05:24:27,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:24:27,990 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 136 transitions. [2019-11-20 05:24:27,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-20 05:24:27,990 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 136 transitions. [2019-11-20 05:24:27,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 05:24:27,991 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:24:27,992 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:24:28,201 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-20 05:24:28,202 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:24:28,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:24:28,202 INFO L82 PathProgramCache]: Analyzing trace with hash 2055151297, now seen corresponding path program 1 times [2019-11-20 05:24:28,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 05:24:28,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [885115988] [2019-11-20 05:24:28,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee2acea4-24e4-47d8-ae0e-38bf876c75dc/bin/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-11-20 05:24:28,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:24:28,371 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-20 05:24:28,375 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:24:29,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:24:29,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:24:29,975 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 05:24:31,320 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-11-20 05:24:32,337 WARN L191 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-11-20 05:24:34,151 WARN L191 SmtUtils]: Spent 314.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-11-20 05:24:53,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:24:53,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [885115988] [2019-11-20 05:24:53,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:24:53,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13, 13] imperfect sequences [] total 24 [2019-11-20 05:24:53,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358415809] [2019-11-20 05:24:53,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-20 05:24:53,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 05:24:53,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-20 05:24:53,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=475, Unknown=5, NotChecked=0, Total=552 [2019-11-20 05:24:53,112 INFO L87 Difference]: Start difference. First operand 104 states and 136 transitions. Second operand 24 states. [2019-11-20 05:24:55,032 WARN L191 SmtUtils]: Spent 386.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-20 05:24:59,967 WARN L191 SmtUtils]: Spent 4.52 s on a formula simplification that was a NOOP. DAG size: 53 [2019-11-20 05:25:04,376 WARN L191 SmtUtils]: Spent 2.42 s on a formula simplification that was a NOOP. DAG size: 46 [2019-11-20 05:25:05,448 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-11-20 05:25:13,907 WARN L191 SmtUtils]: Spent 5.14 s on a formula simplification that was a NOOP. DAG size: 58 [2019-11-20 05:25:15,288 WARN L191 SmtUtils]: Spent 433.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-11-20 05:25:21,041 WARN L191 SmtUtils]: Spent 5.02 s on a formula simplification that was a NOOP. DAG size: 63 [2019-11-20 05:25:23,261 WARN L191 SmtUtils]: Spent 1.03 s on a formula simplification that was a NOOP. DAG size: 67 [2019-11-20 05:25:31,095 WARN L191 SmtUtils]: Spent 6.69 s on a formula simplification that was a NOOP. DAG size: 69 [2019-11-20 05:25:36,637 WARN L191 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-11-20 05:25:42,256 WARN L191 SmtUtils]: Spent 3.69 s on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-11-20 05:25:44,977 WARN L191 SmtUtils]: Spent 1.13 s on a formula simplification that was a NOOP. DAG size: 72 [2019-11-20 05:25:54,535 WARN L191 SmtUtils]: Spent 7.97 s on a formula simplification that was a NOOP. DAG size: 97 [2019-11-20 05:25:57,112 WARN L191 SmtUtils]: Spent 2.31 s on a formula simplification that was a NOOP. DAG size: 57 [2019-11-20 05:26:07,175 WARN L191 SmtUtils]: Spent 274.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-11-20 05:26:08,881 WARN L191 SmtUtils]: Spent 1.08 s on a formula simplification that was a NOOP. DAG size: 75 [2019-11-20 05:26:18,281 WARN L191 SmtUtils]: Spent 7.83 s on a formula simplification that was a NOOP. DAG size: 100 [2019-11-20 05:26:42,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:26:42,184 INFO L93 Difference]: Finished difference Result 343 states and 431 transitions. [2019-11-20 05:26:42,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-20 05:26:42,211 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-11-20 05:26:42,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:26:42,214 INFO L225 Difference]: With dead ends: 343 [2019-11-20 05:26:42,215 INFO L226 Difference]: Without dead ends: 244 [2019-11-20 05:26:42,218 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 85.5s TimeCoverageRelationStatistics Valid=470, Invalid=1595, Unknown=5, NotChecked=0, Total=2070 [2019-11-20 05:26:42,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-11-20 05:26:42,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 112. [2019-11-20 05:26:42,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-11-20 05:26:42,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 143 transitions. [2019-11-20 05:26:42,248 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 143 transitions. Word has length 21 [2019-11-20 05:26:42,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:26:42,248 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 143 transitions. [2019-11-20 05:26:42,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-20 05:26:42,256 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 143 transitions. [2019-11-20 05:26:42,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-20 05:26:42,257 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:26:42,257 INFO L410 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] [2019-11-20 05:26:42,478 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-20 05:26:42,479 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:26:42,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:26:42,479 INFO L82 PathProgramCache]: Analyzing trace with hash -927908549, now seen corresponding path program 1 times [2019-11-20 05:26:42,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 05:26:42,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1882421832] [2019-11-20 05:26:42,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee2acea4-24e4-47d8-ae0e-38bf876c75dc/bin/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-11-20 05:26:42,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:26:42,592 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 05:26:42,594 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:26:42,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:26:42,664 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 05:26:42,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:26:42,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1882421832] [2019-11-20 05:26:42,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:26:42,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2019-11-20 05:26:42,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215916446] [2019-11-20 05:26:42,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 05:26:42,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 05:26:42,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 05:26:42,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-20 05:26:42,745 INFO L87 Difference]: Start difference. First operand 112 states and 143 transitions. Second operand 10 states. [2019-11-20 05:26:43,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:26:43,228 INFO L93 Difference]: Finished difference Result 276 states and 354 transitions. [2019-11-20 05:26:43,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 05:26:43,231 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-11-20 05:26:43,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:26:43,236 INFO L225 Difference]: With dead ends: 276 [2019-11-20 05:26:43,236 INFO L226 Difference]: Without dead ends: 195 [2019-11-20 05:26:43,239 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2019-11-20 05:26:43,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-11-20 05:26:43,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 104. [2019-11-20 05:26:43,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-20 05:26:43,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 132 transitions. [2019-11-20 05:26:43,264 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 132 transitions. Word has length 24 [2019-11-20 05:26:43,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:26:43,264 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 132 transitions. [2019-11-20 05:26:43,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 05:26:43,264 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 132 transitions. [2019-11-20 05:26:43,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-20 05:26:43,266 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:26:43,266 INFO L410 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] [2019-11-20 05:26:43,473 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-20 05:26:43,473 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:26:43,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:26:43,473 INFO L82 PathProgramCache]: Analyzing trace with hash -558668800, now seen corresponding path program 1 times [2019-11-20 05:26:43,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 05:26:43,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1389723020] [2019-11-20 05:26:43,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee2acea4-24e4-47d8-ae0e-38bf876c75dc/bin/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-11-20 05:26:43,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:26:43,616 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-20 05:26:43,618 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:26:43,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:26:43,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:26:43,766 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 05:26:44,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:26:44,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1389723020] [2019-11-20 05:26:44,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:26:44,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 9] imperfect sequences [] total 17 [2019-11-20 05:26:44,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150465592] [2019-11-20 05:26:44,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-20 05:26:44,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 05:26:44,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-20 05:26:44,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-11-20 05:26:44,053 INFO L87 Difference]: Start difference. First operand 104 states and 132 transitions. Second operand 17 states. [2019-11-20 05:26:50,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:26:50,256 INFO L93 Difference]: Finished difference Result 128 states and 154 transitions. [2019-11-20 05:26:50,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-20 05:26:50,265 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 26 [2019-11-20 05:26:50,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:26:50,266 INFO L225 Difference]: With dead ends: 128 [2019-11-20 05:26:50,266 INFO L226 Difference]: Without dead ends: 110 [2019-11-20 05:26:50,267 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=229, Invalid=641, Unknown=0, NotChecked=0, Total=870 [2019-11-20 05:26:50,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-11-20 05:26:50,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 102. [2019-11-20 05:26:50,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-20 05:26:50,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 127 transitions. [2019-11-20 05:26:50,279 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 127 transitions. Word has length 26 [2019-11-20 05:26:50,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:26:50,279 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 127 transitions. [2019-11-20 05:26:50,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-20 05:26:50,279 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 127 transitions. [2019-11-20 05:26:50,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-20 05:26:50,281 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:26:50,281 INFO L410 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] [2019-11-20 05:26:50,491 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-20 05:26:50,491 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:26:50,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:26:50,491 INFO L82 PathProgramCache]: Analyzing trace with hash 121389570, now seen corresponding path program 1 times [2019-11-20 05:26:50,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 05:26:50,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1144861213] [2019-11-20 05:26:50,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee2acea4-24e4-47d8-ae0e-38bf876c75dc/bin/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-11-20 05:26:50,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:26:50,628 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-20 05:26:50,631 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:26:50,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:26:50,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:26:50,879 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 05:26:53,439 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_skolemized_v_prenex_5_5 (_ BitVec 32))) (or (= (_ bv2139095040 32) (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_5)) (not (= (let ((.cse0 (bvand (_ bv2147483647 32) c_ULTIMATE.start___ieee754_hypotf_~ha~0))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (fp ((_ extract 31 31) v_skolemized_v_prenex_5_5) ((_ extract 30 23) v_skolemized_v_prenex_5_5) ((_ extract 22 0) v_skolemized_v_prenex_5_5)))))) is different from false [2019-11-20 05:26:55,455 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_13| (_ BitVec 32)) (v_skolemized_v_prenex_5_5 (_ BitVec 32))) (or (not (= c_ULTIMATE.start___ieee754_hypotf_~x (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_13|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_13|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_13|)))) (= (_ bv2139095040 32) (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_5)) (not (= (fp ((_ extract 31 31) v_skolemized_v_prenex_5_5) ((_ extract 30 23) v_skolemized_v_prenex_5_5) ((_ extract 22 0) v_skolemized_v_prenex_5_5)) (let ((.cse0 (bvand (_ bv2147483647 32) |v_skolemized_q#valueAsBitvector_13|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))))))) is different from false [2019-11-20 05:26:55,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:26:55,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1144861213] [2019-11-20 05:26:55,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:26:55,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [] total 22 [2019-11-20 05:26:55,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860283421] [2019-11-20 05:26:55,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-20 05:26:55,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 05:26:55,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-20 05:26:55,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=336, Unknown=2, NotChecked=74, Total=462 [2019-11-20 05:26:55,465 INFO L87 Difference]: Start difference. First operand 102 states and 127 transitions. Second operand 22 states. [2019-11-20 05:26:57,603 WARN L191 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 39 DAG size of output: 23 [2019-11-20 05:27:04,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:27:04,428 INFO L93 Difference]: Finished difference Result 110 states and 134 transitions. [2019-11-20 05:27:04,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-20 05:27:04,428 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 26 [2019-11-20 05:27:04,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:27:04,429 INFO L225 Difference]: With dead ends: 110 [2019-11-20 05:27:04,429 INFO L226 Difference]: Without dead ends: 92 [2019-11-20 05:27:04,430 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=194, Invalid=682, Unknown=2, NotChecked=114, Total=992 [2019-11-20 05:27:04,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-11-20 05:27:04,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-11-20 05:27:04,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-11-20 05:27:04,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 116 transitions. [2019-11-20 05:27:04,439 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 116 transitions. Word has length 26 [2019-11-20 05:27:04,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:27:04,439 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 116 transitions. [2019-11-20 05:27:04,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-20 05:27:04,439 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 116 transitions. [2019-11-20 05:27:04,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-20 05:27:04,441 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:27:04,441 INFO L410 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, 1, 1, 1, 1] [2019-11-20 05:27:04,653 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-20 05:27:04,653 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:27:04,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:27:04,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1951072080, now seen corresponding path program 1 times [2019-11-20 05:27:04,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 05:27:04,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1198973270] [2019-11-20 05:27:04,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee2acea4-24e4-47d8-ae0e-38bf876c75dc/bin/uautomizer/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-11-20 05:27:05,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:27:05,099 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 05:27:05,101 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:27:05,448 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-11-20 05:27:05,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:27:05,465 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 05:27:08,977 WARN L191 SmtUtils]: Spent 343.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2019-11-20 05:27:14,785 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-11-20 05:27:19,030 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-11-20 05:27:31,489 WARN L191 SmtUtils]: Spent 548.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-11-20 05:27:31,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:27:31,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1198973270] [2019-11-20 05:27:31,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:27:31,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 14 [2019-11-20 05:27:31,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304689878] [2019-11-20 05:27:31,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-20 05:27:31,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 05:27:31,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-20 05:27:31,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=144, Unknown=2, NotChecked=0, Total=182 [2019-11-20 05:27:31,511 INFO L87 Difference]: Start difference. First operand 92 states and 116 transitions. Second operand 14 states. [2019-11-20 05:27:34,922 WARN L191 SmtUtils]: Spent 372.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-11-20 05:27:42,122 WARN L191 SmtUtils]: Spent 3.15 s on a formula simplification that was a NOOP. DAG size: 39 [2019-11-20 05:27:51,612 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-11-20 05:27:58,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:27:58,497 INFO L93 Difference]: Finished difference Result 152 states and 188 transitions. [2019-11-20 05:27:58,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 05:27:58,507 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2019-11-20 05:27:58,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:27:58,507 INFO L225 Difference]: With dead ends: 152 [2019-11-20 05:27:58,508 INFO L226 Difference]: Without dead ends: 113 [2019-11-20 05:27:58,508 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 37.3s TimeCoverageRelationStatistics Valid=96, Invalid=321, Unknown=3, NotChecked=0, Total=420 [2019-11-20 05:27:58,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-11-20 05:27:58,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 95. [2019-11-20 05:27:58,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-11-20 05:27:58,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 119 transitions. [2019-11-20 05:27:58,517 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 119 transitions. Word has length 34 [2019-11-20 05:27:58,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:27:58,518 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 119 transitions. [2019-11-20 05:27:58,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-20 05:27:58,518 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 119 transitions. [2019-11-20 05:27:58,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-20 05:27:58,519 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:27:58,520 INFO L410 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:27:58,724 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-20 05:27:58,725 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:27:58,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:27:58,725 INFO L82 PathProgramCache]: Analyzing trace with hash 13172387, now seen corresponding path program 1 times [2019-11-20 05:27:58,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 05:27:58,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1083117480] [2019-11-20 05:27:58,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee2acea4-24e4-47d8-ae0e-38bf876c75dc/bin/uautomizer/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-11-20 05:27:59,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:27:59,299 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-20 05:27:59,301 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:27:59,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:27:59,382 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 05:27:59,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:27:59,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1083117480] [2019-11-20 05:27:59,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:27:59,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2019-11-20 05:27:59,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810438195] [2019-11-20 05:27:59,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 05:27:59,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 05:27:59,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 05:27:59,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-11-20 05:27:59,704 INFO L87 Difference]: Start difference. First operand 95 states and 119 transitions. Second operand 12 states. [2019-11-20 05:27:59,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:27:59,851 INFO L93 Difference]: Finished difference Result 95 states and 119 transitions. [2019-11-20 05:27:59,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 05:27:59,852 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2019-11-20 05:27:59,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:27:59,853 INFO L225 Difference]: With dead ends: 95 [2019-11-20 05:27:59,853 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 05:27:59,853 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2019-11-20 05:27:59,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 05:27:59,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 05:27:59,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 05:27:59,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 05:27:59,854 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2019-11-20 05:27:59,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:27:59,854 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 05:27:59,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 05:27:59,854 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 05:27:59,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 05:28:00,055 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-20 05:28:00,058 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 05:28:00,179 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 178 [2019-11-20 05:28:24,719 WARN L191 SmtUtils]: Spent 24.42 s on a formula simplification. DAG size of input: 178 DAG size of output: 128 [2019-11-20 05:28:57,446 WARN L191 SmtUtils]: Spent 32.72 s on a formula simplification. DAG size of input: 210 DAG size of output: 181 [2019-11-20 05:29:24,560 WARN L191 SmtUtils]: Spent 27.10 s on a formula simplification. DAG size of input: 194 DAG size of output: 140 [2019-11-20 05:29:24,620 INFO L444 ceAbstractionStarter]: For program point L35-2(lines 35 39) no Hoare annotation was computed. [2019-11-20 05:29:24,620 INFO L444 ceAbstractionStarter]: For program point L35-3(lines 35 39) no Hoare annotation was computed. [2019-11-20 05:29:24,620 INFO L444 ceAbstractionStarter]: For program point L35-5(lines 35 39) no Hoare annotation was computed. [2019-11-20 05:29:24,621 INFO L444 ceAbstractionStarter]: For program point L234(lines 234 237) no Hoare annotation was computed. [2019-11-20 05:29:24,621 INFO L444 ceAbstractionStarter]: For program point L36-2(lines 36 37) no Hoare annotation was computed. [2019-11-20 05:29:24,621 INFO L440 ceAbstractionStarter]: At program point L36-3(lines 36 37) the Hoare annotation is: false [2019-11-20 05:29:24,621 INFO L444 ceAbstractionStarter]: For program point L36-4(lines 36 37) no Hoare annotation was computed. [2019-11-20 05:29:24,621 INFO L444 ceAbstractionStarter]: For program point L36-7(lines 36 37) no Hoare annotation was computed. [2019-11-20 05:29:24,621 INFO L440 ceAbstractionStarter]: At program point L36-8(lines 36 37) the Hoare annotation is: false [2019-11-20 05:29:24,621 INFO L444 ceAbstractionStarter]: For program point L36-9(lines 36 37) no Hoare annotation was computed. [2019-11-20 05:29:24,621 INFO L444 ceAbstractionStarter]: For program point L235(line 235) no Hoare annotation was computed. [2019-11-20 05:29:24,621 INFO L447 ceAbstractionStarter]: At program point L238(lines 222 239) the Hoare annotation is: true [2019-11-20 05:29:24,621 INFO L444 ceAbstractionStarter]: For program point L139(lines 139 143) no Hoare annotation was computed. [2019-11-20 05:29:24,621 INFO L444 ceAbstractionStarter]: For program point L139-1(lines 121 144) no Hoare annotation was computed. [2019-11-20 05:29:24,621 INFO L444 ceAbstractionStarter]: For program point L73-1(lines 73 77) no Hoare annotation was computed. [2019-11-20 05:29:24,622 INFO L440 ceAbstractionStarter]: At program point L73-2(lines 73 77) the Hoare annotation is: false [2019-11-20 05:29:24,622 INFO L444 ceAbstractionStarter]: For program point L73-3(lines 73 77) no Hoare annotation was computed. [2019-11-20 05:29:24,622 INFO L444 ceAbstractionStarter]: For program point L73-5(lines 73 77) no Hoare annotation was computed. [2019-11-20 05:29:24,622 INFO L440 ceAbstractionStarter]: At program point L73-6(lines 73 77) the Hoare annotation is: false [2019-11-20 05:29:24,622 INFO L444 ceAbstractionStarter]: For program point L73-7(lines 73 77) no Hoare annotation was computed. [2019-11-20 05:29:24,622 INFO L444 ceAbstractionStarter]: For program point L107(lines 107 111) no Hoare annotation was computed. [2019-11-20 05:29:24,622 INFO L444 ceAbstractionStarter]: For program point L107-1(lines 81 208) no Hoare annotation was computed. [2019-11-20 05:29:24,623 INFO L440 ceAbstractionStarter]: At program point L207(lines 81 208) the Hoare annotation is: (let ((.cse4 (= ULTIMATE.start___ieee754_hypotf_~x (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))))) (let ((.cse1 (and .cse4 (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_30 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))) (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30) ULTIMATE.start___ieee754_hypotf_~ha~0)))))) (or (and (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_36 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~ha~0_36) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~ha~0_36) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~ha~0_36)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))) (= ULTIMATE.start___ieee754_hypotf_~w~0 (let ((.cse0 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_36))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)))))) .cse1 (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_36 (_ BitVec 32))) (and (= |ULTIMATE.start___ieee754_hypotf_#res| (let ((.cse2 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_36))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))) (= (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~ha~0_36) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~ha~0_36) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~ha~0_36)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_36 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~ha~0_36) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~ha~0_36) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~ha~0_36)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))) (= ULTIMATE.start___ieee754_hypotf_~a~0 (let ((.cse3 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_36))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))))) (let ((.cse5 (not (bvsgt (bvadd (bvneg ULTIMATE.start___ieee754_hypotf_~hb~0) ULTIMATE.start___ieee754_hypotf_~ha~0) (_ bv251658240 32))))) (and .cse4 (forall ((v_skolemized_v_prenex_5_3 (_ BitVec 32))) (or (not (= |ULTIMATE.start___ieee754_hypotf_#res| (fp ((_ extract 31 31) v_skolemized_v_prenex_5_3) ((_ extract 30 23) v_skolemized_v_prenex_5_3) ((_ extract 22 0) v_skolemized_v_prenex_5_3)))) (= (_ bv2139095040 32) (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_3)))) (or .cse5 (forall ((v_skolemized_v_prenex_5_3 (_ BitVec 32))) (or (not (= (fp ((_ extract 31 31) v_skolemized_v_prenex_5_3) ((_ extract 30 23) v_skolemized_v_prenex_5_3) ((_ extract 22 0) v_skolemized_v_prenex_5_3)) (fp.add roundNearestTiesToEven ULTIMATE.start___ieee754_hypotf_~a~0 (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~hb~0))))) (= (_ bv2139095040 32) (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_3))))) (or (forall ((v_skolemized_v_prenex_5_3 (_ BitVec 32))) (or (not (= (fp ((_ extract 31 31) v_skolemized_v_prenex_5_3) ((_ extract 30 23) v_skolemized_v_prenex_5_3) ((_ extract 22 0) v_skolemized_v_prenex_5_3)) (fp.add roundNearestTiesToEven ULTIMATE.start___ieee754_hypotf_~a~0 ULTIMATE.start___ieee754_hypotf_~b~0))) (= (_ bv2139095040 32) (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_3)))) .cse5) (or (forall ((v_skolemized_v_prenex_5_3 (_ BitVec 32))) (or (not (= (fp ((_ extract 31 31) v_skolemized_v_prenex_5_3) ((_ extract 30 23) v_skolemized_v_prenex_5_3) ((_ extract 22 0) v_skolemized_v_prenex_5_3)) (fp.add roundNearestTiesToEven (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~ha~0)) (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~hb~0))))) (= (_ bv2139095040 32) (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_3)))) .cse5))) (and (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_35 (_ BitVec 32))) (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_35) ULTIMATE.start___ieee754_hypotf_~hb~0)) (or (and .cse4 (not (bvslt ULTIMATE.start___ieee754_hypotf_~hb~0 (_ bv645922816 32)))) .cse1) (forall ((v_skolemized_v_prenex_5_4 (_ BitVec 32))) (or (= (bvadd (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_4) (_ bv2155872256 32)) (_ bv0 32)) (not (= |ULTIMATE.start___ieee754_hypotf_#res| (fp ((_ extract 31 31) v_skolemized_v_prenex_5_4) ((_ extract 30 23) v_skolemized_v_prenex_5_4) ((_ extract 22 0) v_skolemized_v_prenex_5_4)))))) (forall ((v_skolemized_v_prenex_5_4 (_ BitVec 32))) (or (= (bvadd (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_4) (_ bv2155872256 32)) (_ bv0 32)) (not (= ULTIMATE.start___ieee754_hypotf_~w~0 (fp ((_ extract 31 31) v_skolemized_v_prenex_5_4) ((_ extract 30 23) v_skolemized_v_prenex_5_4) ((_ extract 22 0) v_skolemized_v_prenex_5_4)))))) (or (forall ((v_skolemized_v_prenex_5_4 (_ BitVec 32))) (or (= (bvadd (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_4) (_ bv2155872256 32)) (_ bv0 32)) (not (= ULTIMATE.start___ieee754_hypotf_~b~0 (fp ((_ extract 31 31) v_skolemized_v_prenex_5_4) ((_ extract 30 23) v_skolemized_v_prenex_5_4) ((_ extract 22 0) v_skolemized_v_prenex_5_4)))))) (not (= (bvadd ULTIMATE.start___ieee754_hypotf_~hb~0 (_ bv2155872256 32)) (_ bv0 32)))))))) [2019-11-20 05:29:24,623 INFO L444 ceAbstractionStarter]: For program point L42(lines 42 43) no Hoare annotation was computed. [2019-11-20 05:29:24,623 INFO L444 ceAbstractionStarter]: For program point L42-2(lines 42 43) no Hoare annotation was computed. [2019-11-20 05:29:24,623 INFO L444 ceAbstractionStarter]: For program point L42-3(lines 42 43) no Hoare annotation was computed. [2019-11-20 05:29:24,623 INFO L444 ceAbstractionStarter]: For program point L42-5(lines 42 43) no Hoare annotation was computed. [2019-11-20 05:29:24,623 INFO L444 ceAbstractionStarter]: For program point L175(lines 175 198) no Hoare annotation was computed. [2019-11-20 05:29:24,623 INFO L444 ceAbstractionStarter]: For program point L175-2(lines 81 208) no Hoare annotation was computed. [2019-11-20 05:29:24,623 INFO L444 ceAbstractionStarter]: For program point L176-1(lines 176 180) no Hoare annotation was computed. [2019-11-20 05:29:24,623 INFO L440 ceAbstractionStarter]: At program point L176-2(lines 176 180) the Hoare annotation is: false [2019-11-20 05:29:24,623 INFO L444 ceAbstractionStarter]: For program point L176-3(lines 176 180) no Hoare annotation was computed. [2019-11-20 05:29:24,624 INFO L440 ceAbstractionStarter]: At program point L78(lines 14 79) the Hoare annotation is: false [2019-11-20 05:29:24,624 INFO L440 ceAbstractionStarter]: At program point L78-1(lines 14 79) the Hoare annotation is: false [2019-11-20 05:29:24,624 INFO L444 ceAbstractionStarter]: For program point L145(lines 145 172) no Hoare annotation was computed. [2019-11-20 05:29:24,624 INFO L444 ceAbstractionStarter]: For program point L112(lines 112 116) no Hoare annotation was computed. [2019-11-20 05:29:24,624 INFO L444 ceAbstractionStarter]: For program point L112-1(lines 81 208) no Hoare annotation was computed. [2019-11-20 05:29:24,624 INFO L444 ceAbstractionStarter]: For program point L112-2(lines 81 208) no Hoare annotation was computed. [2019-11-20 05:29:24,624 INFO L444 ceAbstractionStarter]: For program point L146(lines 146 171) no Hoare annotation was computed. [2019-11-20 05:29:24,624 INFO L444 ceAbstractionStarter]: For program point L213-1(lines 213 217) no Hoare annotation was computed. [2019-11-20 05:29:24,625 INFO L440 ceAbstractionStarter]: At program point L213-2(lines 213 217) the Hoare annotation is: (let ((.cse5 (= ULTIMATE.start___ieee754_hypotf_~x (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))))) (let ((.cse2 (and .cse5 (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_30 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))) (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30) ULTIMATE.start___ieee754_hypotf_~ha~0)))))) (or (and (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_36 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~ha~0_36) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~ha~0_36) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~ha~0_36)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))) (= ULTIMATE.start_isinf_float_~x (let ((.cse0 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_36))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)))))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_36 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~ha~0_36) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~ha~0_36) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~ha~0_36)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))) (= ULTIMATE.start___ieee754_hypotf_~w~0 (let ((.cse1 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_36))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1)))))) .cse2 (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_36 (_ BitVec 32))) (and (= |ULTIMATE.start___ieee754_hypotf_#res| (let ((.cse3 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_36))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3)))) (= (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~ha~0_36) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~ha~0_36) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~ha~0_36)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_36 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~ha~0_36) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~ha~0_36) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~ha~0_36)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))) (= ULTIMATE.start___ieee754_hypotf_~a~0 (let ((.cse4 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_36))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))))) (let ((.cse6 (not (bvsgt (bvadd (bvneg ULTIMATE.start___ieee754_hypotf_~hb~0) ULTIMATE.start___ieee754_hypotf_~ha~0) (_ bv251658240 32))))) (and .cse5 (forall ((v_skolemized_v_prenex_5_3 (_ BitVec 32))) (or (not (= (fp ((_ extract 31 31) v_skolemized_v_prenex_5_3) ((_ extract 30 23) v_skolemized_v_prenex_5_3) ((_ extract 22 0) v_skolemized_v_prenex_5_3)) ULTIMATE.start_isinf_float_~x)) (= (_ bv2139095040 32) (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_3)))) (forall ((v_skolemized_v_prenex_5_3 (_ BitVec 32))) (or (not (= |ULTIMATE.start___ieee754_hypotf_#res| (fp ((_ extract 31 31) v_skolemized_v_prenex_5_3) ((_ extract 30 23) v_skolemized_v_prenex_5_3) ((_ extract 22 0) v_skolemized_v_prenex_5_3)))) (= (_ bv2139095040 32) (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_3)))) (or .cse6 (forall ((v_skolemized_v_prenex_5_3 (_ BitVec 32))) (or (not (= (fp ((_ extract 31 31) v_skolemized_v_prenex_5_3) ((_ extract 30 23) v_skolemized_v_prenex_5_3) ((_ extract 22 0) v_skolemized_v_prenex_5_3)) (fp.add roundNearestTiesToEven ULTIMATE.start___ieee754_hypotf_~a~0 (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~hb~0))))) (= (_ bv2139095040 32) (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_3))))) (or (forall ((v_skolemized_v_prenex_5_3 (_ BitVec 32))) (or (not (= (fp ((_ extract 31 31) v_skolemized_v_prenex_5_3) ((_ extract 30 23) v_skolemized_v_prenex_5_3) ((_ extract 22 0) v_skolemized_v_prenex_5_3)) (fp.add roundNearestTiesToEven ULTIMATE.start___ieee754_hypotf_~a~0 ULTIMATE.start___ieee754_hypotf_~b~0))) (= (_ bv2139095040 32) (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_3)))) .cse6) (or (forall ((v_skolemized_v_prenex_5_3 (_ BitVec 32))) (or (not (= (fp ((_ extract 31 31) v_skolemized_v_prenex_5_3) ((_ extract 30 23) v_skolemized_v_prenex_5_3) ((_ extract 22 0) v_skolemized_v_prenex_5_3)) (fp.add roundNearestTiesToEven (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~ha~0)) (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~hb~0))))) (= (_ bv2139095040 32) (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_3)))) .cse6))) (and (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_35 (_ BitVec 32))) (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_35) ULTIMATE.start___ieee754_hypotf_~hb~0)) (or (and .cse5 (not (bvslt ULTIMATE.start___ieee754_hypotf_~hb~0 (_ bv645922816 32)))) .cse2) (forall ((v_skolemized_v_prenex_5_4 (_ BitVec 32))) (or (= (bvadd (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_4) (_ bv2155872256 32)) (_ bv0 32)) (not (= |ULTIMATE.start___ieee754_hypotf_#res| (fp ((_ extract 31 31) v_skolemized_v_prenex_5_4) ((_ extract 30 23) v_skolemized_v_prenex_5_4) ((_ extract 22 0) v_skolemized_v_prenex_5_4)))))) (forall ((v_skolemized_v_prenex_5_4 (_ BitVec 32))) (or (= (bvadd (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_4) (_ bv2155872256 32)) (_ bv0 32)) (not (= (fp ((_ extract 31 31) v_skolemized_v_prenex_5_4) ((_ extract 30 23) v_skolemized_v_prenex_5_4) ((_ extract 22 0) v_skolemized_v_prenex_5_4)) ULTIMATE.start_isinf_float_~x)))) (forall ((v_skolemized_v_prenex_5_4 (_ BitVec 32))) (or (= (bvadd (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_4) (_ bv2155872256 32)) (_ bv0 32)) (not (= ULTIMATE.start___ieee754_hypotf_~w~0 (fp ((_ extract 31 31) v_skolemized_v_prenex_5_4) ((_ extract 30 23) v_skolemized_v_prenex_5_4) ((_ extract 22 0) v_skolemized_v_prenex_5_4)))))) (or (forall ((v_skolemized_v_prenex_5_4 (_ BitVec 32))) (or (= (bvadd (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_4) (_ bv2155872256 32)) (_ bv0 32)) (not (= ULTIMATE.start___ieee754_hypotf_~b~0 (fp ((_ extract 31 31) v_skolemized_v_prenex_5_4) ((_ extract 30 23) v_skolemized_v_prenex_5_4) ((_ extract 22 0) v_skolemized_v_prenex_5_4)))))) (not (= (bvadd ULTIMATE.start___ieee754_hypotf_~hb~0 (_ bv2155872256 32)) (_ bv0 32)))))))) [2019-11-20 05:29:24,625 INFO L444 ceAbstractionStarter]: For program point L213-3(lines 213 217) no Hoare annotation was computed. [2019-11-20 05:29:24,625 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 171) no Hoare annotation was computed. [2019-11-20 05:29:24,625 INFO L444 ceAbstractionStarter]: For program point L149-1(lines 149 153) no Hoare annotation was computed. [2019-11-20 05:29:24,625 INFO L440 ceAbstractionStarter]: At program point L149-2(lines 149 153) the Hoare annotation is: false [2019-11-20 05:29:24,625 INFO L444 ceAbstractionStarter]: For program point L149-3(lines 149 153) no Hoare annotation was computed. [2019-11-20 05:29:24,625 INFO L440 ceAbstractionStarter]: At program point L50-2(lines 50 59) the Hoare annotation is: false [2019-11-20 05:29:24,625 INFO L444 ceAbstractionStarter]: For program point L50-3(lines 14 79) no Hoare annotation was computed. [2019-11-20 05:29:24,626 INFO L440 ceAbstractionStarter]: At program point L50-6(lines 50 59) the Hoare annotation is: false [2019-11-20 05:29:24,626 INFO L444 ceAbstractionStarter]: For program point L50-7(lines 14 79) no Hoare annotation was computed. [2019-11-20 05:29:24,626 INFO L444 ceAbstractionStarter]: For program point L85-1(lines 85 89) no Hoare annotation was computed. [2019-11-20 05:29:24,626 INFO L444 ceAbstractionStarter]: For program point L52(lines 52 56) no Hoare annotation was computed. [2019-11-20 05:29:24,626 INFO L440 ceAbstractionStarter]: At program point L85-2(lines 85 89) the Hoare annotation is: (and (= ULTIMATE.start___ieee754_hypotf_~x (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))) (forall ((v_skolemized_v_prenex_5_5 (_ BitVec 32))) (or (not (= (fp ((_ extract 31 31) v_skolemized_v_prenex_5_5) ((_ extract 30 23) v_skolemized_v_prenex_5_5) ((_ extract 22 0) v_skolemized_v_prenex_5_5)) ULTIMATE.start___ieee754_hypotf_~a~0)) (= (_ bv2139095040 32) (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_5))))) [2019-11-20 05:29:24,629 INFO L444 ceAbstractionStarter]: For program point L85-3(lines 85 89) no Hoare annotation was computed. [2019-11-20 05:29:24,629 INFO L444 ceAbstractionStarter]: For program point L19-1(lines 19 23) no Hoare annotation was computed. [2019-11-20 05:29:24,630 INFO L444 ceAbstractionStarter]: For program point L52-2(lines 52 56) no Hoare annotation was computed. [2019-11-20 05:29:24,630 INFO L440 ceAbstractionStarter]: At program point L19-2(lines 19 23) the Hoare annotation is: false [2019-11-20 05:29:24,630 INFO L444 ceAbstractionStarter]: For program point L52-3(lines 52 56) no Hoare annotation was computed. [2019-11-20 05:29:24,630 INFO L444 ceAbstractionStarter]: For program point L19-3(lines 19 23) no Hoare annotation was computed. [2019-11-20 05:29:24,630 INFO L444 ceAbstractionStarter]: For program point L52-5(lines 52 56) no Hoare annotation was computed. [2019-11-20 05:29:24,630 INFO L444 ceAbstractionStarter]: For program point L19-5(lines 19 23) no Hoare annotation was computed. [2019-11-20 05:29:24,630 INFO L440 ceAbstractionStarter]: At program point L19-6(lines 19 23) the Hoare annotation is: false [2019-11-20 05:29:24,630 INFO L444 ceAbstractionStarter]: For program point L19-7(lines 19 23) no Hoare annotation was computed. [2019-11-20 05:29:24,630 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 05:29:24,630 INFO L444 ceAbstractionStarter]: For program point L185-1(lines 185 189) no Hoare annotation was computed. [2019-11-20 05:29:24,630 INFO L440 ceAbstractionStarter]: At program point L185-2(lines 185 189) the Hoare annotation is: false [2019-11-20 05:29:24,630 INFO L444 ceAbstractionStarter]: For program point L185-3(lines 185 189) no Hoare annotation was computed. [2019-11-20 05:29:24,631 INFO L440 ceAbstractionStarter]: At program point L219(lines 211 220) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start___ieee754_hypotf_~x (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))))) (let ((.cse5 (and .cse0 (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_30 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))) (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30) ULTIMATE.start___ieee754_hypotf_~ha~0))))) (.cse4 (= (bvadd |ULTIMATE.start_isinf_float_#res| (_ bv4294967295 32)) (_ bv0 32)))) (or (let ((.cse3 (not (bvsgt (bvadd (bvneg ULTIMATE.start___ieee754_hypotf_~hb~0) ULTIMATE.start___ieee754_hypotf_~ha~0) (_ bv251658240 32))))) (and .cse0 (forall ((v_skolemized_v_prenex_5_3 (_ BitVec 32))) (or (not (= (fp ((_ extract 31 31) v_skolemized_v_prenex_5_3) ((_ extract 30 23) v_skolemized_v_prenex_5_3) ((_ extract 22 0) v_skolemized_v_prenex_5_3)) ULTIMATE.start_isinf_float_~x)) (= (_ bv2139095040 32) (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_3)))) (forall ((v_skolemized_v_prenex_5_3 (_ BitVec 32))) (or (not (= |ULTIMATE.start___ieee754_hypotf_#res| (fp ((_ extract 31 31) v_skolemized_v_prenex_5_3) ((_ extract 30 23) v_skolemized_v_prenex_5_3) ((_ extract 22 0) v_skolemized_v_prenex_5_3)))) (= (_ bv2139095040 32) (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_3)))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_26 (_ BitVec 32)) (v_ULTIMATE.start___ieee754_hypotf_~hb~0_27 (_ BitVec 32))) (let ((.cse1 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_26)) (.cse2 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_27))) (and (= (fp ((_ extract 31 31) ULTIMATE.start_isinf_float_~ix~1) ((_ extract 30 23) ULTIMATE.start_isinf_float_~ix~1) ((_ extract 22 0) ULTIMATE.start_isinf_float_~ix~1)) (fp.add roundNearestTiesToEven (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1)) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))) (= (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~ha~0_26) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~ha~0_26) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~ha~0_26))) (bvsgt (bvadd .cse1 (bvneg .cse2)) (_ bv251658240 32))))) (or .cse3 (forall ((v_skolemized_v_prenex_5_3 (_ BitVec 32))) (or (not (= (fp ((_ extract 31 31) v_skolemized_v_prenex_5_3) ((_ extract 30 23) v_skolemized_v_prenex_5_3) ((_ extract 22 0) v_skolemized_v_prenex_5_3)) (fp.add roundNearestTiesToEven ULTIMATE.start___ieee754_hypotf_~a~0 (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~hb~0))))) (= (_ bv2139095040 32) (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_3))))) (or (forall ((v_skolemized_v_prenex_5_3 (_ BitVec 32))) (or (not (= (fp ((_ extract 31 31) v_skolemized_v_prenex_5_3) ((_ extract 30 23) v_skolemized_v_prenex_5_3) ((_ extract 22 0) v_skolemized_v_prenex_5_3)) (fp.add roundNearestTiesToEven ULTIMATE.start___ieee754_hypotf_~a~0 ULTIMATE.start___ieee754_hypotf_~b~0))) (= (_ bv2139095040 32) (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_3)))) .cse3) .cse4 (or (forall ((v_skolemized_v_prenex_5_3 (_ BitVec 32))) (or (not (= (fp ((_ extract 31 31) v_skolemized_v_prenex_5_3) ((_ extract 30 23) v_skolemized_v_prenex_5_3) ((_ extract 22 0) v_skolemized_v_prenex_5_3)) (fp.add roundNearestTiesToEven (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~ha~0)) (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~hb~0))))) (= (_ bv2139095040 32) (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_3)))) .cse3))) (and (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_35 (_ BitVec 32))) (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_35) ULTIMATE.start___ieee754_hypotf_~hb~0)) (or (and .cse0 (not (bvslt ULTIMATE.start___ieee754_hypotf_~hb~0 (_ bv645922816 32)))) .cse5) (forall ((v_skolemized_v_prenex_5_4 (_ BitVec 32))) (or (= (bvadd (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_4) (_ bv2155872256 32)) (_ bv0 32)) (not (= |ULTIMATE.start___ieee754_hypotf_#res| (fp ((_ extract 31 31) v_skolemized_v_prenex_5_4) ((_ extract 30 23) v_skolemized_v_prenex_5_4) ((_ extract 22 0) v_skolemized_v_prenex_5_4)))))) (forall ((v_skolemized_v_prenex_5_4 (_ BitVec 32))) (or (= (bvadd (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_4) (_ bv2155872256 32)) (_ bv0 32)) (not (= (fp ((_ extract 31 31) v_skolemized_v_prenex_5_4) ((_ extract 30 23) v_skolemized_v_prenex_5_4) ((_ extract 22 0) v_skolemized_v_prenex_5_4)) ULTIMATE.start_isinf_float_~x)))) (forall ((v_skolemized_v_prenex_5_4 (_ BitVec 32))) (or (= (bvadd (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_4) (_ bv2155872256 32)) (_ bv0 32)) (not (= ULTIMATE.start___ieee754_hypotf_~w~0 (fp ((_ extract 31 31) v_skolemized_v_prenex_5_4) ((_ extract 30 23) v_skolemized_v_prenex_5_4) ((_ extract 22 0) v_skolemized_v_prenex_5_4)))))) (or (forall ((v_skolemized_v_prenex_5_4 (_ BitVec 32))) (or (= (bvadd (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_4) (_ bv2155872256 32)) (_ bv0 32)) (not (= ULTIMATE.start___ieee754_hypotf_~b~0 (fp ((_ extract 31 31) v_skolemized_v_prenex_5_4) ((_ extract 30 23) v_skolemized_v_prenex_5_4) ((_ extract 22 0) v_skolemized_v_prenex_5_4)))))) (not (= (bvadd ULTIMATE.start___ieee754_hypotf_~hb~0 (_ bv2155872256 32)) (_ bv0 32)))) (= (fp ((_ extract 31 31) ULTIMATE.start_isinf_float_~ix~1) ((_ extract 30 23) ULTIMATE.start_isinf_float_~ix~1) ((_ extract 22 0) ULTIMATE.start_isinf_float_~ix~1)) (fp (_ bv0 1) (_ bv255 8) (_ bv0 23))) .cse4) (and (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_36 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~ha~0_36) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~ha~0_36) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~ha~0_36)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))) (= ULTIMATE.start_isinf_float_~x (let ((.cse6 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_36))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6)))))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_36 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~ha~0_36) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~ha~0_36) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~ha~0_36)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))) (= ULTIMATE.start___ieee754_hypotf_~w~0 (let ((.cse7 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_36))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7)))))) .cse5 (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_36 (_ BitVec 32))) (and (= |ULTIMATE.start___ieee754_hypotf_#res| (let ((.cse8 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_36))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8)))) (= (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~ha~0_36) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~ha~0_36) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~ha~0_36)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_36 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) ULTIMATE.start_isinf_float_~ix~1) ((_ extract 30 23) ULTIMATE.start_isinf_float_~ix~1) ((_ extract 22 0) ULTIMATE.start_isinf_float_~ix~1)) (let ((.cse9 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_36))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9)))) (= (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~ha~0_36) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~ha~0_36) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~ha~0_36)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_36 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~ha~0_36) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~ha~0_36) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~ha~0_36)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))) (= ULTIMATE.start___ieee754_hypotf_~a~0 (let ((.cse10 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_36))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10)))))) .cse4)))) [2019-11-20 05:29:24,631 INFO L444 ceAbstractionStarter]: For program point L121(lines 121 144) no Hoare annotation was computed. [2019-11-20 05:29:24,631 INFO L444 ceAbstractionStarter]: For program point L121-1(lines 81 208) no Hoare annotation was computed. [2019-11-20 05:29:24,631 INFO L444 ceAbstractionStarter]: For program point L122(lines 122 129) no Hoare annotation was computed. [2019-11-20 05:29:24,631 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 05:29:24,631 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 125) no Hoare annotation was computed. [2019-11-20 05:29:24,631 INFO L444 ceAbstractionStarter]: For program point L91-1(lines 91 95) no Hoare annotation was computed. [2019-11-20 05:29:24,632 INFO L444 ceAbstractionStarter]: For program point L124-2(lines 122 129) no Hoare annotation was computed. [2019-11-20 05:29:24,632 INFO L440 ceAbstractionStarter]: At program point L91-2(lines 91 95) the Hoare annotation is: (and (= ULTIMATE.start___ieee754_hypotf_~x (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))) (forall ((v_skolemized_v_prenex_5_5 (_ BitVec 32))) (or (not (= (fp ((_ extract 31 31) v_skolemized_v_prenex_5_5) ((_ extract 30 23) v_skolemized_v_prenex_5_5) ((_ extract 22 0) v_skolemized_v_prenex_5_5)) ULTIMATE.start___ieee754_hypotf_~a~0)) (= (_ bv2139095040 32) (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_5)))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_40 (_ BitVec 32))) (and (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_40) ULTIMATE.start___ieee754_hypotf_~ha~0) (= (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~ha~0_40) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~ha~0_40) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~ha~0_40)))))) [2019-11-20 05:29:24,632 INFO L444 ceAbstractionStarter]: For program point L91-3(lines 91 95) no Hoare annotation was computed. [2019-11-20 05:29:24,632 INFO L444 ceAbstractionStarter]: For program point L191-1(lines 191 195) no Hoare annotation was computed. [2019-11-20 05:29:24,632 INFO L440 ceAbstractionStarter]: At program point L191-2(lines 191 195) the Hoare annotation is: false [2019-11-20 05:29:24,632 INFO L444 ceAbstractionStarter]: For program point L191-3(lines 191 195) no Hoare annotation was computed. [2019-11-20 05:29:24,632 INFO L444 ceAbstractionStarter]: For program point L26(lines 26 27) no Hoare annotation was computed. [2019-11-20 05:29:24,632 INFO L444 ceAbstractionStarter]: For program point L26-1(lines 26 27) no Hoare annotation was computed. [2019-11-20 05:29:24,632 INFO L444 ceAbstractionStarter]: For program point L126-1(lines 126 127) no Hoare annotation was computed. [2019-11-20 05:29:24,632 INFO L444 ceAbstractionStarter]: For program point L61(lines 61 70) no Hoare annotation was computed. [2019-11-20 05:29:24,632 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 05:29:24,633 INFO L444 ceAbstractionStarter]: For program point L61-1(lines 61 70) no Hoare annotation was computed. [2019-11-20 05:29:24,633 INFO L444 ceAbstractionStarter]: For program point L161-1(lines 161 165) no Hoare annotation was computed. [2019-11-20 05:29:24,633 INFO L440 ceAbstractionStarter]: At program point L161-2(lines 161 165) the Hoare annotation is: false [2019-11-20 05:29:24,633 INFO L444 ceAbstractionStarter]: For program point L29(lines 29 30) no Hoare annotation was computed. [2019-11-20 05:29:24,633 INFO L444 ceAbstractionStarter]: For program point L29-1(lines 29 30) no Hoare annotation was computed. [2019-11-20 05:29:24,633 INFO L444 ceAbstractionStarter]: For program point L63(lines 63 69) no Hoare annotation was computed. [2019-11-20 05:29:24,633 INFO L444 ceAbstractionStarter]: For program point L63-2(lines 63 69) no Hoare annotation was computed. [2019-11-20 05:29:24,634 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 106) no Hoare annotation was computed. [2019-11-20 05:29:24,634 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 32) no Hoare annotation was computed. [2019-11-20 05:29:24,634 INFO L444 ceAbstractionStarter]: For program point L31-1(lines 31 32) no Hoare annotation was computed. [2019-11-20 05:29:24,634 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 68) no Hoare annotation was computed. [2019-11-20 05:29:24,634 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-20 05:29:24,634 INFO L444 ceAbstractionStarter]: For program point L65-3(lines 65 68) no Hoare annotation was computed. [2019-11-20 05:29:24,634 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 235) no Hoare annotation was computed. [2019-11-20 05:29:24,634 INFO L444 ceAbstractionStarter]: For program point L166(lines 166 170) no Hoare annotation was computed. [2019-11-20 05:29:24,635 INFO L444 ceAbstractionStarter]: For program point L166-1(lines 157 171) no Hoare annotation was computed. [2019-11-20 05:29:24,635 INFO L444 ceAbstractionStarter]: For program point L200-1(lines 200 204) no Hoare annotation was computed. [2019-11-20 05:29:24,635 INFO L440 ceAbstractionStarter]: At program point L200-2(lines 200 204) the Hoare annotation is: false [2019-11-20 05:29:24,635 INFO L444 ceAbstractionStarter]: For program point L134-1(lines 134 138) no Hoare annotation was computed. [2019-11-20 05:29:24,635 INFO L444 ceAbstractionStarter]: For program point L200-3(lines 200 204) no Hoare annotation was computed. [2019-11-20 05:29:24,635 INFO L440 ceAbstractionStarter]: At program point L134-2(lines 134 138) the Hoare annotation is: false [2019-11-20 05:29:24,635 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 39) no Hoare annotation was computed. [2019-11-20 05:29:24,640 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:556) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:256) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-20 05:29:24,651 INFO L168 Benchmark]: Toolchain (without parser) took 303754.92 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 249.6 MB). Free memory was 957.8 MB in the beginning and 1.2 GB in the end (delta: -248.3 MB). Peak memory consumption was 341.8 MB. Max. memory is 11.5 GB. [2019-11-20 05:29:24,652 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 05:29:24,655 INFO L168 Benchmark]: CACSL2BoogieTranslator took 522.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.2 MB). Free memory was 957.8 MB in the beginning and 1.2 GB in the end (delta: -197.1 MB). Peak memory consumption was 27.4 MB. Max. memory is 11.5 GB. [2019-11-20 05:29:24,657 INFO L168 Benchmark]: Boogie Procedure Inliner took 89.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. [2019-11-20 05:29:24,658 INFO L168 Benchmark]: Boogie Preprocessor took 75.07 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. [2019-11-20 05:29:24,658 INFO L168 Benchmark]: RCFGBuilder took 6055.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 11.5 GB. [2019-11-20 05:29:24,659 INFO L168 Benchmark]: TraceAbstraction took 297009.11 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 84.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -110.5 MB). Peak memory consumption was 314.5 MB. Max. memory is 11.5 GB. [2019-11-20 05:29:24,662 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 522.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.2 MB). Free memory was 957.8 MB in the beginning and 1.2 GB in the end (delta: -197.1 MB). Peak memory consumption was 27.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 89.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 75.07 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. * RCFGBuilder took 6055.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 297009.11 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 84.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -110.5 MB). Peak memory consumption was 314.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 235]: 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 - ExceptionOrErrorResult: UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...