./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 cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_114ab56f-92a5-4fd6-9a74-39d22853ae40/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_114ab56f-92a5-4fd6-9a74-39d22853ae40/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_114ab56f-92a5-4fd6-9a74-39d22853ae40/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_114ab56f-92a5-4fd6-9a74-39d22853ae40/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1270b.c -s /tmp/vcloud-vcloud-master/worker/run_dir_114ab56f-92a5-4fd6-9a74-39d22853ae40/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_114ab56f-92a5-4fd6-9a74-39d22853ae40/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_114ab56f-92a5-4fd6-9a74-39d22853ae40/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_114ab56f-92a5-4fd6-9a74-39d22853ae40/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_114ab56f-92a5-4fd6-9a74-39d22853ae40/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_114ab56f-92a5-4fd6-9a74-39d22853ae40/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1270b.c -s /tmp/vcloud-vcloud-master/worker/run_dir_114ab56f-92a5-4fd6-9a74-39d22853ae40/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_114ab56f-92a5-4fd6-9a74-39d22853ae40/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-cad4683 [2019-11-15 22:32:29,036 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:32:29,038 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:32:29,058 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:32:29,058 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:32:29,060 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:32:29,062 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:32:29,072 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:32:29,074 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:32:29,075 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:32:29,076 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:32:29,078 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:32:29,078 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:32:29,079 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:32:29,080 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:32:29,081 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:32:29,082 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:32:29,083 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:32:29,085 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:32:29,088 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:32:29,089 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:32:29,091 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:32:29,092 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:32:29,093 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:32:29,096 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:32:29,096 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:32:29,097 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:32:29,098 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:32:29,098 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:32:29,099 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:32:29,100 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:32:29,100 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:32:29,101 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:32:29,102 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:32:29,103 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:32:29,104 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:32:29,104 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:32:29,105 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:32:29,105 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:32:29,106 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:32:29,107 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:32:29,107 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_114ab56f-92a5-4fd6-9a74-39d22853ae40/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 22:32:29,123 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:32:29,123 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:32:29,124 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:32:29,125 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:32:29,125 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:32:29,126 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:32:29,126 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:32:29,126 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:32:29,126 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:32:29,127 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:32:29,127 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 22:32:29,127 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:32:29,128 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 22:32:29,128 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:32:29,128 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:32:29,129 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:32:29,129 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 22:32:29,129 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:32:29,129 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:32:29,130 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:32:29,130 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:32:29,130 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:32:29,131 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:32:29,131 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:32:29,131 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 22:32:29,132 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:32:29,132 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 22:32:29,132 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 22:32:29,133 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_114ab56f-92a5-4fd6-9a74-39d22853ae40/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-15 22:32:29,164 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:32:29,184 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:32:29,187 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:32:29,188 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:32:29,189 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:32:29,189 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_114ab56f-92a5-4fd6-9a74-39d22853ae40/bin/uautomizer/../../sv-benchmarks/c/float-newlib/float_req_bl_1270b.c [2019-11-15 22:32:29,248 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_114ab56f-92a5-4fd6-9a74-39d22853ae40/bin/uautomizer/data/36fe6c9b9/13166bc6815a49559395b8e0dc0cd612/FLAG1a41f8b86 [2019-11-15 22:32:29,688 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:32:29,689 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_114ab56f-92a5-4fd6-9a74-39d22853ae40/sv-benchmarks/c/float-newlib/float_req_bl_1270b.c [2019-11-15 22:32:29,698 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_114ab56f-92a5-4fd6-9a74-39d22853ae40/bin/uautomizer/data/36fe6c9b9/13166bc6815a49559395b8e0dc0cd612/FLAG1a41f8b86 [2019-11-15 22:32:30,025 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_114ab56f-92a5-4fd6-9a74-39d22853ae40/bin/uautomizer/data/36fe6c9b9/13166bc6815a49559395b8e0dc0cd612 [2019-11-15 22:32:30,027 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:32:30,029 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:32:30,030 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:32:30,030 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:32:30,034 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:32:30,035 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:32:30" (1/1) ... [2019-11-15 22:32:30,038 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c5f3365 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:32:30, skipping insertion in model container [2019-11-15 22:32:30,038 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:32:30" (1/1) ... [2019-11-15 22:32:30,045 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:32:30,074 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:32:30,559 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:32:30,564 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:32:30,626 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:32:30,663 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:32:30,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:32:30 WrapperNode [2019-11-15 22:32:30,664 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:32:30,666 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:32:30,666 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:32:30,666 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:32:30,677 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:32:30" (1/1) ... [2019-11-15 22:32:30,710 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:32:30" (1/1) ... [2019-11-15 22:32:30,782 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:32:30,782 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:32:30,782 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:32:30,782 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:32:30,800 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:32:30" (1/1) ... [2019-11-15 22:32:30,800 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:32:30" (1/1) ... [2019-11-15 22:32:30,820 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:32:30" (1/1) ... [2019-11-15 22:32:30,820 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:32:30" (1/1) ... [2019-11-15 22:32:30,853 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:32:30" (1/1) ... [2019-11-15 22:32:30,878 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:32:30" (1/1) ... [2019-11-15 22:32:30,881 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:32:30" (1/1) ... [2019-11-15 22:32:30,894 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:32:30,895 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:32:30,895 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:32:30,895 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:32:30,899 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:32:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_114ab56f-92a5-4fd6-9a74-39d22853ae40/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-15 22:32:30,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 22:32:30,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2019-11-15 22:32:30,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 22:32:30,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-11-15 22:32:30,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:32:30,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:32:30,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 22:32:30,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 22:32:31,858 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:32:31,859 INFO L284 CfgBuilder]: Removed 52 assume(true) statements. [2019-11-15 22:32:31,860 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:32:31 BoogieIcfgContainer [2019-11-15 22:32:31,860 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:32:31,862 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:32:31,862 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:32:31,865 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:32:31,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:32:30" (1/3) ... [2019-11-15 22:32:31,866 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c40baf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:32:31, skipping insertion in model container [2019-11-15 22:32:31,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:32:30" (2/3) ... [2019-11-15 22:32:31,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c40baf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:32:31, skipping insertion in model container [2019-11-15 22:32:31,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:32:31" (3/3) ... [2019-11-15 22:32:31,869 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1270b.c [2019-11-15 22:32:31,877 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:32:31,885 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 22:32:31,896 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 22:32:31,926 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:32:31,926 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 22:32:31,926 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:32:31,926 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:32:31,926 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:32:31,927 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:32:31,927 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:32:31,927 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:32:31,947 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states. [2019-11-15 22:32:31,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-15 22:32:31,955 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:32:31,956 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:32:31,958 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:32:31,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:32:31,965 INFO L82 PathProgramCache]: Analyzing trace with hash 311741284, now seen corresponding path program 1 times [2019-11-15 22:32:31,972 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:32:31,972 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985642843] [2019-11-15 22:32:31,973 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:31,973 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:31,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:32:32,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:32:32,101 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-15 22:32:32,101 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985642843] [2019-11-15 22:32:32,102 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:32:32,102 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 22:32:32,103 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441724449] [2019-11-15 22:32:32,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-15 22:32:32,108 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:32:32,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-15 22:32:32,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 22:32:32,123 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 2 states. [2019-11-15 22:32:32,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:32:32,154 INFO L93 Difference]: Finished difference Result 212 states and 358 transitions. [2019-11-15 22:32:32,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 22:32:32,156 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-15 22:32:32,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:32:32,169 INFO L225 Difference]: With dead ends: 212 [2019-11-15 22:32:32,170 INFO L226 Difference]: Without dead ends: 104 [2019-11-15 22:32:32,173 INFO L600 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-15 22:32:32,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-15 22:32:32,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-11-15 22:32:32,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-15 22:32:32,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 136 transitions. [2019-11-15 22:32:32,223 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 136 transitions. Word has length 16 [2019-11-15 22:32:32,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:32:32,224 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 136 transitions. [2019-11-15 22:32:32,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-15 22:32:32,224 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 136 transitions. [2019-11-15 22:32:32,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-15 22:32:32,226 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:32:32,226 INFO L380 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-15 22:32:32,226 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:32:32,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:32:32,227 INFO L82 PathProgramCache]: Analyzing trace with hash 2055151297, now seen corresponding path program 1 times [2019-11-15 22:32:32,227 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:32:32,227 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130759695] [2019-11-15 22:32:32,227 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:32,228 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:32:32,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:32:32,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:32:32,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:32:32,501 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:32:32,501 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 22:32:32,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 10:32:32 BoogieIcfgContainer [2019-11-15 22:32:32,576 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 22:32:32,576 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:32:32,576 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:32:32,577 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:32:32,578 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:32:31" (3/4) ... [2019-11-15 22:32:32,582 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 22:32:32,582 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:32:32,585 INFO L168 Benchmark]: Toolchain (without parser) took 2554.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 944.7 MB in the beginning and 1.0 GB in the end (delta: -100.5 MB). Peak memory consumption was 56.3 MB. Max. memory is 11.5 GB. [2019-11-15 22:32:32,585 INFO L168 Benchmark]: CDTParser took 0.24 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-15 22:32:32,587 INFO L168 Benchmark]: CACSL2BoogieTranslator took 635.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -195.6 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2019-11-15 22:32:32,588 INFO L168 Benchmark]: Boogie Procedure Inliner took 116.20 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-15 22:32:32,589 INFO L168 Benchmark]: Boogie Preprocessor took 112.19 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-15 22:32:32,589 INFO L168 Benchmark]: RCFGBuilder took 965.87 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.9 MB). Peak memory consumption was 57.9 MB. Max. memory is 11.5 GB. [2019-11-15 22:32:32,591 INFO L168 Benchmark]: TraceAbstraction took 714.40 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: 28.4 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. [2019-11-15 22:32:32,591 INFO L168 Benchmark]: Witness Printer took 5.56 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: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:32:32,601 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.24 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 635.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -195.6 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 116.20 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. * Boogie Preprocessor took 112.19 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 965.87 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.9 MB). Peak memory consumption was 57.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 714.40 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: 28.4 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. * Witness Printer took 5.56 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: 7.1 MB). Peak memory consumption was 7.1 MB. 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.6s, 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.1s 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-cad4683 [2019-11-15 22:32:35,480 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:32:35,483 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:32:35,503 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:32:35,503 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:32:35,505 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:32:35,508 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:32:35,520 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:32:35,524 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:32:35,527 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:32:35,530 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:32:35,532 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:32:35,533 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:32:35,536 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:32:35,538 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:32:35,540 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:32:35,541 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:32:35,544 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:32:35,547 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:32:35,551 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:32:35,555 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:32:35,558 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:32:35,561 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:32:35,564 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:32:35,567 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:32:35,567 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:32:35,568 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:32:35,569 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:32:35,570 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:32:35,571 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:32:35,572 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:32:35,572 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:32:35,573 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:32:35,574 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:32:35,576 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:32:35,576 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:32:35,577 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:32:35,578 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:32:35,578 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:32:35,580 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:32:35,580 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:32:35,582 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_114ab56f-92a5-4fd6-9a74-39d22853ae40/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-15 22:32:35,615 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:32:35,627 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:32:35,628 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:32:35,629 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:32:35,629 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:32:35,629 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:32:35,630 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:32:35,630 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:32:35,630 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:32:35,630 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 22:32:35,631 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:32:35,631 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 22:32:35,631 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-15 22:32:35,631 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-15 22:32:35,632 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:32:35,632 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:32:35,632 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:32:35,632 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 22:32:35,633 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:32:35,633 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:32:35,633 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:32:35,634 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:32:35,634 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:32:35,634 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:32:35,634 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:32:35,635 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 22:32:35,635 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-15 22:32:35,635 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-15 22:32:35,635 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 22:32:35,636 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-15 22:32:35,636 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_114ab56f-92a5-4fd6-9a74-39d22853ae40/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-15 22:32:35,681 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:32:35,693 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:32:35,697 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:32:35,698 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:32:35,699 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:32:35,699 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_114ab56f-92a5-4fd6-9a74-39d22853ae40/bin/uautomizer/../../sv-benchmarks/c/float-newlib/float_req_bl_1270b.c [2019-11-15 22:32:35,759 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_114ab56f-92a5-4fd6-9a74-39d22853ae40/bin/uautomizer/data/ab98c4d3b/bcee03a29db64d0f8a46fb16d345840b/FLAGe234ecf9e [2019-11-15 22:32:36,233 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:32:36,234 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_114ab56f-92a5-4fd6-9a74-39d22853ae40/sv-benchmarks/c/float-newlib/float_req_bl_1270b.c [2019-11-15 22:32:36,243 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_114ab56f-92a5-4fd6-9a74-39d22853ae40/bin/uautomizer/data/ab98c4d3b/bcee03a29db64d0f8a46fb16d345840b/FLAGe234ecf9e [2019-11-15 22:32:36,611 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_114ab56f-92a5-4fd6-9a74-39d22853ae40/bin/uautomizer/data/ab98c4d3b/bcee03a29db64d0f8a46fb16d345840b [2019-11-15 22:32:36,614 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:32:36,615 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:32:36,616 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:32:36,616 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:32:36,620 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:32:36,621 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:32:36" (1/1) ... [2019-11-15 22:32:36,624 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23172392 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:32:36, skipping insertion in model container [2019-11-15 22:32:36,624 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:32:36" (1/1) ... [2019-11-15 22:32:36,632 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:32:36,672 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:32:36,914 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:32:36,921 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:32:37,071 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:32:37,108 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:32:37,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:32:37 WrapperNode [2019-11-15 22:32:37,109 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:32:37,110 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:32:37,111 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:32:37,111 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:32:37,120 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:32:37" (1/1) ... [2019-11-15 22:32:37,138 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:32:37" (1/1) ... [2019-11-15 22:32:37,191 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:32:37,191 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:32:37,192 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:32:37,192 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:32:37,202 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:32:37" (1/1) ... [2019-11-15 22:32:37,203 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:32:37" (1/1) ... [2019-11-15 22:32:37,211 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:32:37" (1/1) ... [2019-11-15 22:32:37,211 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:32:37" (1/1) ... [2019-11-15 22:32:37,234 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:32:37" (1/1) ... [2019-11-15 22:32:37,247 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:32:37" (1/1) ... [2019-11-15 22:32:37,252 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:32:37" (1/1) ... [2019-11-15 22:32:37,259 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:32:37,260 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:32:37,260 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:32:37,260 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:32:37,261 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:32:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_114ab56f-92a5-4fd6-9a74-39d22853ae40/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-15 22:32:37,324 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 22:32:37,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2019-11-15 22:32:37,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-15 22:32:37,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:32:37,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:32:37,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2019-11-15 22:32:37,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-15 22:32:37,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 22:32:43,998 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:32:43,999 INFO L284 CfgBuilder]: Removed 52 assume(true) statements. [2019-11-15 22:32:44,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:32:44 BoogieIcfgContainer [2019-11-15 22:32:44,000 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:32:44,002 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:32:44,002 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:32:44,006 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:32:44,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:32:36" (1/3) ... [2019-11-15 22:32:44,007 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1806cc14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:32:44, skipping insertion in model container [2019-11-15 22:32:44,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:32:37" (2/3) ... [2019-11-15 22:32:44,008 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1806cc14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:32:44, skipping insertion in model container [2019-11-15 22:32:44,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:32:44" (3/3) ... [2019-11-15 22:32:44,010 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1270b.c [2019-11-15 22:32:44,022 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:32:44,031 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 22:32:44,043 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 22:32:44,072 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:32:44,072 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 22:32:44,072 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:32:44,073 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:32:44,073 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:32:44,073 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:32:44,073 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:32:44,073 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:32:44,093 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states. [2019-11-15 22:32:44,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-15 22:32:44,101 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:32:44,102 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:32:44,105 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:32:44,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:32:44,111 INFO L82 PathProgramCache]: Analyzing trace with hash 311741284, now seen corresponding path program 1 times [2019-11-15 22:32:44,124 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:32:44,124 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1098944327] [2019-11-15 22:32:44,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_114ab56f-92a5-4fd6-9a74-39d22853ae40/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-15 22:32:44,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:32:44,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-15 22:32:44,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:32:44,290 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-15 22:32:44,290 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:32:44,297 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-15 22:32:44,298 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1098944327] [2019-11-15 22:32:44,299 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:32:44,301 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-15 22:32:44,302 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798538597] [2019-11-15 22:32:44,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-15 22:32:44,306 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:32:44,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-15 22:32:44,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 22:32:44,320 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 2 states. [2019-11-15 22:32:44,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:32:44,359 INFO L93 Difference]: Finished difference Result 212 states and 358 transitions. [2019-11-15 22:32:44,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 22:32:44,361 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-15 22:32:44,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:32:44,375 INFO L225 Difference]: With dead ends: 212 [2019-11-15 22:32:44,375 INFO L226 Difference]: Without dead ends: 104 [2019-11-15 22:32:44,380 INFO L600 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-15 22:32:44,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-15 22:32:44,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-11-15 22:32:44,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-15 22:32:44,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 136 transitions. [2019-11-15 22:32:44,442 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 136 transitions. Word has length 16 [2019-11-15 22:32:44,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:32:44,442 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 136 transitions. [2019-11-15 22:32:44,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-15 22:32:44,443 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 136 transitions. [2019-11-15 22:32:44,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-15 22:32:44,444 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:32:44,444 INFO L380 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-15 22:32:44,647 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-15 22:32:44,648 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:32:44,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:32:44,648 INFO L82 PathProgramCache]: Analyzing trace with hash 2055151297, now seen corresponding path program 1 times [2019-11-15 22:32:44,649 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:32:44,650 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [431025337] [2019-11-15 22:32:44,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_114ab56f-92a5-4fd6-9a74-39d22853ae40/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-15 22:32:44,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:32:44,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-15 22:32:44,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:32:46,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:32:47,001 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-15 22:32:47,002 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:32:48,984 WARN L191 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-11-15 22:32:50,570 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-11-15 22:32:52,816 WARN L191 SmtUtils]: Spent 361.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-11-15 22:33:09,424 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-15 22:33:09,424 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [431025337] [2019-11-15 22:33:09,425 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:33:09,425 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13, 13] imperfect sequences [] total 24 [2019-11-15 22:33:09,425 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477918129] [2019-11-15 22:33:09,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-15 22:33:09,428 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:33:09,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-15 22:33:09,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=476, Unknown=4, NotChecked=0, Total=552 [2019-11-15 22:33:09,430 INFO L87 Difference]: Start difference. First operand 104 states and 136 transitions. Second operand 24 states. [2019-11-15 22:33:12,308 WARN L191 SmtUtils]: Spent 1.01 s on a formula simplification that was a NOOP. DAG size: 50 [2019-11-15 22:33:20,397 WARN L191 SmtUtils]: Spent 7.70 s on a formula simplification that was a NOOP. DAG size: 53 [2019-11-15 22:33:24,089 WARN L191 SmtUtils]: Spent 821.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-15 22:33:25,179 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-11-15 22:33:33,518 WARN L191 SmtUtils]: Spent 7.16 s on a formula simplification that was a NOOP. DAG size: 58 [2019-11-15 22:33:35,098 WARN L191 SmtUtils]: Spent 473.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-11-15 22:33:41,138 WARN L191 SmtUtils]: Spent 5.34 s on a formula simplification that was a NOOP. DAG size: 63 [2019-11-15 22:33:43,554 WARN L191 SmtUtils]: Spent 1.12 s on a formula simplification that was a NOOP. DAG size: 67 [2019-11-15 22:33:51,977 WARN L191 SmtUtils]: Spent 7.36 s on a formula simplification that was a NOOP. DAG size: 69 [2019-11-15 22:33:57,684 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-11-15 22:34:04,613 WARN L191 SmtUtils]: Spent 5.38 s on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-11-15 22:34:08,355 WARN L191 SmtUtils]: Spent 1.61 s on a formula simplification that was a NOOP. DAG size: 72 [2019-11-15 22:34:21,039 WARN L191 SmtUtils]: Spent 11.25 s on a formula simplification that was a NOOP. DAG size: 97 [2019-11-15 22:34:23,813 WARN L191 SmtUtils]: Spent 2.57 s on a formula simplification that was a NOOP. DAG size: 57 [2019-11-15 22:34:34,321 WARN L191 SmtUtils]: Spent 499.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-11-15 22:34:36,856 WARN L191 SmtUtils]: Spent 1.67 s on a formula simplification that was a NOOP. DAG size: 75 [2019-11-15 22:34:49,354 WARN L191 SmtUtils]: Spent 9.18 s on a formula simplification that was a NOOP. DAG size: 100 [2019-11-15 22:35:17,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:35:17,518 INFO L93 Difference]: Finished difference Result 343 states and 431 transitions. [2019-11-15 22:35:17,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-15 22:35:17,556 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-11-15 22:35:17,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:35:17,560 INFO L225 Difference]: With dead ends: 343 [2019-11-15 22:35:17,560 INFO L226 Difference]: Without dead ends: 244 [2019-11-15 22:35:17,563 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 99.3s TimeCoverageRelationStatistics Valid=470, Invalid=1596, Unknown=4, NotChecked=0, Total=2070 [2019-11-15 22:35:17,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-11-15 22:35:17,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 112. [2019-11-15 22:35:17,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-11-15 22:35:17,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 143 transitions. [2019-11-15 22:35:17,584 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 143 transitions. Word has length 21 [2019-11-15 22:35:17,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:35:17,585 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 143 transitions. [2019-11-15 22:35:17,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-15 22:35:17,585 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 143 transitions. [2019-11-15 22:35:17,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-15 22:35:17,587 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:35:17,587 INFO L380 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-15 22:35:17,811 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-15 22:35:17,811 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:35:17,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:35:17,812 INFO L82 PathProgramCache]: Analyzing trace with hash -927908549, now seen corresponding path program 1 times [2019-11-15 22:35:17,812 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:35:17,812 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1821718076] [2019-11-15 22:35:17,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_114ab56f-92a5-4fd6-9a74-39d22853ae40/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-15 22:35:17,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:35:17,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 22:35:17,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:35:17,988 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-15 22:35:17,989 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:35:18,100 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-15 22:35:18,100 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1821718076] [2019-11-15 22:35:18,100 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:35:18,100 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2019-11-15 22:35:18,101 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047005702] [2019-11-15 22:35:18,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 22:35:18,101 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:35:18,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 22:35:18,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-15 22:35:18,102 INFO L87 Difference]: Start difference. First operand 112 states and 143 transitions. Second operand 10 states. [2019-11-15 22:35:18,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:35:18,870 INFO L93 Difference]: Finished difference Result 276 states and 354 transitions. [2019-11-15 22:35:18,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:35:18,872 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-11-15 22:35:18,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:35:18,877 INFO L225 Difference]: With dead ends: 276 [2019-11-15 22:35:18,878 INFO L226 Difference]: Without dead ends: 195 [2019-11-15 22:35:18,882 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2019-11-15 22:35:18,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-11-15 22:35:18,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 104. [2019-11-15 22:35:18,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-15 22:35:18,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 132 transitions. [2019-11-15 22:35:18,917 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 132 transitions. Word has length 24 [2019-11-15 22:35:18,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:35:18,918 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 132 transitions. [2019-11-15 22:35:18,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 22:35:18,919 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 132 transitions. [2019-11-15 22:35:18,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 22:35:18,921 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:35:18,921 INFO L380 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-15 22:35:19,143 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-15 22:35:19,144 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:35:19,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:35:19,144 INFO L82 PathProgramCache]: Analyzing trace with hash -558668800, now seen corresponding path program 1 times [2019-11-15 22:35:19,144 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:35:19,145 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [340647823] [2019-11-15 22:35:19,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_114ab56f-92a5-4fd6-9a74-39d22853ae40/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-15 22:35:19,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:35:19,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-15 22:35:19,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:35:19,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:35:19,452 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-15 22:35:19,452 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:35:19,799 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-15 22:35:19,800 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [340647823] [2019-11-15 22:35:19,800 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:35:19,800 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10, 9] imperfect sequences [] total 17 [2019-11-15 22:35:19,800 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783189411] [2019-11-15 22:35:19,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-15 22:35:19,801 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:35:19,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-15 22:35:19,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-11-15 22:35:19,801 INFO L87 Difference]: Start difference. First operand 104 states and 132 transitions. Second operand 17 states. [2019-11-15 22:35:28,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:35:28,648 INFO L93 Difference]: Finished difference Result 128 states and 154 transitions. [2019-11-15 22:35:28,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-15 22:35:28,661 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 26 [2019-11-15 22:35:28,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:35:28,662 INFO L225 Difference]: With dead ends: 128 [2019-11-15 22:35:28,662 INFO L226 Difference]: Without dead ends: 110 [2019-11-15 22:35:28,663 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=229, Invalid=641, Unknown=0, NotChecked=0, Total=870 [2019-11-15 22:35:28,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-11-15 22:35:28,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 102. [2019-11-15 22:35:28,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-15 22:35:28,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 127 transitions. [2019-11-15 22:35:28,676 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 127 transitions. Word has length 26 [2019-11-15 22:35:28,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:35:28,676 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 127 transitions. [2019-11-15 22:35:28,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-15 22:35:28,677 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 127 transitions. [2019-11-15 22:35:28,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 22:35:28,678 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:35:28,678 INFO L380 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-15 22:35:28,890 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-15 22:35:28,890 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:35:28,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:35:28,890 INFO L82 PathProgramCache]: Analyzing trace with hash 121389570, now seen corresponding path program 1 times [2019-11-15 22:35:28,891 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:35:28,891 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1438391611] [2019-11-15 22:35:28,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_114ab56f-92a5-4fd6-9a74-39d22853ae40/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-15 22:35:29,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:35:29,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-15 22:35:29,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:35:29,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:35:29,289 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-15 22:35:29,290 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:35:31,904 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-15 22:35:33,925 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-15 22:35:33,949 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-15 22:35:33,950 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1438391611] [2019-11-15 22:35:33,950 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:35:33,950 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [] total 22 [2019-11-15 22:35:33,951 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368818057] [2019-11-15 22:35:33,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-15 22:35:33,958 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:35:33,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-15 22:35:33,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=336, Unknown=2, NotChecked=74, Total=462 [2019-11-15 22:35:33,959 INFO L87 Difference]: Start difference. First operand 102 states and 127 transitions. Second operand 22 states. [2019-11-15 22:35:36,107 WARN L191 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 39 DAG size of output: 23 [2019-11-15 22:35:44,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:35:44,183 INFO L93 Difference]: Finished difference Result 110 states and 134 transitions. [2019-11-15 22:35:44,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 22:35:44,184 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 26 [2019-11-15 22:35:44,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:35:44,185 INFO L225 Difference]: With dead ends: 110 [2019-11-15 22:35:44,186 INFO L226 Difference]: Without dead ends: 92 [2019-11-15 22:35:44,186 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=194, Invalid=682, Unknown=2, NotChecked=114, Total=992 [2019-11-15 22:35:44,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-11-15 22:35:44,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-11-15 22:35:44,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-11-15 22:35:44,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 116 transitions. [2019-11-15 22:35:44,196 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 116 transitions. Word has length 26 [2019-11-15 22:35:44,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:35:44,196 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 116 transitions. [2019-11-15 22:35:44,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-15 22:35:44,197 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 116 transitions. [2019-11-15 22:35:44,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-15 22:35:44,198 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:35:44,199 INFO L380 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-15 22:35:44,407 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-15 22:35:44,407 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:35:44,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:35:44,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1951072080, now seen corresponding path program 1 times [2019-11-15 22:35:44,408 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:35:44,408 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1006541275] [2019-11-15 22:35:44,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_114ab56f-92a5-4fd6-9a74-39d22853ae40/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-15 22:35:44,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:35:44,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 22:35:44,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:35:45,390 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-11-15 22:35:45,412 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-15 22:35:45,413 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:35:51,793 WARN L191 SmtUtils]: Spent 526.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2019-11-15 22:35:53,761 WARN L191 SmtUtils]: Spent 617.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-11-15 22:36:01,366 WARN L191 SmtUtils]: Spent 1.30 s on a formula simplification that was a NOOP. DAG size: 11 [2019-11-15 22:36:06,577 WARN L191 SmtUtils]: Spent 525.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-11-15 22:36:21,374 WARN L191 SmtUtils]: Spent 1.92 s on a formula simplification that was a NOOP. DAG size: 21 [2019-11-15 22:36:21,396 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-15 22:36:21,396 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1006541275] [2019-11-15 22:36:21,396 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:21,397 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 14 [2019-11-15 22:36:21,397 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179997391] [2019-11-15 22:36:21,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-15 22:36:21,397 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:36:21,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 22:36:21,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=140, Unknown=5, NotChecked=0, Total=182 [2019-11-15 22:36:21,398 INFO L87 Difference]: Start difference. First operand 92 states and 116 transitions. Second operand 14 states. [2019-11-15 22:36:27,051 WARN L191 SmtUtils]: Spent 4.04 s on a formula simplification that was a NOOP. DAG size: 31 [2019-11-15 22:36:30,925 WARN L191 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-11-15 22:36:37,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:37,554 INFO L93 Difference]: Finished difference Result 152 states and 188 transitions. [2019-11-15 22:36:37,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 22:36:37,565 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2019-11-15 22:36:37,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:37,566 INFO L225 Difference]: With dead ends: 152 [2019-11-15 22:36:37,566 INFO L226 Difference]: Without dead ends: 113 [2019-11-15 22:36:37,567 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 42.3s TimeCoverageRelationStatistics Valid=95, Invalid=320, Unknown=5, NotChecked=0, Total=420 [2019-11-15 22:36:37,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-11-15 22:36:37,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 95. [2019-11-15 22:36:37,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-11-15 22:36:37,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 119 transitions. [2019-11-15 22:36:37,576 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 119 transitions. Word has length 34 [2019-11-15 22:36:37,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:37,576 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 119 transitions. [2019-11-15 22:36:37,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-15 22:36:37,576 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 119 transitions. [2019-11-15 22:36:37,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-15 22:36:37,578 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:36:37,578 INFO L380 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-15 22:36:37,798 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-15 22:36:37,799 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:36:37,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:36:37,799 INFO L82 PathProgramCache]: Analyzing trace with hash 13172387, now seen corresponding path program 1 times [2019-11-15 22:36:37,800 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:36:37,800 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1189346896] [2019-11-15 22:36:37,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_114ab56f-92a5-4fd6-9a74-39d22853ae40/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-15 22:36:38,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:36:38,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-15 22:36:38,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:36:38,555 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-15 22:36:38,555 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:36:38,898 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-15 22:36:38,898 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1189346896] [2019-11-15 22:36:38,899 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:36:38,899 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2019-11-15 22:36:38,899 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347732965] [2019-11-15 22:36:38,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 22:36:38,900 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:36:38,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 22:36:38,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-11-15 22:36:38,900 INFO L87 Difference]: Start difference. First operand 95 states and 119 transitions. Second operand 12 states. [2019-11-15 22:36:39,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:36:39,082 INFO L93 Difference]: Finished difference Result 95 states and 119 transitions. [2019-11-15 22:36:39,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:36:39,083 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2019-11-15 22:36:39,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:36:39,083 INFO L225 Difference]: With dead ends: 95 [2019-11-15 22:36:39,083 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 22:36:39,084 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2019-11-15 22:36:39,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 22:36:39,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 22:36:39,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 22:36:39,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 22:36:39,085 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2019-11-15 22:36:39,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:36:39,085 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:36:39,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 22:36:39,085 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 22:36:39,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 22:36:39,286 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-15 22:36:39,289 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 22:36:39,432 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 178 [2019-11-15 22:37:09,202 WARN L191 SmtUtils]: Spent 29.64 s on a formula simplification. DAG size of input: 178 DAG size of output: 128 [2019-11-15 22:37:55,004 WARN L191 SmtUtils]: Spent 45.80 s on a formula simplification. DAG size of input: 210 DAG size of output: 181 [2019-11-15 22:38:27,510 WARN L191 SmtUtils]: Spent 32.47 s on a formula simplification. DAG size of input: 194 DAG size of output: 140 [2019-11-15 22:38:27,574 INFO L443 ceAbstractionStarter]: For program point L35-2(lines 35 39) no Hoare annotation was computed. [2019-11-15 22:38:27,575 INFO L443 ceAbstractionStarter]: For program point L35-3(lines 35 39) no Hoare annotation was computed. [2019-11-15 22:38:27,575 INFO L443 ceAbstractionStarter]: For program point L35-5(lines 35 39) no Hoare annotation was computed. [2019-11-15 22:38:27,575 INFO L443 ceAbstractionStarter]: For program point L234(lines 234 237) no Hoare annotation was computed. [2019-11-15 22:38:27,575 INFO L443 ceAbstractionStarter]: For program point L36-2(lines 36 37) no Hoare annotation was computed. [2019-11-15 22:38:27,575 INFO L439 ceAbstractionStarter]: At program point L36-3(lines 36 37) the Hoare annotation is: false [2019-11-15 22:38:27,575 INFO L443 ceAbstractionStarter]: For program point L36-4(lines 36 37) no Hoare annotation was computed. [2019-11-15 22:38:27,575 INFO L443 ceAbstractionStarter]: For program point L36-7(lines 36 37) no Hoare annotation was computed. [2019-11-15 22:38:27,575 INFO L439 ceAbstractionStarter]: At program point L36-8(lines 36 37) the Hoare annotation is: false [2019-11-15 22:38:27,576 INFO L443 ceAbstractionStarter]: For program point L36-9(lines 36 37) no Hoare annotation was computed. [2019-11-15 22:38:27,576 INFO L443 ceAbstractionStarter]: For program point L235(line 235) no Hoare annotation was computed. [2019-11-15 22:38:27,576 INFO L446 ceAbstractionStarter]: At program point L238(lines 222 239) the Hoare annotation is: true [2019-11-15 22:38:27,576 INFO L443 ceAbstractionStarter]: For program point L139(lines 139 143) no Hoare annotation was computed. [2019-11-15 22:38:27,576 INFO L443 ceAbstractionStarter]: For program point L139-1(lines 121 144) no Hoare annotation was computed. [2019-11-15 22:38:27,576 INFO L443 ceAbstractionStarter]: For program point L73-1(lines 73 77) no Hoare annotation was computed. [2019-11-15 22:38:27,576 INFO L439 ceAbstractionStarter]: At program point L73-2(lines 73 77) the Hoare annotation is: false [2019-11-15 22:38:27,576 INFO L443 ceAbstractionStarter]: For program point L73-3(lines 73 77) no Hoare annotation was computed. [2019-11-15 22:38:27,576 INFO L443 ceAbstractionStarter]: For program point L73-5(lines 73 77) no Hoare annotation was computed. [2019-11-15 22:38:27,576 INFO L439 ceAbstractionStarter]: At program point L73-6(lines 73 77) the Hoare annotation is: false [2019-11-15 22:38:27,576 INFO L443 ceAbstractionStarter]: For program point L73-7(lines 73 77) no Hoare annotation was computed. [2019-11-15 22:38:27,577 INFO L443 ceAbstractionStarter]: For program point L107(lines 107 111) no Hoare annotation was computed. [2019-11-15 22:38:27,577 INFO L443 ceAbstractionStarter]: For program point L107-1(lines 81 208) no Hoare annotation was computed. [2019-11-15 22:38:27,577 INFO L439 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-15 22:38:27,577 INFO L443 ceAbstractionStarter]: For program point L42(lines 42 43) no Hoare annotation was computed. [2019-11-15 22:38:27,577 INFO L443 ceAbstractionStarter]: For program point L42-2(lines 42 43) no Hoare annotation was computed. [2019-11-15 22:38:27,578 INFO L443 ceAbstractionStarter]: For program point L42-3(lines 42 43) no Hoare annotation was computed. [2019-11-15 22:38:27,578 INFO L443 ceAbstractionStarter]: For program point L42-5(lines 42 43) no Hoare annotation was computed. [2019-11-15 22:38:27,578 INFO L443 ceAbstractionStarter]: For program point L175(lines 175 198) no Hoare annotation was computed. [2019-11-15 22:38:27,578 INFO L443 ceAbstractionStarter]: For program point L175-2(lines 81 208) no Hoare annotation was computed. [2019-11-15 22:38:27,578 INFO L443 ceAbstractionStarter]: For program point L176-1(lines 176 180) no Hoare annotation was computed. [2019-11-15 22:38:27,578 INFO L439 ceAbstractionStarter]: At program point L176-2(lines 176 180) the Hoare annotation is: false [2019-11-15 22:38:27,578 INFO L443 ceAbstractionStarter]: For program point L176-3(lines 176 180) no Hoare annotation was computed. [2019-11-15 22:38:27,578 INFO L439 ceAbstractionStarter]: At program point L78(lines 14 79) the Hoare annotation is: false [2019-11-15 22:38:27,578 INFO L439 ceAbstractionStarter]: At program point L78-1(lines 14 79) the Hoare annotation is: false [2019-11-15 22:38:27,578 INFO L443 ceAbstractionStarter]: For program point L145(lines 145 172) no Hoare annotation was computed. [2019-11-15 22:38:27,579 INFO L443 ceAbstractionStarter]: For program point L112(lines 112 116) no Hoare annotation was computed. [2019-11-15 22:38:27,579 INFO L443 ceAbstractionStarter]: For program point L112-1(lines 81 208) no Hoare annotation was computed. [2019-11-15 22:38:27,579 INFO L443 ceAbstractionStarter]: For program point L112-2(lines 81 208) no Hoare annotation was computed. [2019-11-15 22:38:27,579 INFO L443 ceAbstractionStarter]: For program point L146(lines 146 171) no Hoare annotation was computed. [2019-11-15 22:38:27,579 INFO L443 ceAbstractionStarter]: For program point L213-1(lines 213 217) no Hoare annotation was computed. [2019-11-15 22:38:27,580 INFO L439 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-15 22:38:27,580 INFO L443 ceAbstractionStarter]: For program point L213-3(lines 213 217) no Hoare annotation was computed. [2019-11-15 22:38:27,580 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 171) no Hoare annotation was computed. [2019-11-15 22:38:27,580 INFO L443 ceAbstractionStarter]: For program point L149-1(lines 149 153) no Hoare annotation was computed. [2019-11-15 22:38:27,580 INFO L439 ceAbstractionStarter]: At program point L149-2(lines 149 153) the Hoare annotation is: false [2019-11-15 22:38:27,580 INFO L443 ceAbstractionStarter]: For program point L149-3(lines 149 153) no Hoare annotation was computed. [2019-11-15 22:38:27,580 INFO L439 ceAbstractionStarter]: At program point L50-2(lines 50 59) the Hoare annotation is: false [2019-11-15 22:38:27,580 INFO L443 ceAbstractionStarter]: For program point L50-3(lines 14 79) no Hoare annotation was computed. [2019-11-15 22:38:27,580 INFO L439 ceAbstractionStarter]: At program point L50-6(lines 50 59) the Hoare annotation is: false [2019-11-15 22:38:27,580 INFO L443 ceAbstractionStarter]: For program point L50-7(lines 14 79) no Hoare annotation was computed. [2019-11-15 22:38:27,581 INFO L443 ceAbstractionStarter]: For program point L85-1(lines 85 89) no Hoare annotation was computed. [2019-11-15 22:38:27,581 INFO L443 ceAbstractionStarter]: For program point L52(lines 52 56) no Hoare annotation was computed. [2019-11-15 22:38:27,581 INFO L439 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-15 22:38:27,581 INFO L443 ceAbstractionStarter]: For program point L85-3(lines 85 89) no Hoare annotation was computed. [2019-11-15 22:38:27,581 INFO L443 ceAbstractionStarter]: For program point L19-1(lines 19 23) no Hoare annotation was computed. [2019-11-15 22:38:27,581 INFO L443 ceAbstractionStarter]: For program point L52-2(lines 52 56) no Hoare annotation was computed. [2019-11-15 22:38:27,581 INFO L439 ceAbstractionStarter]: At program point L19-2(lines 19 23) the Hoare annotation is: false [2019-11-15 22:38:27,581 INFO L443 ceAbstractionStarter]: For program point L52-3(lines 52 56) no Hoare annotation was computed. [2019-11-15 22:38:27,581 INFO L443 ceAbstractionStarter]: For program point L19-3(lines 19 23) no Hoare annotation was computed. [2019-11-15 22:38:27,581 INFO L443 ceAbstractionStarter]: For program point L52-5(lines 52 56) no Hoare annotation was computed. [2019-11-15 22:38:27,582 INFO L443 ceAbstractionStarter]: For program point L19-5(lines 19 23) no Hoare annotation was computed. [2019-11-15 22:38:27,582 INFO L439 ceAbstractionStarter]: At program point L19-6(lines 19 23) the Hoare annotation is: false [2019-11-15 22:38:27,582 INFO L443 ceAbstractionStarter]: For program point L19-7(lines 19 23) no Hoare annotation was computed. [2019-11-15 22:38:27,582 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 22:38:27,582 INFO L443 ceAbstractionStarter]: For program point L185-1(lines 185 189) no Hoare annotation was computed. [2019-11-15 22:38:27,582 INFO L439 ceAbstractionStarter]: At program point L185-2(lines 185 189) the Hoare annotation is: false [2019-11-15 22:38:27,582 INFO L443 ceAbstractionStarter]: For program point L185-3(lines 185 189) no Hoare annotation was computed. [2019-11-15 22:38:27,583 INFO L439 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-15 22:38:27,583 INFO L443 ceAbstractionStarter]: For program point L121(lines 121 144) no Hoare annotation was computed. [2019-11-15 22:38:27,584 INFO L443 ceAbstractionStarter]: For program point L121-1(lines 81 208) no Hoare annotation was computed. [2019-11-15 22:38:27,584 INFO L443 ceAbstractionStarter]: For program point L122(lines 122 129) no Hoare annotation was computed. [2019-11-15 22:38:27,584 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 22:38:27,584 INFO L443 ceAbstractionStarter]: For program point L124(lines 124 125) no Hoare annotation was computed. [2019-11-15 22:38:27,584 INFO L443 ceAbstractionStarter]: For program point L91-1(lines 91 95) no Hoare annotation was computed. [2019-11-15 22:38:27,585 INFO L443 ceAbstractionStarter]: For program point L124-2(lines 122 129) no Hoare annotation was computed. [2019-11-15 22:38:27,585 INFO L439 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-15 22:38:27,585 INFO L443 ceAbstractionStarter]: For program point L91-3(lines 91 95) no Hoare annotation was computed. [2019-11-15 22:38:27,585 INFO L443 ceAbstractionStarter]: For program point L191-1(lines 191 195) no Hoare annotation was computed. [2019-11-15 22:38:27,585 INFO L439 ceAbstractionStarter]: At program point L191-2(lines 191 195) the Hoare annotation is: false [2019-11-15 22:38:27,586 INFO L443 ceAbstractionStarter]: For program point L191-3(lines 191 195) no Hoare annotation was computed. [2019-11-15 22:38:27,586 INFO L443 ceAbstractionStarter]: For program point L26(lines 26 27) no Hoare annotation was computed. [2019-11-15 22:38:27,586 INFO L443 ceAbstractionStarter]: For program point L26-1(lines 26 27) no Hoare annotation was computed. [2019-11-15 22:38:27,586 INFO L443 ceAbstractionStarter]: For program point L126-1(lines 126 127) no Hoare annotation was computed. [2019-11-15 22:38:27,587 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 235) no Hoare annotation was computed. [2019-11-15 22:38:27,587 INFO L443 ceAbstractionStarter]: For program point L61(lines 61 70) no Hoare annotation was computed. [2019-11-15 22:38:27,587 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 22:38:27,587 INFO L443 ceAbstractionStarter]: For program point L61-1(lines 61 70) no Hoare annotation was computed. [2019-11-15 22:38:27,587 INFO L443 ceAbstractionStarter]: For program point L161-1(lines 161 165) no Hoare annotation was computed. [2019-11-15 22:38:27,587 INFO L439 ceAbstractionStarter]: At program point L161-2(lines 161 165) the Hoare annotation is: false [2019-11-15 22:38:27,588 INFO L443 ceAbstractionStarter]: For program point L29(lines 29 30) no Hoare annotation was computed. [2019-11-15 22:38:27,588 INFO L443 ceAbstractionStarter]: For program point L29-1(lines 29 30) no Hoare annotation was computed. [2019-11-15 22:38:27,588 INFO L443 ceAbstractionStarter]: For program point L63(lines 63 69) no Hoare annotation was computed. [2019-11-15 22:38:27,588 INFO L443 ceAbstractionStarter]: For program point L63-2(lines 63 69) no Hoare annotation was computed. [2019-11-15 22:38:27,588 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 106) no Hoare annotation was computed. [2019-11-15 22:38:27,588 INFO L443 ceAbstractionStarter]: For program point L31(lines 31 32) no Hoare annotation was computed. [2019-11-15 22:38:27,588 INFO L443 ceAbstractionStarter]: For program point L31-1(lines 31 32) no Hoare annotation was computed. [2019-11-15 22:38:27,588 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 68) no Hoare annotation was computed. [2019-11-15 22:38:27,589 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 22:38:27,589 INFO L443 ceAbstractionStarter]: For program point L65-3(lines 65 68) no Hoare annotation was computed. [2019-11-15 22:38:27,589 INFO L443 ceAbstractionStarter]: For program point L166(lines 166 170) no Hoare annotation was computed. [2019-11-15 22:38:27,589 INFO L443 ceAbstractionStarter]: For program point L166-1(lines 157 171) no Hoare annotation was computed. [2019-11-15 22:38:27,589 INFO L443 ceAbstractionStarter]: For program point L200-1(lines 200 204) no Hoare annotation was computed. [2019-11-15 22:38:27,589 INFO L439 ceAbstractionStarter]: At program point L200-2(lines 200 204) the Hoare annotation is: false [2019-11-15 22:38:27,590 INFO L443 ceAbstractionStarter]: For program point L134-1(lines 134 138) no Hoare annotation was computed. [2019-11-15 22:38:27,590 INFO L443 ceAbstractionStarter]: For program point L200-3(lines 200 204) no Hoare annotation was computed. [2019-11-15 22:38:27,590 INFO L439 ceAbstractionStarter]: At program point L134-2(lines 134 138) the Hoare annotation is: false [2019-11-15 22:38:27,590 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 39) no Hoare annotation was computed. [2019-11-15 22:38:27,598 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:555) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:255) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:212) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) 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-15 22:38:27,616 INFO L168 Benchmark]: Toolchain (without parser) took 351000.57 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 285.7 MB). Free memory was 951.0 MB in the beginning and 883.3 MB in the end (delta: 67.7 MB). Peak memory consumption was 353.5 MB. Max. memory is 11.5 GB. [2019-11-15 22:38:27,616 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 977.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:38:27,617 INFO L168 Benchmark]: CACSL2BoogieTranslator took 494.03 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.9 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -141.9 MB). Peak memory consumption was 28.9 MB. Max. memory is 11.5 GB. [2019-11-15 22:38:27,618 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.71 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 11.5 GB. [2019-11-15 22:38:27,618 INFO L168 Benchmark]: Boogie Preprocessor took 68.25 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:38:27,619 INFO L168 Benchmark]: RCFGBuilder took 6740.77 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 53.8 MB). Peak memory consumption was 53.8 MB. Max. memory is 11.5 GB. [2019-11-15 22:38:27,619 INFO L168 Benchmark]: TraceAbstraction took 343612.27 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 180.9 MB). Free memory was 1.0 GB in the beginning and 883.3 MB in the end (delta: 147.2 MB). Peak memory consumption was 328.0 MB. Max. memory is 11.5 GB. [2019-11-15 22:38:27,623 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.29 ms. Allocated memory is still 1.0 GB. Free memory is still 977.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 494.03 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.9 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -141.9 MB). Peak memory consumption was 28.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 80.71 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 68.25 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 6740.77 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 53.8 MB). Peak memory consumption was 53.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 343612.27 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 180.9 MB). Free memory was 1.0 GB in the beginning and 883.3 MB in the end (delta: 147.2 MB). Peak memory consumption was 328.0 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. [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...