./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/float_req_bl_1270a.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_fd4cd6c2-f5af-4926-bada-43e0d4bb674d/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_fd4cd6c2-f5af-4926-bada-43e0d4bb674d/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_fd4cd6c2-f5af-4926-bada-43e0d4bb674d/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_fd4cd6c2-f5af-4926-bada-43e0d4bb674d/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1270a.c -s /tmp/vcloud-vcloud-master/worker/run_dir_fd4cd6c2-f5af-4926-bada-43e0d4bb674d/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_fd4cd6c2-f5af-4926-bada-43e0d4bb674d/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fa333650cb1e4cf3e280683e8b2ad72d19029b0d ..................................................................................................................................................................................................................................................................................................................... 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_fd4cd6c2-f5af-4926-bada-43e0d4bb674d/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_fd4cd6c2-f5af-4926-bada-43e0d4bb674d/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_fd4cd6c2-f5af-4926-bada-43e0d4bb674d/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_fd4cd6c2-f5af-4926-bada-43e0d4bb674d/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1270a.c -s /tmp/vcloud-vcloud-master/worker/run_dir_fd4cd6c2-f5af-4926-bada-43e0d4bb674d/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_fd4cd6c2-f5af-4926-bada-43e0d4bb674d/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fa333650cb1e4cf3e280683e8b2ad72d19029b0d ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.25-f470102 [2019-12-07 15:48:54,678 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 15:48:54,679 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 15:48:54,686 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 15:48:54,687 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 15:48:54,687 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 15:48:54,688 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 15:48:54,690 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 15:48:54,691 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 15:48:54,691 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 15:48:54,692 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 15:48:54,693 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 15:48:54,693 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 15:48:54,694 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 15:48:54,694 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 15:48:54,695 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 15:48:54,696 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 15:48:54,696 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 15:48:54,697 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 15:48:54,699 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 15:48:54,700 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 15:48:54,701 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 15:48:54,701 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 15:48:54,702 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 15:48:54,704 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 15:48:54,704 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 15:48:54,704 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 15:48:54,704 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 15:48:54,705 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 15:48:54,705 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 15:48:54,705 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 15:48:54,706 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 15:48:54,706 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 15:48:54,707 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 15:48:54,707 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 15:48:54,707 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 15:48:54,708 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 15:48:54,708 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 15:48:54,708 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 15:48:54,708 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 15:48:54,709 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 15:48:54,709 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_fd4cd6c2-f5af-4926-bada-43e0d4bb674d/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 15:48:54,719 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 15:48:54,719 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 15:48:54,719 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 15:48:54,719 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 15:48:54,720 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 15:48:54,720 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 15:48:54,720 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 15:48:54,720 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 15:48:54,720 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 15:48:54,720 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 15:48:54,720 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 15:48:54,720 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 15:48:54,720 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 15:48:54,721 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 15:48:54,721 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 15:48:54,721 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 15:48:54,721 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 15:48:54,721 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 15:48:54,721 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 15:48:54,721 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 15:48:54,721 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 15:48:54,722 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 15:48:54,722 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 15:48:54,722 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 15:48:54,722 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 15:48:54,722 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 15:48:54,722 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 15:48:54,722 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 15:48:54,723 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 15:48:54,723 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 15:48:54,723 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 15:48:54,723 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 15:48:54,723 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 15:48:54,723 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 15:48:54,723 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 15:48:54,724 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 15:48:54,724 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 15:48:54,724 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 15:48:54,724 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 15:48:54,724 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 15:48:54,724 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_fd4cd6c2-f5af-4926-bada-43e0d4bb674d/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fa333650cb1e4cf3e280683e8b2ad72d19029b0d [2019-12-07 15:48:54,826 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 15:48:54,835 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 15:48:54,837 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 15:48:54,838 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 15:48:54,839 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 15:48:54,839 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_fd4cd6c2-f5af-4926-bada-43e0d4bb674d/bin/utaipan/../../sv-benchmarks/c/float-newlib/float_req_bl_1270a.c [2019-12-07 15:48:54,877 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fd4cd6c2-f5af-4926-bada-43e0d4bb674d/bin/utaipan/data/6126b8507/9ef9c9b412be48b7975572671b9bf041/FLAG211d46d92 [2019-12-07 15:48:55,299 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 15:48:55,299 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_fd4cd6c2-f5af-4926-bada-43e0d4bb674d/sv-benchmarks/c/float-newlib/float_req_bl_1270a.c [2019-12-07 15:48:55,305 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fd4cd6c2-f5af-4926-bada-43e0d4bb674d/bin/utaipan/data/6126b8507/9ef9c9b412be48b7975572671b9bf041/FLAG211d46d92 [2019-12-07 15:48:55,313 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_fd4cd6c2-f5af-4926-bada-43e0d4bb674d/bin/utaipan/data/6126b8507/9ef9c9b412be48b7975572671b9bf041 [2019-12-07 15:48:55,315 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 15:48:55,316 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 15:48:55,317 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 15:48:55,317 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 15:48:55,319 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 15:48:55,320 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 03:48:55" (1/1) ... [2019-12-07 15:48:55,322 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44cb3cd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:48:55, skipping insertion in model container [2019-12-07 15:48:55,322 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 03:48:55" (1/1) ... [2019-12-07 15:48:55,329 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 15:48:55,349 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 15:48:55,529 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 15:48:55,532 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 15:48:55,565 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 15:48:55,580 INFO L208 MainTranslator]: Completed translation [2019-12-07 15:48:55,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:48:55 WrapperNode [2019-12-07 15:48:55,580 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 15:48:55,581 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 15:48:55,581 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 15:48:55,581 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 15:48:55,586 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:48:55" (1/1) ... [2019-12-07 15:48:55,595 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:48:55" (1/1) ... [2019-12-07 15:48:55,620 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 15:48:55,620 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 15:48:55,620 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 15:48:55,620 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 15:48:55,627 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:48:55" (1/1) ... [2019-12-07 15:48:55,627 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:48:55" (1/1) ... [2019-12-07 15:48:55,631 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:48:55" (1/1) ... [2019-12-07 15:48:55,631 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:48:55" (1/1) ... [2019-12-07 15:48:55,642 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:48:55" (1/1) ... [2019-12-07 15:48:55,649 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:48:55" (1/1) ... [2019-12-07 15:48:55,651 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:48:55" (1/1) ... [2019-12-07 15:48:55,654 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 15:48:55,655 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 15:48:55,655 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 15:48:55,655 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 15:48:55,655 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:48:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fd4cd6c2-f5af-4926-bada-43e0d4bb674d/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 15:48:55,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 15:48:55,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2019-12-07 15:48:55,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 15:48:55,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-12-07 15:48:55,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 15:48:55,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 15:48:55,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 15:48:55,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 15:48:56,234 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 15:48:56,234 INFO L287 CfgBuilder]: Removed 52 assume(true) statements. [2019-12-07 15:48:56,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:48:56 BoogieIcfgContainer [2019-12-07 15:48:56,235 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 15:48:56,236 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 15:48:56,236 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 15:48:56,239 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 15:48:56,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 03:48:55" (1/3) ... [2019-12-07 15:48:56,239 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@775a6ddf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 03:48:56, skipping insertion in model container [2019-12-07 15:48:56,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:48:55" (2/3) ... [2019-12-07 15:48:56,240 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@775a6ddf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 03:48:56, skipping insertion in model container [2019-12-07 15:48:56,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:48:56" (3/3) ... [2019-12-07 15:48:56,241 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1270a.c [2019-12-07 15:48:56,249 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 15:48:56,255 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 15:48:56,264 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 15:48:56,279 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 15:48:56,280 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 15:48:56,280 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 15:48:56,280 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 15:48:56,280 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 15:48:56,280 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 15:48:56,280 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 15:48:56,280 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 15:48:56,290 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states. [2019-12-07 15:48:56,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 15:48:56,294 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:48:56,295 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:48:56,295 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:48:56,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:48:56,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1344715026, now seen corresponding path program 1 times [2019-12-07 15:48:56,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:48:56,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378176640] [2019-12-07 15:48:56,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:48:56,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:48:56,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:48:56,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378176640] [2019-12-07 15:48:56,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:48:56,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:48:56,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750730944] [2019-12-07 15:48:56,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-07 15:48:56,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:48:56,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-07 15:48:56,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 15:48:56,395 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 2 states. [2019-12-07 15:48:56,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:48:56,412 INFO L93 Difference]: Finished difference Result 159 states and 271 transitions. [2019-12-07 15:48:56,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 15:48:56,413 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2019-12-07 15:48:56,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:48:56,421 INFO L225 Difference]: With dead ends: 159 [2019-12-07 15:48:56,421 INFO L226 Difference]: Without dead ends: 78 [2019-12-07 15:48:56,423 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 15:48:56,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-12-07 15:48:56,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-12-07 15:48:56,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-12-07 15:48:56,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 97 transitions. [2019-12-07 15:48:56,448 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 97 transitions. Word has length 13 [2019-12-07 15:48:56,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:48:56,449 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 97 transitions. [2019-12-07 15:48:56,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-07 15:48:56,449 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 97 transitions. [2019-12-07 15:48:56,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 15:48:56,449 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:48:56,449 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:48:56,450 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:48:56,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:48:56,450 INFO L82 PathProgramCache]: Analyzing trace with hash -879118579, now seen corresponding path program 1 times [2019-12-07 15:48:56,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:48:56,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187218438] [2019-12-07 15:48:56,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:48:56,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:48:56,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:48:56,557 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 15:48:56,557 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 15:48:56,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 03:48:56 BoogieIcfgContainer [2019-12-07 15:48:56,579 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 15:48:56,580 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 15:48:56,580 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 15:48:56,580 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 15:48:56,580 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:48:56" (3/4) ... [2019-12-07 15:48:56,582 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 15:48:56,582 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 15:48:56,584 INFO L168 Benchmark]: Toolchain (without parser) took 1267.41 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 77.6 MB). Free memory was 942.4 MB in the beginning and 946.3 MB in the end (delta: -3.9 MB). Peak memory consumption was 73.7 MB. Max. memory is 11.5 GB. [2019-12-07 15:48:56,584 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 15:48:56,585 INFO L168 Benchmark]: CACSL2BoogieTranslator took 263.73 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 77.6 MB). Free memory was 942.4 MB in the beginning and 1.1 GB in the end (delta: -124.6 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-12-07 15:48:56,585 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.38 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-12-07 15:48:56,586 INFO L168 Benchmark]: Boogie Preprocessor took 34.19 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 15:48:56,586 INFO L168 Benchmark]: RCFGBuilder took 580.83 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 978.6 MB in the end (delta: 83.1 MB). Peak memory consumption was 83.1 MB. Max. memory is 11.5 GB. [2019-12-07 15:48:56,586 INFO L168 Benchmark]: TraceAbstraction took 343.10 ms. Allocated memory is still 1.1 GB. Free memory was 978.6 MB in the beginning and 946.3 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. [2019-12-07 15:48:56,587 INFO L168 Benchmark]: Witness Printer took 3.03 ms. Allocated memory is still 1.1 GB. Free memory is still 946.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 15:48:56,589 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 263.73 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 77.6 MB). Free memory was 942.4 MB in the beginning and 1.1 GB in the end (delta: -124.6 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.38 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. * Boogie Preprocessor took 34.19 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 580.83 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 978.6 MB in the end (delta: 83.1 MB). Peak memory consumption was 83.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 343.10 ms. Allocated memory is still 1.1 GB. Free memory was 978.6 MB in the beginning and 946.3 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. * Witness Printer took 3.03 ms. Allocated memory is still 1.1 GB. Free memory is still 946.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 234]: 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; [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 [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] [L231] 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); [L233] COND TRUE !isinf_float(res) [L234] __VERIFIER_error() VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 80 locations, 1 error locations. Result: UNSAFE, OverallTime: 0.2s, OverallIterations: 2, TraceHistogramMax: 1, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 99 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=80occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 31 NumberOfCodeBlocks, 31 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 12 ConstructedInterpolants, 0 QuantifiedInterpolants, 144 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.25-f470102 [2019-12-07 15:48:58,046 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 15:48:58,047 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 15:48:58,055 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 15:48:58,055 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 15:48:58,056 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 15:48:58,057 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 15:48:58,058 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 15:48:58,059 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 15:48:58,060 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 15:48:58,061 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 15:48:58,061 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 15:48:58,062 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 15:48:58,062 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 15:48:58,063 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 15:48:58,064 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 15:48:58,064 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 15:48:58,065 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 15:48:58,066 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 15:48:58,068 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 15:48:58,069 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 15:48:58,070 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 15:48:58,071 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 15:48:58,071 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 15:48:58,073 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 15:48:58,074 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 15:48:58,074 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 15:48:58,074 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 15:48:58,075 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 15:48:58,075 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 15:48:58,076 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 15:48:58,076 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 15:48:58,077 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 15:48:58,077 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 15:48:58,078 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 15:48:58,078 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 15:48:58,078 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 15:48:58,079 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 15:48:58,079 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 15:48:58,079 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 15:48:58,080 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 15:48:58,080 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_fd4cd6c2-f5af-4926-bada-43e0d4bb674d/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2019-12-07 15:48:58,091 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 15:48:58,091 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 15:48:58,092 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 15:48:58,092 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 15:48:58,092 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 15:48:58,092 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 15:48:58,092 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 15:48:58,092 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 15:48:58,092 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 15:48:58,093 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 15:48:58,093 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 15:48:58,093 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 15:48:58,093 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 15:48:58,093 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 15:48:58,094 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 15:48:58,094 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 15:48:58,094 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 15:48:58,094 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 15:48:58,094 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 15:48:58,094 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 15:48:58,095 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 15:48:58,095 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 15:48:58,095 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 15:48:58,095 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 15:48:58,095 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 15:48:58,095 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 15:48:58,095 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 15:48:58,096 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 15:48:58,096 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 15:48:58,096 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 15:48:58,096 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 15:48:58,096 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-12-07 15:48:58,096 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 15:48:58,096 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 15:48:58,097 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 15:48:58,097 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 15:48:58,097 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_fd4cd6c2-f5af-4926-bada-43e0d4bb674d/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fa333650cb1e4cf3e280683e8b2ad72d19029b0d [2019-12-07 15:48:58,259 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 15:48:58,269 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 15:48:58,272 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 15:48:58,273 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 15:48:58,274 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 15:48:58,274 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_fd4cd6c2-f5af-4926-bada-43e0d4bb674d/bin/utaipan/../../sv-benchmarks/c/float-newlib/float_req_bl_1270a.c [2019-12-07 15:48:58,322 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fd4cd6c2-f5af-4926-bada-43e0d4bb674d/bin/utaipan/data/2e3ed7d3f/b5bccf1aab8f4b838df520056839e8cf/FLAG4fceff865 [2019-12-07 15:48:58,727 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 15:48:58,728 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_fd4cd6c2-f5af-4926-bada-43e0d4bb674d/sv-benchmarks/c/float-newlib/float_req_bl_1270a.c [2019-12-07 15:48:58,733 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fd4cd6c2-f5af-4926-bada-43e0d4bb674d/bin/utaipan/data/2e3ed7d3f/b5bccf1aab8f4b838df520056839e8cf/FLAG4fceff865 [2019-12-07 15:48:59,092 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_fd4cd6c2-f5af-4926-bada-43e0d4bb674d/bin/utaipan/data/2e3ed7d3f/b5bccf1aab8f4b838df520056839e8cf [2019-12-07 15:48:59,095 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 15:48:59,096 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 15:48:59,096 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 15:48:59,096 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 15:48:59,099 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 15:48:59,099 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 03:48:59" (1/1) ... [2019-12-07 15:48:59,102 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@357db60c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:48:59, skipping insertion in model container [2019-12-07 15:48:59,102 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 03:48:59" (1/1) ... [2019-12-07 15:48:59,107 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 15:48:59,127 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 15:48:59,258 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 15:48:59,262 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 15:48:59,296 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 15:48:59,344 INFO L208 MainTranslator]: Completed translation [2019-12-07 15:48:59,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:48:59 WrapperNode [2019-12-07 15:48:59,345 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 15:48:59,345 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 15:48:59,345 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 15:48:59,345 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 15:48:59,351 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:48:59" (1/1) ... [2019-12-07 15:48:59,361 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:48:59" (1/1) ... [2019-12-07 15:48:59,385 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 15:48:59,385 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 15:48:59,386 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 15:48:59,386 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 15:48:59,392 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:48:59" (1/1) ... [2019-12-07 15:48:59,393 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:48:59" (1/1) ... [2019-12-07 15:48:59,398 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:48:59" (1/1) ... [2019-12-07 15:48:59,398 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:48:59" (1/1) ... [2019-12-07 15:48:59,411 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:48:59" (1/1) ... [2019-12-07 15:48:59,418 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:48:59" (1/1) ... [2019-12-07 15:48:59,421 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:48:59" (1/1) ... [2019-12-07 15:48:59,424 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 15:48:59,424 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 15:48:59,424 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 15:48:59,424 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 15:48:59,425 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:48:59" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fd4cd6c2-f5af-4926-bada-43e0d4bb674d/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 15:48:59,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 15:48:59,463 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2019-12-07 15:48:59,463 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-07 15:48:59,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 15:48:59,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 15:48:59,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2019-12-07 15:48:59,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-12-07 15:48:59,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 15:49:04,400 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 15:49:04,400 INFO L287 CfgBuilder]: Removed 52 assume(true) statements. [2019-12-07 15:49:04,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:49:04 BoogieIcfgContainer [2019-12-07 15:49:04,401 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 15:49:04,402 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 15:49:04,402 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 15:49:04,404 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 15:49:04,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 03:48:59" (1/3) ... [2019-12-07 15:49:04,405 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38a8ce63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 03:49:04, skipping insertion in model container [2019-12-07 15:49:04,405 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:48:59" (2/3) ... [2019-12-07 15:49:04,405 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38a8ce63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 03:49:04, skipping insertion in model container [2019-12-07 15:49:04,405 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:49:04" (3/3) ... [2019-12-07 15:49:04,406 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1270a.c [2019-12-07 15:49:04,412 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 15:49:04,417 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 15:49:04,424 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 15:49:04,440 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 15:49:04,440 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 15:49:04,440 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 15:49:04,440 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 15:49:04,441 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 15:49:04,441 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 15:49:04,441 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 15:49:04,441 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 15:49:04,452 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states. [2019-12-07 15:49:04,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 15:49:04,456 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:49:04,457 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:49:04,457 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:49:04,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:49:04,461 INFO L82 PathProgramCache]: Analyzing trace with hash 311741284, now seen corresponding path program 1 times [2019-12-07 15:49:04,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 15:49:04,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1445443070] [2019-12-07 15:49:04,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fd4cd6c2-f5af-4926-bada-43e0d4bb674d/bin/utaipan/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-12-07 15:49:04,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:49:04,582 INFO L264 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 1 conjunts are in the unsatisfiable core [2019-12-07 15:49:04,586 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:49:04,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:49:04,596 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 15:49:04,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:49:04,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1445443070] [2019-12-07 15:49:04,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:49:04,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 15:49:04,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648362531] [2019-12-07 15:49:04,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-07 15:49:04,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 15:49:04,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-07 15:49:04,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 15:49:04,616 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 2 states. [2019-12-07 15:49:04,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:49:04,640 INFO L93 Difference]: Finished difference Result 212 states and 358 transitions. [2019-12-07 15:49:04,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 15:49:04,641 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-12-07 15:49:04,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:49:04,650 INFO L225 Difference]: With dead ends: 212 [2019-12-07 15:49:04,651 INFO L226 Difference]: Without dead ends: 104 [2019-12-07 15:49:04,654 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 15:49:04,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-12-07 15:49:04,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-12-07 15:49:04,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-12-07 15:49:04,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 136 transitions. [2019-12-07 15:49:04,686 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 136 transitions. Word has length 16 [2019-12-07 15:49:04,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:49:04,686 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 136 transitions. [2019-12-07 15:49:04,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-07 15:49:04,686 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 136 transitions. [2019-12-07 15:49:04,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 15:49:04,687 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:49:04,687 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:49:04,888 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 15:49:04,889 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:49:04,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:49:04,890 INFO L82 PathProgramCache]: Analyzing trace with hash 2055151297, now seen corresponding path program 1 times [2019-12-07 15:49:04,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 15:49:04,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1609246452] [2019-12-07 15:49:04,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fd4cd6c2-f5af-4926-bada-43e0d4bb674d/bin/utaipan/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-12-07 15:49:05,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:49:05,084 INFO L264 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 23 conjunts are in the unsatisfiable core [2019-12-07 15:49:05,087 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:49:05,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:49:05,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:49:05,971 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 15:49:06,983 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-12-07 15:49:08,153 WARN L192 SmtUtils]: Spent 301.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-12-07 15:49:09,950 WARN L192 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-12-07 15:49:25,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:49:25,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1609246452] [2019-12-07 15:49:25,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:49:25,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 13] imperfect sequences [] total 24 [2019-12-07 15:49:25,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481222675] [2019-12-07 15:49:25,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-07 15:49:25,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 15:49:25,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-07 15:49:25,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=472, Unknown=4, NotChecked=0, Total=552 [2019-12-07 15:49:25,141 INFO L87 Difference]: Start difference. First operand 104 states and 136 transitions. Second operand 24 states. [2019-12-07 15:49:31,790 WARN L192 SmtUtils]: Spent 4.89 s on a formula simplification that was a NOOP. DAG size: 54 [2019-12-07 15:49:35,560 WARN L192 SmtUtils]: Spent 2.28 s on a formula simplification that was a NOOP. DAG size: 47 [2019-12-07 15:49:36,426 WARN L192 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-12-07 15:49:45,514 WARN L192 SmtUtils]: Spent 6.27 s on a formula simplification that was a NOOP. DAG size: 59 [2019-12-07 15:49:46,859 WARN L192 SmtUtils]: Spent 485.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-12-07 15:49:52,846 WARN L192 SmtUtils]: Spent 5.32 s on a formula simplification that was a NOOP. DAG size: 64 [2019-12-07 15:49:55,010 WARN L192 SmtUtils]: Spent 1.06 s on a formula simplification that was a NOOP. DAG size: 58 [2019-12-07 15:50:01,403 WARN L192 SmtUtils]: Spent 4.82 s on a formula simplification that was a NOOP. DAG size: 70 [2019-12-07 15:50:06,788 WARN L192 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-12-07 15:50:12,596 WARN L192 SmtUtils]: Spent 4.37 s on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-12-07 15:50:15,252 WARN L192 SmtUtils]: Spent 1.17 s on a formula simplification that was a NOOP. DAG size: 63 [2019-12-07 15:50:25,561 WARN L192 SmtUtils]: Spent 9.17 s on a formula simplification that was a NOOP. DAG size: 90 [2019-12-07 15:50:28,763 WARN L192 SmtUtils]: Spent 2.73 s on a formula simplification that was a NOOP. DAG size: 53 [2019-12-07 15:50:38,107 WARN L192 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-12-07 15:50:39,935 WARN L192 SmtUtils]: Spent 1.25 s on a formula simplification that was a NOOP. DAG size: 66 [2019-12-07 15:50:48,704 WARN L192 SmtUtils]: Spent 7.78 s on a formula simplification that was a NOOP. DAG size: 93 [2019-12-07 15:51:34,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:51:34,493 INFO L93 Difference]: Finished difference Result 315 states and 391 transitions. [2019-12-07 15:51:34,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 15:51:34,502 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-07 15:51:34,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:51:34,504 INFO L225 Difference]: With dead ends: 315 [2019-12-07 15:51:34,504 INFO L226 Difference]: Without dead ends: 216 [2019-12-07 15:51:34,506 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 82.4s TimeCoverageRelationStatistics Valid=466, Invalid=1422, Unknown=4, NotChecked=0, Total=1892 [2019-12-07 15:51:34,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-12-07 15:51:34,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 112. [2019-12-07 15:51:34,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-12-07 15:51:34,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 143 transitions. [2019-12-07 15:51:34,520 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 143 transitions. Word has length 21 [2019-12-07 15:51:34,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:51:34,520 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 143 transitions. [2019-12-07 15:51:34,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-07 15:51:34,520 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 143 transitions. [2019-12-07 15:51:34,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 15:51:34,521 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:51:34,522 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:51:34,722 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 15:51:34,723 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:51:34,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:51:34,725 INFO L82 PathProgramCache]: Analyzing trace with hash -927908549, now seen corresponding path program 1 times [2019-12-07 15:51:34,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 15:51:34,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [562062424] [2019-12-07 15:51:34,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fd4cd6c2-f5af-4926-bada-43e0d4bb674d/bin/utaipan/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-12-07 15:51:34,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:51:34,889 INFO L264 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 15:51:34,891 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:51:34,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:51:34,961 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 15:51:35,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:51:35,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [562062424] [2019-12-07 15:51:35,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:51:35,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 6] imperfect sequences [] total 9 [2019-12-07 15:51:35,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877515786] [2019-12-07 15:51:35,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 15:51:35,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 15:51:35,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 15:51:35,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-07 15:51:35,042 INFO L87 Difference]: Start difference. First operand 112 states and 143 transitions. Second operand 9 states. [2019-12-07 15:51:35,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:51:35,596 INFO L93 Difference]: Finished difference Result 276 states and 354 transitions. [2019-12-07 15:51:35,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 15:51:35,597 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2019-12-07 15:51:35,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:51:35,598 INFO L225 Difference]: With dead ends: 276 [2019-12-07 15:51:35,598 INFO L226 Difference]: Without dead ends: 195 [2019-12-07 15:51:35,599 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-12-07 15:51:35,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-12-07 15:51:35,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 104. [2019-12-07 15:51:35,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-12-07 15:51:35,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 132 transitions. [2019-12-07 15:51:35,606 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 132 transitions. Word has length 24 [2019-12-07 15:51:35,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:51:35,607 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 132 transitions. [2019-12-07 15:51:35,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 15:51:35,607 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 132 transitions. [2019-12-07 15:51:35,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 15:51:35,608 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:51:35,608 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:51:35,808 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 15:51:35,809 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:51:35,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:51:35,809 INFO L82 PathProgramCache]: Analyzing trace with hash -558668800, now seen corresponding path program 1 times [2019-12-07 15:51:35,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 15:51:35,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1358581108] [2019-12-07 15:51:35,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fd4cd6c2-f5af-4926-bada-43e0d4bb674d/bin/utaipan/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-12-07 15:51:35,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:51:35,987 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-07 15:51:35,989 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:51:36,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:51:36,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:51:36,084 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 15:51:36,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:51:36,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1358581108] [2019-12-07 15:51:36,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:51:36,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 9] imperfect sequences [] total 17 [2019-12-07 15:51:36,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990658806] [2019-12-07 15:51:36,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 15:51:36,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 15:51:36,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 15:51:36,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-12-07 15:51:36,275 INFO L87 Difference]: Start difference. First operand 104 states and 132 transitions. Second operand 17 states. [2019-12-07 15:51:42,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:51:42,489 INFO L93 Difference]: Finished difference Result 128 states and 154 transitions. [2019-12-07 15:51:42,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 15:51:42,499 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 26 [2019-12-07 15:51:42,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:51:42,499 INFO L225 Difference]: With dead ends: 128 [2019-12-07 15:51:42,500 INFO L226 Difference]: Without dead ends: 110 [2019-12-07 15:51:42,500 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=229, Invalid=641, Unknown=0, NotChecked=0, Total=870 [2019-12-07 15:51:42,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-12-07 15:51:42,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 102. [2019-12-07 15:51:42,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-12-07 15:51:42,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 127 transitions. [2019-12-07 15:51:42,507 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 127 transitions. Word has length 26 [2019-12-07 15:51:42,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:51:42,507 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 127 transitions. [2019-12-07 15:51:42,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 15:51:42,507 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 127 transitions. [2019-12-07 15:51:42,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 15:51:42,508 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:51:42,508 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:51:42,708 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 15:51:42,709 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:51:42,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:51:42,710 INFO L82 PathProgramCache]: Analyzing trace with hash 121389570, now seen corresponding path program 1 times [2019-12-07 15:51:42,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 15:51:42,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1425674836] [2019-12-07 15:51:42,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fd4cd6c2-f5af-4926-bada-43e0d4bb674d/bin/utaipan/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-12-07 15:51:42,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:51:42,849 INFO L264 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-07 15:51:42,851 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:51:43,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:51:43,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:51:43,165 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 15:52:09,098 WARN L192 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 19 [2019-12-07 15:52:11,114 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-12-07 15:52:11,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:52:11,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1425674836] [2019-12-07 15:52:11,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:52:11,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 12] imperfect sequences [] total 21 [2019-12-07 15:52:11,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376870409] [2019-12-07 15:52:11,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-07 15:52:11,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 15:52:11,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-07 15:52:11,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=325, Unknown=10, NotChecked=36, Total=420 [2019-12-07 15:52:11,128 INFO L87 Difference]: Start difference. First operand 102 states and 127 transitions. Second operand 21 states. [2019-12-07 15:52:13,286 WARN L192 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 44 DAG size of output: 19 [2019-12-07 15:52:16,879 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-12-07 15:52:21,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:52:21,236 INFO L93 Difference]: Finished difference Result 110 states and 134 transitions. [2019-12-07 15:52:21,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 15:52:21,236 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 26 [2019-12-07 15:52:21,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:52:21,237 INFO L225 Difference]: With dead ends: 110 [2019-12-07 15:52:21,237 INFO L226 Difference]: Without dead ends: 92 [2019-12-07 15:52:21,238 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 31.2s TimeCoverageRelationStatistics Valid=180, Invalid=570, Unknown=10, NotChecked=52, Total=812 [2019-12-07 15:52:21,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-12-07 15:52:21,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-12-07 15:52:21,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-12-07 15:52:21,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 116 transitions. [2019-12-07 15:52:21,243 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 116 transitions. Word has length 26 [2019-12-07 15:52:21,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:52:21,243 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 116 transitions. [2019-12-07 15:52:21,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-07 15:52:21,244 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 116 transitions. [2019-12-07 15:52:21,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 15:52:21,244 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:52:21,245 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:52:21,445 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 15:52:21,446 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:52:21,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:52:21,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1951072080, now seen corresponding path program 1 times [2019-12-07 15:52:21,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 15:52:21,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [411545454] [2019-12-07 15:52:21,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fd4cd6c2-f5af-4926-bada-43e0d4bb674d/bin/utaipan/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-12-07 15:52:21,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:52:21,913 INFO L264 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 15:52:21,917 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:52:22,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:52:22,179 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 15:52:26,169 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2019-12-07 15:52:29,313 WARN L192 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-12-07 15:52:33,474 WARN L192 SmtUtils]: Spent 285.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-12-07 15:52:37,264 WARN L192 SmtUtils]: Spent 448.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-12-07 15:52:47,998 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-12-07 15:52:48,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:52:48,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [411545454] [2019-12-07 15:52:48,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:52:48,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 8] imperfect sequences [] total 13 [2019-12-07 15:52:48,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121166056] [2019-12-07 15:52:48,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 15:52:48,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 15:52:48,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 15:52:48,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=120, Unknown=3, NotChecked=0, Total=156 [2019-12-07 15:52:48,020 INFO L87 Difference]: Start difference. First operand 92 states and 116 transitions. Second operand 13 states. [2019-12-07 15:52:50,937 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) (_ +zero 8 24)))) (and (= .cse0 c_ULTIMATE.start___ieee754_hypotf_~x) (= .cse0 (fp ((_ extract 31 31) c_ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 30 23) c_ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 22 0) c_ULTIMATE.start___ieee754_hypotf_~hb~0))) (forall ((ULTIMATE.start___ieee754_hypotf_~a~0 (_ FloatingPoint 8 24))) (not (let ((.cse1 (fp ((_ extract 31 31) c_ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 30 23) c_ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 22 0) c_ULTIMATE.start___ieee754_hypotf_~ha~0)))) (fp.gt (fp.sub c_currentRoundingMode ULTIMATE.start___ieee754_hypotf_~a~0 .cse1) .cse1)))) (exists ((ULTIMATE.start___ieee754_hypotf_~hb~0 (_ BitVec 32))) (let ((.cse2 (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)))) (and (= (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) (_ +zero 8 24)) .cse2) (= c_ULTIMATE.start___ieee754_hypotf_~b~0 .cse2)))))) is different from false [2019-12-07 15:53:15,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:53:15,842 INFO L93 Difference]: Finished difference Result 140 states and 176 transitions. [2019-12-07 15:53:15,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 15:53:15,850 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2019-12-07 15:53:15,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:53:15,851 INFO L225 Difference]: With dead ends: 140 [2019-12-07 15:53:15,851 INFO L226 Difference]: Without dead ends: 101 [2019-12-07 15:53:15,851 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 28.6s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=4, NotChecked=28, Total=272 [2019-12-07 15:53:15,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-12-07 15:53:15,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 95. [2019-12-07 15:53:15,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-12-07 15:53:15,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 119 transitions. [2019-12-07 15:53:15,856 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 119 transitions. Word has length 34 [2019-12-07 15:53:15,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:53:15,857 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 119 transitions. [2019-12-07 15:53:15,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 15:53:15,857 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 119 transitions. [2019-12-07 15:53:15,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 15:53:15,858 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:53:15,858 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:53:16,058 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-07 15:53:16,059 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:53:16,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:53:16,059 INFO L82 PathProgramCache]: Analyzing trace with hash 13172387, now seen corresponding path program 1 times [2019-12-07 15:53:16,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 15:53:16,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [926077266] [2019-12-07 15:53:16,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fd4cd6c2-f5af-4926-bada-43e0d4bb674d/bin/utaipan/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-12-07 15:53:16,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:53:16,587 INFO L264 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 15:53:16,590 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:53:16,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:53:16,728 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 15:53:17,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:53:17,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [926077266] [2019-12-07 15:53:17,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:53:17,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 7] imperfect sequences [] total 11 [2019-12-07 15:53:17,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49350487] [2019-12-07 15:53:17,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 15:53:17,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 15:53:17,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 15:53:17,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-12-07 15:53:17,043 INFO L87 Difference]: Start difference. First operand 95 states and 119 transitions. Second operand 11 states. [2019-12-07 15:53:17,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:53:17,262 INFO L93 Difference]: Finished difference Result 95 states and 119 transitions. [2019-12-07 15:53:17,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 15:53:17,263 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2019-12-07 15:53:17,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:53:17,263 INFO L225 Difference]: With dead ends: 95 [2019-12-07 15:53:17,263 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 15:53:17,264 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-12-07 15:53:17,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 15:53:17,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 15:53:17,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 15:53:17,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 15:53:17,264 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2019-12-07 15:53:17,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:53:17,265 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 15:53:17,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 15:53:17,265 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 15:53:17,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 15:53:17,465 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-12-07 15:53:17,469 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 15:53:31,862 WARN L192 SmtUtils]: Spent 14.27 s on a formula simplification. DAG size of input: 143 DAG size of output: 111 [2019-12-07 15:53:50,675 WARN L192 SmtUtils]: Spent 18.81 s on a formula simplification. DAG size of input: 175 DAG size of output: 156 [2019-12-07 15:54:08,374 WARN L192 SmtUtils]: Spent 17.65 s on a formula simplification. DAG size of input: 159 DAG size of output: 123 [2019-12-07 15:54:08,461 INFO L246 CegarLoopResult]: For program point L35-2(lines 35 39) no Hoare annotation was computed. [2019-12-07 15:54:08,461 INFO L246 CegarLoopResult]: For program point L35-3(lines 35 39) no Hoare annotation was computed. [2019-12-07 15:54:08,461 INFO L246 CegarLoopResult]: For program point L35-5(lines 35 39) no Hoare annotation was computed. [2019-12-07 15:54:08,461 INFO L246 CegarLoopResult]: For program point L234(line 234) no Hoare annotation was computed. [2019-12-07 15:54:08,461 INFO L246 CegarLoopResult]: For program point L36-2(lines 36 37) no Hoare annotation was computed. [2019-12-07 15:54:08,461 INFO L242 CegarLoopResult]: At program point L36-3(lines 36 37) the Hoare annotation is: false [2019-12-07 15:54:08,461 INFO L246 CegarLoopResult]: For program point L36-4(lines 36 37) no Hoare annotation was computed. [2019-12-07 15:54:08,461 INFO L246 CegarLoopResult]: For program point L36-7(lines 36 37) no Hoare annotation was computed. [2019-12-07 15:54:08,461 INFO L242 CegarLoopResult]: At program point L36-8(lines 36 37) the Hoare annotation is: false [2019-12-07 15:54:08,462 INFO L246 CegarLoopResult]: For program point L36-9(lines 36 37) no Hoare annotation was computed. [2019-12-07 15:54:08,462 INFO L249 CegarLoopResult]: At program point L237(lines 222 238) the Hoare annotation is: true [2019-12-07 15:54:08,462 INFO L246 CegarLoopResult]: For program point L139(lines 139 143) no Hoare annotation was computed. [2019-12-07 15:54:08,462 INFO L246 CegarLoopResult]: For program point L139-1(lines 121 144) no Hoare annotation was computed. [2019-12-07 15:54:08,462 INFO L246 CegarLoopResult]: For program point L73-1(lines 73 77) no Hoare annotation was computed. [2019-12-07 15:54:08,462 INFO L242 CegarLoopResult]: At program point L73-2(lines 73 77) the Hoare annotation is: false [2019-12-07 15:54:08,462 INFO L246 CegarLoopResult]: For program point L73-3(lines 73 77) no Hoare annotation was computed. [2019-12-07 15:54:08,462 INFO L246 CegarLoopResult]: For program point L73-5(lines 73 77) no Hoare annotation was computed. [2019-12-07 15:54:08,462 INFO L242 CegarLoopResult]: At program point L73-6(lines 73 77) the Hoare annotation is: false [2019-12-07 15:54:08,462 INFO L246 CegarLoopResult]: For program point L73-7(lines 73 77) no Hoare annotation was computed. [2019-12-07 15:54:08,462 INFO L246 CegarLoopResult]: For program point L107(lines 107 111) no Hoare annotation was computed. [2019-12-07 15:54:08,462 INFO L246 CegarLoopResult]: For program point L107-1(lines 81 208) no Hoare annotation was computed. [2019-12-07 15:54:08,463 INFO L242 CegarLoopResult]: At program point L207(lines 81 208) the Hoare annotation is: (let ((.cse2 (exists ((currentRoundingMode RoundingMode)) (= (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.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))) (.cse0 (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) ULTIMATE.start___ieee754_hypotf_~x)))) (or (and .cse0 (exists ((ULTIMATE.start___ieee754_hypotf_~ha~0 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (let ((.cse1 (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)))) (and (= .cse1 (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))) (= .cse1 ULTIMATE.start___ieee754_hypotf_~a~0)))) .cse2 (exists ((ULTIMATE.start___ieee754_hypotf_~ha~0 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (let ((.cse3 (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)))) (and (= .cse3 ULTIMATE.start___ieee754_hypotf_~w~0) (= .cse3 (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)))))) (exists ((ULTIMATE.start___ieee754_hypotf_~ha~0 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (let ((.cse4 (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)))) (and (= .cse4 |ULTIMATE.start___ieee754_hypotf_#res|) (= .cse4 (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))))) (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)) (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)))) (or (and .cse0 .cse2) (and .cse0 (not (bvslt ULTIMATE.start___ieee754_hypotf_~hb~0 (_ bv645922816 32)))))) (let ((.cse5 (not (bvsgt (bvadd (bvneg ULTIMATE.start___ieee754_hypotf_~hb~0) ULTIMATE.start___ieee754_hypotf_~ha~0) (_ bv251658240 32))))) (and (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) ULTIMATE.start___ieee754_hypotf_~x) (or .cse5 (forall ((v_skolemized_v_prenex_5_3 (_ BitVec 32))) (or (not (= (fp.add currentRoundingMode (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))) (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)))) (= (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_3) (_ bv2139095040 32))))) (forall ((v_skolemized_v_prenex_5_3 (_ BitVec 32))) (or (= (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_3) (_ bv2139095040 32)) (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)))))) (or (forall ((v_skolemized_v_prenex_5_3 (_ BitVec 32))) (or (= (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_3) (_ bv2139095040 32)) (not (= (fp.add currentRoundingMode 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))) (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)))))) .cse5) (= currentRoundingMode roundNearestTiesToEven) (or (forall ((v_skolemized_v_prenex_5_3 (_ BitVec 32))) (or (= (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_3) (_ bv2139095040 32)) (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 currentRoundingMode ULTIMATE.start___ieee754_hypotf_~a~0 ULTIMATE.start___ieee754_hypotf_~b~0))))) .cse5))))) [2019-12-07 15:54:08,463 INFO L246 CegarLoopResult]: For program point L42(lines 42 43) no Hoare annotation was computed. [2019-12-07 15:54:08,463 INFO L246 CegarLoopResult]: For program point L42-2(lines 42 43) no Hoare annotation was computed. [2019-12-07 15:54:08,463 INFO L246 CegarLoopResult]: For program point L42-3(lines 42 43) no Hoare annotation was computed. [2019-12-07 15:54:08,463 INFO L246 CegarLoopResult]: For program point L42-5(lines 42 43) no Hoare annotation was computed. [2019-12-07 15:54:08,463 INFO L246 CegarLoopResult]: For program point L175(lines 175 198) no Hoare annotation was computed. [2019-12-07 15:54:08,463 INFO L246 CegarLoopResult]: For program point L175-2(lines 81 208) no Hoare annotation was computed. [2019-12-07 15:54:08,463 INFO L246 CegarLoopResult]: For program point L176-1(lines 176 180) no Hoare annotation was computed. [2019-12-07 15:54:08,463 INFO L242 CegarLoopResult]: At program point L176-2(lines 176 180) the Hoare annotation is: false [2019-12-07 15:54:08,463 INFO L246 CegarLoopResult]: For program point L176-3(lines 176 180) no Hoare annotation was computed. [2019-12-07 15:54:08,463 INFO L242 CegarLoopResult]: At program point L78(lines 14 79) the Hoare annotation is: false [2019-12-07 15:54:08,463 INFO L242 CegarLoopResult]: At program point L78-1(lines 14 79) the Hoare annotation is: false [2019-12-07 15:54:08,463 INFO L246 CegarLoopResult]: For program point L145(lines 145 172) no Hoare annotation was computed. [2019-12-07 15:54:08,464 INFO L246 CegarLoopResult]: For program point L112(lines 112 116) no Hoare annotation was computed. [2019-12-07 15:54:08,464 INFO L246 CegarLoopResult]: For program point L112-1(lines 81 208) no Hoare annotation was computed. [2019-12-07 15:54:08,464 INFO L246 CegarLoopResult]: For program point L112-2(lines 81 208) no Hoare annotation was computed. [2019-12-07 15:54:08,464 INFO L246 CegarLoopResult]: For program point L146(lines 146 171) no Hoare annotation was computed. [2019-12-07 15:54:08,464 INFO L246 CegarLoopResult]: For program point L213-1(lines 213 217) no Hoare annotation was computed. [2019-12-07 15:54:08,464 INFO L242 CegarLoopResult]: At program point L213-2(lines 213 217) the Hoare annotation is: (let ((.cse3 (exists ((currentRoundingMode RoundingMode)) (= (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.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))) (.cse1 (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) ULTIMATE.start___ieee754_hypotf_~x)))) (or (let ((.cse0 (not (bvsgt (bvadd (bvneg ULTIMATE.start___ieee754_hypotf_~hb~0) ULTIMATE.start___ieee754_hypotf_~ha~0) (_ bv251658240 32))))) (and (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) ULTIMATE.start___ieee754_hypotf_~x) (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)) (= (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_3) (_ bv2139095040 32)))) (or .cse0 (forall ((v_skolemized_v_prenex_5_3 (_ BitVec 32))) (or (not (= (fp.add currentRoundingMode (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))) (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)))) (= (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_3) (_ bv2139095040 32))))) (forall ((v_skolemized_v_prenex_5_3 (_ BitVec 32))) (or (= (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_3) (_ bv2139095040 32)) (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)))))) (or (forall ((v_skolemized_v_prenex_5_3 (_ BitVec 32))) (or (= (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_3) (_ bv2139095040 32)) (not (= (fp.add currentRoundingMode 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))) (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)))))) .cse0) (= currentRoundingMode roundNearestTiesToEven) (or (forall ((v_skolemized_v_prenex_5_3 (_ BitVec 32))) (or (= (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_3) (_ bv2139095040 32)) (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 currentRoundingMode ULTIMATE.start___ieee754_hypotf_~a~0 ULTIMATE.start___ieee754_hypotf_~b~0))))) .cse0))) (and .cse1 (exists ((ULTIMATE.start___ieee754_hypotf_~ha~0 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (let ((.cse2 (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)))) (and (= .cse2 (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))) (= .cse2 ULTIMATE.start___ieee754_hypotf_~a~0)))) .cse3 (exists ((ULTIMATE.start___ieee754_hypotf_~ha~0 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (let ((.cse4 (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)))) (and (= .cse4 ULTIMATE.start___ieee754_hypotf_~w~0) (= .cse4 (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)))))) (exists ((ULTIMATE.start___ieee754_hypotf_~ha~0 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (let ((.cse5 (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)))) (and (= .cse5 |ULTIMATE.start___ieee754_hypotf_#res|) (= .cse5 (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)))))) (exists ((ULTIMATE.start___ieee754_hypotf_~ha~0 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (let ((.cse6 (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)))) (and (= .cse6 (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))) (= .cse6 ULTIMATE.start_isinf_float_~x))))) (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)) (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)))) (or (and .cse1 .cse3) (and .cse1 (not (bvslt ULTIMATE.start___ieee754_hypotf_~hb~0 (_ bv645922816 32)))))))) [2019-12-07 15:54:08,464 INFO L246 CegarLoopResult]: For program point L213-3(lines 213 217) no Hoare annotation was computed. [2019-12-07 15:54:08,464 INFO L246 CegarLoopResult]: For program point L148(lines 148 171) no Hoare annotation was computed. [2019-12-07 15:54:08,465 INFO L246 CegarLoopResult]: For program point L149-1(lines 149 153) no Hoare annotation was computed. [2019-12-07 15:54:08,465 INFO L242 CegarLoopResult]: At program point L149-2(lines 149 153) the Hoare annotation is: false [2019-12-07 15:54:08,465 INFO L246 CegarLoopResult]: For program point L149-3(lines 149 153) no Hoare annotation was computed. [2019-12-07 15:54:08,465 INFO L242 CegarLoopResult]: At program point L50-2(lines 50 59) the Hoare annotation is: false [2019-12-07 15:54:08,465 INFO L246 CegarLoopResult]: For program point L50-3(lines 14 79) no Hoare annotation was computed. [2019-12-07 15:54:08,465 INFO L242 CegarLoopResult]: At program point L50-6(lines 50 59) the Hoare annotation is: false [2019-12-07 15:54:08,465 INFO L246 CegarLoopResult]: For program point L50-7(lines 14 79) no Hoare annotation was computed. [2019-12-07 15:54:08,465 INFO L246 CegarLoopResult]: For program point L85-1(lines 85 89) no Hoare annotation was computed. [2019-12-07 15:54:08,465 INFO L246 CegarLoopResult]: For program point L52(lines 52 56) no Hoare annotation was computed. [2019-12-07 15:54:08,465 INFO L242 CegarLoopResult]: At program point L85-2(lines 85 89) the Hoare annotation is: (and (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) ULTIMATE.start___ieee754_hypotf_~x)) (exists ((ULTIMATE.start___ieee754_hypotf_~ha~0 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (let ((.cse0 (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)))) (and (= .cse0 (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))) (= .cse0 ULTIMATE.start___ieee754_hypotf_~a~0)))) (= currentRoundingMode roundNearestTiesToEven)) [2019-12-07 15:54:08,465 INFO L246 CegarLoopResult]: For program point L85-3(lines 85 89) no Hoare annotation was computed. [2019-12-07 15:54:08,465 INFO L246 CegarLoopResult]: For program point L19-1(lines 19 23) no Hoare annotation was computed. [2019-12-07 15:54:08,465 INFO L246 CegarLoopResult]: For program point L52-2(lines 52 56) no Hoare annotation was computed. [2019-12-07 15:54:08,465 INFO L242 CegarLoopResult]: At program point L19-2(lines 19 23) the Hoare annotation is: false [2019-12-07 15:54:08,465 INFO L246 CegarLoopResult]: For program point L52-3(lines 52 56) no Hoare annotation was computed. [2019-12-07 15:54:08,465 INFO L246 CegarLoopResult]: For program point L19-3(lines 19 23) no Hoare annotation was computed. [2019-12-07 15:54:08,465 INFO L246 CegarLoopResult]: For program point L52-5(lines 52 56) no Hoare annotation was computed. [2019-12-07 15:54:08,466 INFO L246 CegarLoopResult]: For program point L19-5(lines 19 23) no Hoare annotation was computed. [2019-12-07 15:54:08,466 INFO L242 CegarLoopResult]: At program point L19-6(lines 19 23) the Hoare annotation is: false [2019-12-07 15:54:08,466 INFO L246 CegarLoopResult]: For program point L19-7(lines 19 23) no Hoare annotation was computed. [2019-12-07 15:54:08,466 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 15:54:08,466 INFO L246 CegarLoopResult]: For program point L185-1(lines 185 189) no Hoare annotation was computed. [2019-12-07 15:54:08,466 INFO L242 CegarLoopResult]: At program point L185-2(lines 185 189) the Hoare annotation is: false [2019-12-07 15:54:08,466 INFO L246 CegarLoopResult]: For program point L185-3(lines 185 189) no Hoare annotation was computed. [2019-12-07 15:54:08,466 INFO L242 CegarLoopResult]: At program point L219(lines 211 220) the Hoare annotation is: (let ((.cse0 (= (_ bv0 32) (bvadd |ULTIMATE.start_isinf_float_#res| (_ bv4294967295 32)))) (.cse4 (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) ULTIMATE.start___ieee754_hypotf_~x))) (.cse5 (exists ((currentRoundingMode RoundingMode)) (= (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.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)))))) (or (let ((.cse1 (not (bvsgt (bvadd (bvneg ULTIMATE.start___ieee754_hypotf_~hb~0) ULTIMATE.start___ieee754_hypotf_~ha~0) (_ bv251658240 32))))) (and (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) ULTIMATE.start___ieee754_hypotf_~x) .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)) (= (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_3) (_ bv2139095040 32)))) (or .cse1 (forall ((v_skolemized_v_prenex_5_3 (_ BitVec 32))) (or (not (= (fp.add currentRoundingMode (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))) (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)))) (= (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_3) (_ bv2139095040 32))))) (forall ((v_skolemized_v_prenex_5_3 (_ BitVec 32))) (or (= (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_3) (_ bv2139095040 32)) (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)))))) (or (forall ((v_skolemized_v_prenex_5_3 (_ BitVec 32))) (or (= (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_3) (_ bv2139095040 32)) (not (= (fp.add currentRoundingMode 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))) (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)))))) .cse1) (exists ((ULTIMATE.start___ieee754_hypotf_~ha~0 (_ BitVec 32)) (v_ULTIMATE.start___ieee754_hypotf_~hb~0_27 (_ BitVec 32))) (let ((.cse3 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_27)) (.cse2 (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)))) (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 .cse2 (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3)))) (bvsgt (bvadd ULTIMATE.start___ieee754_hypotf_~ha~0 (bvneg .cse3)) (_ bv251658240 32)) (= .cse2 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)))))) (= currentRoundingMode roundNearestTiesToEven) (or (forall ((v_skolemized_v_prenex_5_3 (_ BitVec 32))) (or (= (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_3) (_ bv2139095040 32)) (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 currentRoundingMode ULTIMATE.start___ieee754_hypotf_~a~0 ULTIMATE.start___ieee754_hypotf_~b~0))))) .cse1))) (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)) .cse0 (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)))) (or (and .cse4 .cse5) (and .cse4 (not (bvslt ULTIMATE.start___ieee754_hypotf_~hb~0 (_ bv645922816 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)))) (and .cse0 .cse4 (exists ((ULTIMATE.start___ieee754_hypotf_~ha~0 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (let ((.cse6 (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)))) (and (= .cse6 (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))) (= .cse6 (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)))))) (exists ((ULTIMATE.start___ieee754_hypotf_~ha~0 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (let ((.cse7 (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)))) (and (= .cse7 (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))) (= .cse7 ULTIMATE.start___ieee754_hypotf_~a~0)))) .cse5 (exists ((ULTIMATE.start___ieee754_hypotf_~ha~0 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (let ((.cse8 (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)))) (and (= .cse8 ULTIMATE.start___ieee754_hypotf_~w~0) (= .cse8 (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)))))) (exists ((ULTIMATE.start___ieee754_hypotf_~ha~0 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (let ((.cse9 (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)))) (and (= .cse9 |ULTIMATE.start___ieee754_hypotf_#res|) (= .cse9 (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)))))) (exists ((ULTIMATE.start___ieee754_hypotf_~ha~0 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (let ((.cse10 (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)))) (and (= .cse10 (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))) (= .cse10 ULTIMATE.start_isinf_float_~x))))))) [2019-12-07 15:54:08,467 INFO L246 CegarLoopResult]: For program point L121(lines 121 144) no Hoare annotation was computed. [2019-12-07 15:54:08,467 INFO L246 CegarLoopResult]: For program point L121-1(lines 81 208) no Hoare annotation was computed. [2019-12-07 15:54:08,467 INFO L246 CegarLoopResult]: For program point L122(lines 122 129) no Hoare annotation was computed. [2019-12-07 15:54:08,467 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 15:54:08,467 INFO L246 CegarLoopResult]: For program point L124(lines 124 125) no Hoare annotation was computed. [2019-12-07 15:54:08,467 INFO L246 CegarLoopResult]: For program point L91-1(lines 91 95) no Hoare annotation was computed. [2019-12-07 15:54:08,467 INFO L246 CegarLoopResult]: For program point L124-2(lines 122 129) no Hoare annotation was computed. [2019-12-07 15:54:08,467 INFO L242 CegarLoopResult]: At program point L91-2(lines 91 95) the Hoare annotation is: (and (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) ULTIMATE.start___ieee754_hypotf_~x)) (exists ((ULTIMATE.start___ieee754_hypotf_~ha~0 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (let ((.cse0 (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)))) (and (= .cse0 (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))) (= .cse0 ULTIMATE.start___ieee754_hypotf_~a~0)))) (exists ((currentRoundingMode RoundingMode)) (= (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.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)))) (= currentRoundingMode roundNearestTiesToEven)) [2019-12-07 15:54:08,467 INFO L246 CegarLoopResult]: For program point L91-3(lines 91 95) no Hoare annotation was computed. [2019-12-07 15:54:08,467 INFO L246 CegarLoopResult]: For program point L191-1(lines 191 195) no Hoare annotation was computed. [2019-12-07 15:54:08,467 INFO L242 CegarLoopResult]: At program point L191-2(lines 191 195) the Hoare annotation is: false [2019-12-07 15:54:08,467 INFO L246 CegarLoopResult]: For program point L191-3(lines 191 195) no Hoare annotation was computed. [2019-12-07 15:54:08,467 INFO L246 CegarLoopResult]: For program point L26(lines 26 27) no Hoare annotation was computed. [2019-12-07 15:54:08,467 INFO L246 CegarLoopResult]: For program point L26-1(lines 26 27) no Hoare annotation was computed. [2019-12-07 15:54:08,467 INFO L246 CegarLoopResult]: For program point L126-1(lines 126 127) no Hoare annotation was computed. [2019-12-07 15:54:08,467 INFO L246 CegarLoopResult]: For program point L61(lines 61 70) no Hoare annotation was computed. [2019-12-07 15:54:08,467 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 15:54:08,468 INFO L246 CegarLoopResult]: For program point L61-1(lines 61 70) no Hoare annotation was computed. [2019-12-07 15:54:08,468 INFO L246 CegarLoopResult]: For program point L161-1(lines 161 165) no Hoare annotation was computed. [2019-12-07 15:54:08,468 INFO L242 CegarLoopResult]: At program point L161-2(lines 161 165) the Hoare annotation is: false [2019-12-07 15:54:08,468 INFO L246 CegarLoopResult]: For program point L29(lines 29 30) no Hoare annotation was computed. [2019-12-07 15:54:08,468 INFO L246 CegarLoopResult]: For program point L29-1(lines 29 30) no Hoare annotation was computed. [2019-12-07 15:54:08,468 INFO L246 CegarLoopResult]: For program point L63(lines 63 69) no Hoare annotation was computed. [2019-12-07 15:54:08,468 INFO L246 CegarLoopResult]: For program point L63-2(lines 63 69) no Hoare annotation was computed. [2019-12-07 15:54:08,468 INFO L246 CegarLoopResult]: For program point L97(lines 97 106) no Hoare annotation was computed. [2019-12-07 15:54:08,468 INFO L246 CegarLoopResult]: For program point L31(lines 31 32) no Hoare annotation was computed. [2019-12-07 15:54:08,468 INFO L246 CegarLoopResult]: For program point L31-1(lines 31 32) no Hoare annotation was computed. [2019-12-07 15:54:08,468 INFO L246 CegarLoopResult]: For program point L65(lines 65 68) no Hoare annotation was computed. [2019-12-07 15:54:08,468 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-12-07 15:54:08,468 INFO L246 CegarLoopResult]: For program point L65-3(lines 65 68) no Hoare annotation was computed. [2019-12-07 15:54:08,468 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 234) no Hoare annotation was computed. [2019-12-07 15:54:08,468 INFO L246 CegarLoopResult]: For program point L166(lines 166 170) no Hoare annotation was computed. [2019-12-07 15:54:08,468 INFO L246 CegarLoopResult]: For program point L166-1(lines 157 171) no Hoare annotation was computed. [2019-12-07 15:54:08,468 INFO L246 CegarLoopResult]: For program point L233(lines 233 236) no Hoare annotation was computed. [2019-12-07 15:54:08,469 INFO L246 CegarLoopResult]: For program point L200-1(lines 200 204) no Hoare annotation was computed. [2019-12-07 15:54:08,469 INFO L242 CegarLoopResult]: At program point L200-2(lines 200 204) the Hoare annotation is: false [2019-12-07 15:54:08,469 INFO L246 CegarLoopResult]: For program point L134-1(lines 134 138) no Hoare annotation was computed. [2019-12-07 15:54:08,469 INFO L246 CegarLoopResult]: For program point L200-3(lines 200 204) no Hoare annotation was computed. [2019-12-07 15:54:08,469 INFO L242 CegarLoopResult]: At program point L134-2(lines 134 138) the Hoare annotation is: false [2019-12-07 15:54:08,469 INFO L246 CegarLoopResult]: For program point L35(lines 35 39) no Hoare annotation was computed. [2019-12-07 15:54:08,475 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:693) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:258) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:215) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) 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-12-07 15:54:08,477 INFO L168 Benchmark]: Toolchain (without parser) took 309381.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -130.9 MB). Peak memory consumption was 285.2 MB. Max. memory is 11.5 GB. [2019-12-07 15:54:08,477 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 15:54:08,477 INFO L168 Benchmark]: CACSL2BoogieTranslator took 248.71 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.4 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -157.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2019-12-07 15:54:08,478 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.13 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-12-07 15:54:08,478 INFO L168 Benchmark]: Boogie Preprocessor took 38.63 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-12-07 15:54:08,479 INFO L168 Benchmark]: RCFGBuilder took 4976.90 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: 58.3 MB). Peak memory consumption was 58.3 MB. Max. memory is 11.5 GB. [2019-12-07 15:54:08,479 INFO L168 Benchmark]: TraceAbstraction took 304073.97 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 28.8 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -44.9 MB). Peak memory consumption was 254.8 MB. Max. memory is 11.5 GB. [2019-12-07 15:54:08,481 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 248.71 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.4 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -157.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.13 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.63 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 4976.90 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: 58.3 MB). Peak memory consumption was 58.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 304073.97 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 28.8 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -44.9 MB). Peak memory consumption was 254.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 234]: 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...