./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_1210.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/float_req_bl_1210.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 36fce2ac9d239f0bf9286aa317af7b50704c65b6 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/float_req_bl_1210.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 36fce2ac9d239f0bf9286aa317af7b50704c65b6 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 17:54:07,654 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 17:54:07,656 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 17:54:07,669 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 17:54:07,670 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 17:54:07,671 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 17:54:07,672 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 17:54:07,674 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 17:54:07,676 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 17:54:07,677 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 17:54:07,678 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 17:54:07,679 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 17:54:07,680 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 17:54:07,681 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 17:54:07,682 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 17:54:07,683 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 17:54:07,684 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 17:54:07,685 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 17:54:07,687 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 17:54:07,689 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 17:54:07,691 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 17:54:07,692 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 17:54:07,693 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 17:54:07,694 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 17:54:07,697 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 17:54:07,698 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 17:54:07,698 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 17:54:07,699 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 17:54:07,700 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 17:54:07,701 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 17:54:07,701 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 17:54:07,702 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 17:54:07,703 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 17:54:07,704 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 17:54:07,705 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 17:54:07,705 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 17:54:07,706 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 17:54:07,706 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 17:54:07,706 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 17:54:07,707 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 17:54:07,708 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 17:54:07,709 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-28 17:54:07,729 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 17:54:07,729 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 17:54:07,730 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 17:54:07,731 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 17:54:07,731 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 17:54:07,731 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 17:54:07,732 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 17:54:07,732 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 17:54:07,732 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 17:54:07,733 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 17:54:07,733 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 17:54:07,733 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 17:54:07,734 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 17:54:07,734 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 17:54:07,734 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 17:54:07,734 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 17:54:07,735 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 17:54:07,735 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 17:54:07,735 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 17:54:07,736 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 17:54:07,736 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 17:54:07,736 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 17:54:07,737 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 17:54:07,737 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 17:54:07,737 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 17:54:07,737 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 17:54:07,738 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 17:54:07,738 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 17:54:07,738 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 17:54:07,738 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 36fce2ac9d239f0bf9286aa317af7b50704c65b6 [2020-07-28 17:54:08,059 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 17:54:08,073 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 17:54:08,076 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 17:54:08,078 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 17:54:08,078 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 17:54:08,079 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1210.c [2020-07-28 17:54:08,151 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9301e96f/2ac674ff4a534165add3655b48c2c30a/FLAG4d9bd7a91 [2020-07-28 17:54:08,585 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 17:54:08,586 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1210.c [2020-07-28 17:54:08,593 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9301e96f/2ac674ff4a534165add3655b48c2c30a/FLAG4d9bd7a91 [2020-07-28 17:54:08,995 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9301e96f/2ac674ff4a534165add3655b48c2c30a [2020-07-28 17:54:08,998 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 17:54:09,001 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 17:54:09,002 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 17:54:09,002 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 17:54:09,006 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 17:54:09,007 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:54:08" (1/1) ... [2020-07-28 17:54:09,010 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a5575ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:54:09, skipping insertion in model container [2020-07-28 17:54:09,010 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:54:08" (1/1) ... [2020-07-28 17:54:09,018 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 17:54:09,041 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 17:54:09,275 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:54:09,286 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 17:54:09,320 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:54:09,338 INFO L208 MainTranslator]: Completed translation [2020-07-28 17:54:09,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:54:09 WrapperNode [2020-07-28 17:54:09,339 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 17:54:09,340 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 17:54:09,340 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 17:54:09,340 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 17:54:09,409 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:54:09" (1/1) ... [2020-07-28 17:54:09,434 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:54:09" (1/1) ... [2020-07-28 17:54:09,472 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 17:54:09,473 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 17:54:09,473 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 17:54:09,473 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 17:54:09,483 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:54:09" (1/1) ... [2020-07-28 17:54:09,483 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:54:09" (1/1) ... [2020-07-28 17:54:09,487 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:54:09" (1/1) ... [2020-07-28 17:54:09,487 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:54:09" (1/1) ... [2020-07-28 17:54:09,501 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:54:09" (1/1) ... [2020-07-28 17:54:09,507 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:54:09" (1/1) ... [2020-07-28 17:54:09,510 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:54:09" (1/1) ... [2020-07-28 17:54:09,513 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 17:54:09,514 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 17:54:09,514 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 17:54:09,514 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 17:54:09,515 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:54:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-07-28 17:54:09,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2020-07-28 17:54:09,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-28 17:54:09,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-07-28 17:54:09,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 17:54:09,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 17:54:09,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-28 17:54:09,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-28 17:54:09,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-28 17:54:10,114 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 17:54:10,115 INFO L295 CfgBuilder]: Removed 24 assume(true) statements. [2020-07-28 17:54:10,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:54:10 BoogieIcfgContainer [2020-07-28 17:54:10,119 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 17:54:10,120 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 17:54:10,120 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 17:54:10,123 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 17:54:10,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 05:54:08" (1/3) ... [2020-07-28 17:54:10,125 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@697fc93c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:54:10, skipping insertion in model container [2020-07-28 17:54:10,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:54:09" (2/3) ... [2020-07-28 17:54:10,126 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@697fc93c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:54:10, skipping insertion in model container [2020-07-28 17:54:10,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:54:10" (3/3) ... [2020-07-28 17:54:10,128 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1210.c [2020-07-28 17:54:10,138 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 17:54:10,146 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 17:54:10,158 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 17:54:10,176 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 17:54:10,176 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 17:54:10,177 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 17:54:10,177 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 17:54:10,178 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 17:54:10,178 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 17:54:10,178 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 17:54:10,179 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 17:54:10,193 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2020-07-28 17:54:10,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-28 17:54:10,200 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:54:10,201 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:54:10,202 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:54:10,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:54:10,208 INFO L82 PathProgramCache]: Analyzing trace with hash -556426464, now seen corresponding path program 1 times [2020-07-28 17:54:10,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:54:10,219 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341552294] [2020-07-28 17:54:10,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:54:10,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:54:10,366 INFO L280 TraceCheckUtils]: 0: Hoare triple {37#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~one_modf~0 := 1.0; {37#true} is VALID [2020-07-28 17:54:10,367 INFO L280 TraceCheckUtils]: 1: Hoare triple {37#true} havoc main_#res;havoc main_#t~ret13, main_#t~mem14, main_#t~ret15, main_#t~ret16, main_#t~short17, main_~x~0, main_~#iptr~0.base, main_~#iptr~0.offset, main_~res~0;main_~x~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0);call main_~#iptr~0.base, main_~#iptr~0.offset := #Ultimate.allocOnStack(4);modf_float_#in~x, modf_float_#in~iptr.base, modf_float_#in~iptr.offset := main_~x~0, main_~#iptr~0.base, main_~#iptr~0.offset;havoc modf_float_#res;havoc modf_float_#t~mem0, modf_float_#t~union1, modf_float_~#gf_u~0.base, modf_float_~#gf_u~0.offset, modf_float_#t~mem2, modf_float_~#sf_u~0.base, modf_float_~#sf_u~0.offset, modf_float_#t~mem3, modf_float_#t~union4, modf_float_~#gf_u~1.base, modf_float_~#gf_u~1.offset, modf_float_#t~mem5, modf_float_#t~union6, modf_float_~#sf_u~1.base, modf_float_~#sf_u~1.offset, modf_float_~ix~0, modf_float_#t~mem7, modf_float_~#sf_u~2.base, modf_float_~#sf_u~2.offset, modf_float_#t~mem8, modf_float_#t~mem9, modf_float_#t~union10, modf_float_~#gf_u~2.base, modf_float_~#gf_u~2.offset, modf_float_#t~mem11, modf_float_#t~union12, modf_float_~#sf_u~3.base, modf_float_~#sf_u~3.offset, modf_float_~ix~1, modf_float_~x, modf_float_~iptr.base, modf_float_~iptr.offset, modf_float_~i0~0, modf_float_~j0~0, modf_float_~i~0;modf_float_~x := modf_float_#in~x;modf_float_~iptr.base, modf_float_~iptr.offset := modf_float_#in~iptr.base, modf_float_#in~iptr.offset;havoc modf_float_~i0~0;havoc modf_float_~j0~0;havoc modf_float_~i~0; {37#true} is VALID [2020-07-28 17:54:10,368 INFO L280 TraceCheckUtils]: 2: Hoare triple {37#true} assume !true; {38#false} is VALID [2020-07-28 17:54:10,369 INFO L280 TraceCheckUtils]: 3: Hoare triple {38#false} modf_float_~j0~0 := ~bitwiseAnd(modf_float_~i0~0 / 8388608, 255) - 127; {38#false} is VALID [2020-07-28 17:54:10,369 INFO L280 TraceCheckUtils]: 4: Hoare triple {38#false} assume !(modf_float_~j0~0 < 23);havoc modf_float_~ix~1;call write~real(~someBinaryArithmeticFLOAToperation(modf_float_~x, ~one_modf~0), modf_float_~iptr.base, modf_float_~iptr.offset, 4); {38#false} is VALID [2020-07-28 17:54:10,370 INFO L280 TraceCheckUtils]: 5: Hoare triple {38#false} assume !true; {38#false} is VALID [2020-07-28 17:54:10,370 INFO L280 TraceCheckUtils]: 6: Hoare triple {38#false} assume !true; {38#false} is VALID [2020-07-28 17:54:10,371 INFO L280 TraceCheckUtils]: 7: Hoare triple {38#false} modf_float_#res := modf_float_~x; {38#false} is VALID [2020-07-28 17:54:10,371 INFO L280 TraceCheckUtils]: 8: Hoare triple {38#false} main_#t~ret13 := modf_float_#res;main_~res~0 := main_#t~ret13;havoc main_#t~ret13;call main_#t~mem14 := read~real(main_~#iptr~0.base, main_~#iptr~0.offset, 4);isnan_float_#in~x := main_#t~mem14;havoc isnan_float_#res;havoc isnan_float_~x;isnan_float_~x := isnan_float_#in~x;isnan_float_#res := (if ~someBinaryFLOATComparisonOperation(isnan_float_~x, isnan_float_~x) then 1 else 0); {38#false} is VALID [2020-07-28 17:54:10,371 INFO L280 TraceCheckUtils]: 9: Hoare triple {38#false} main_#t~ret15 := isnan_float_#res;assume -2147483648 <= main_#t~ret15 && main_#t~ret15 <= 2147483647;main_#t~short17 := 0 != main_#t~ret15; {38#false} is VALID [2020-07-28 17:54:10,372 INFO L280 TraceCheckUtils]: 10: Hoare triple {38#false} assume !main_#t~short17; {38#false} is VALID [2020-07-28 17:54:10,372 INFO L280 TraceCheckUtils]: 11: Hoare triple {38#false} assume main_#t~short17;havoc main_#t~mem14;havoc main_#t~ret15;havoc main_#t~ret16;havoc main_#t~short17; {38#false} is VALID [2020-07-28 17:54:10,373 INFO L280 TraceCheckUtils]: 12: Hoare triple {38#false} assume !false; {38#false} is VALID [2020-07-28 17:54:10,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:54:10,376 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341552294] [2020-07-28 17:54:10,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:54:10,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-28 17:54:10,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107120326] [2020-07-28 17:54:10,384 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2020-07-28 17:54:10,386 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:54:10,389 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 17:54:10,417 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:54:10,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 17:54:10,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 17:54:10,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 17:54:10,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 17:54:10,430 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2020-07-28 17:54:10,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:54:10,525 INFO L93 Difference]: Finished difference Result 66 states and 102 transitions. [2020-07-28 17:54:10,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 17:54:10,525 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2020-07-28 17:54:10,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:54:10,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:54:10,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 102 transitions. [2020-07-28 17:54:10,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:54:10,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 102 transitions. [2020-07-28 17:54:10,556 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 102 transitions. [2020-07-28 17:54:10,762 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:54:10,781 INFO L225 Difference]: With dead ends: 66 [2020-07-28 17:54:10,781 INFO L226 Difference]: Without dead ends: 31 [2020-07-28 17:54:10,787 INFO L675 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 [2020-07-28 17:54:10,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-28 17:54:10,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-07-28 17:54:10,830 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:54:10,830 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2020-07-28 17:54:10,831 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2020-07-28 17:54:10,831 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2020-07-28 17:54:10,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:54:10,836 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2020-07-28 17:54:10,836 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2020-07-28 17:54:10,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:54:10,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:54:10,838 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2020-07-28 17:54:10,838 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2020-07-28 17:54:10,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:54:10,843 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2020-07-28 17:54:10,844 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2020-07-28 17:54:10,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:54:10,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:54:10,845 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:54:10,845 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:54:10,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-28 17:54:10,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2020-07-28 17:54:10,851 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 13 [2020-07-28 17:54:10,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:54:10,851 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2020-07-28 17:54:10,852 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 17:54:10,852 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2020-07-28 17:54:10,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-28 17:54:10,853 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:54:10,854 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:54:10,854 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 17:54:10,855 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:54:10,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:54:10,856 INFO L82 PathProgramCache]: Analyzing trace with hash -56818241, now seen corresponding path program 1 times [2020-07-28 17:54:10,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:54:10,856 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067915175] [2020-07-28 17:54:10,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:54:10,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:54:11,025 INFO L280 TraceCheckUtils]: 0: Hoare triple {226#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~one_modf~0 := 1.0; {226#true} is VALID [2020-07-28 17:54:11,025 INFO L280 TraceCheckUtils]: 1: Hoare triple {226#true} havoc main_#res;havoc main_#t~ret13, main_#t~mem14, main_#t~ret15, main_#t~ret16, main_#t~short17, main_~x~0, main_~#iptr~0.base, main_~#iptr~0.offset, main_~res~0;main_~x~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0);call main_~#iptr~0.base, main_~#iptr~0.offset := #Ultimate.allocOnStack(4);modf_float_#in~x, modf_float_#in~iptr.base, modf_float_#in~iptr.offset := main_~x~0, main_~#iptr~0.base, main_~#iptr~0.offset;havoc modf_float_#res;havoc modf_float_#t~mem0, modf_float_#t~union1, modf_float_~#gf_u~0.base, modf_float_~#gf_u~0.offset, modf_float_#t~mem2, modf_float_~#sf_u~0.base, modf_float_~#sf_u~0.offset, modf_float_#t~mem3, modf_float_#t~union4, modf_float_~#gf_u~1.base, modf_float_~#gf_u~1.offset, modf_float_#t~mem5, modf_float_#t~union6, modf_float_~#sf_u~1.base, modf_float_~#sf_u~1.offset, modf_float_~ix~0, modf_float_#t~mem7, modf_float_~#sf_u~2.base, modf_float_~#sf_u~2.offset, modf_float_#t~mem8, modf_float_#t~mem9, modf_float_#t~union10, modf_float_~#gf_u~2.base, modf_float_~#gf_u~2.offset, modf_float_#t~mem11, modf_float_#t~union12, modf_float_~#sf_u~3.base, modf_float_~#sf_u~3.offset, modf_float_~ix~1, modf_float_~x, modf_float_~iptr.base, modf_float_~iptr.offset, modf_float_~i0~0, modf_float_~j0~0, modf_float_~i~0;modf_float_~x := modf_float_#in~x;modf_float_~iptr.base, modf_float_~iptr.offset := modf_float_#in~iptr.base, modf_float_#in~iptr.offset;havoc modf_float_~i0~0;havoc modf_float_~j0~0;havoc modf_float_~i~0; {226#true} is VALID [2020-07-28 17:54:11,026 INFO L280 TraceCheckUtils]: 2: Hoare triple {226#true} call modf_float_~#gf_u~0.base, modf_float_~#gf_u~0.offset := #Ultimate.allocOnStack(4);call write~real(modf_float_~x, modf_float_~#gf_u~0.base, modf_float_~#gf_u~0.offset, 4);call modf_float_#t~mem0 := read~int(modf_float_~#gf_u~0.base, modf_float_~#gf_u~0.offset, 4);modf_float_~i0~0 := (if modf_float_#t~mem0 % 4294967296 % 4294967296 <= 2147483647 then modf_float_#t~mem0 % 4294967296 % 4294967296 else modf_float_#t~mem0 % 4294967296 % 4294967296 - 4294967296);call write~real(modf_float_#t~union1, modf_float_~#gf_u~0.base, modf_float_~#gf_u~0.offset, 4);havoc modf_float_#t~mem0;havoc modf_float_#t~union1;call ULTIMATE.dealloc(modf_float_~#gf_u~0.base, modf_float_~#gf_u~0.offset);havoc modf_float_~#gf_u~0.base, modf_float_~#gf_u~0.offset; {226#true} is VALID [2020-07-28 17:54:11,027 INFO L280 TraceCheckUtils]: 3: Hoare triple {226#true} goto; {226#true} is VALID [2020-07-28 17:54:11,028 INFO L280 TraceCheckUtils]: 4: Hoare triple {226#true} modf_float_~j0~0 := ~bitwiseAnd(modf_float_~i0~0 / 8388608, 255) - 127; {226#true} is VALID [2020-07-28 17:54:11,028 INFO L280 TraceCheckUtils]: 5: Hoare triple {226#true} assume modf_float_~j0~0 < 23; {226#true} is VALID [2020-07-28 17:54:11,028 INFO L280 TraceCheckUtils]: 6: Hoare triple {226#true} assume modf_float_~j0~0 < 0; {226#true} is VALID [2020-07-28 17:54:11,029 INFO L280 TraceCheckUtils]: 7: Hoare triple {226#true} call modf_float_~#sf_u~0.base, modf_float_~#sf_u~0.offset := #Ultimate.allocOnStack(4);call write~int(~bitwiseAnd(modf_float_~i0~0, 2147483648), modf_float_~#sf_u~0.base, modf_float_~#sf_u~0.offset, 4);call modf_float_#t~mem2 := read~real(modf_float_~#sf_u~0.base, modf_float_~#sf_u~0.offset, 4);call write~real(modf_float_#t~mem2, modf_float_~iptr.base, modf_float_~iptr.offset, 4);havoc modf_float_#t~mem2;call ULTIMATE.dealloc(modf_float_~#sf_u~0.base, modf_float_~#sf_u~0.offset);havoc modf_float_~#sf_u~0.base, modf_float_~#sf_u~0.offset; {226#true} is VALID [2020-07-28 17:54:11,030 INFO L280 TraceCheckUtils]: 8: Hoare triple {226#true} goto; {226#true} is VALID [2020-07-28 17:54:11,030 INFO L280 TraceCheckUtils]: 9: Hoare triple {226#true} modf_float_#res := modf_float_~x; {226#true} is VALID [2020-07-28 17:54:11,031 INFO L280 TraceCheckUtils]: 10: Hoare triple {226#true} main_#t~ret13 := modf_float_#res;main_~res~0 := main_#t~ret13;havoc main_#t~ret13;call main_#t~mem14 := read~real(main_~#iptr~0.base, main_~#iptr~0.offset, 4);isnan_float_#in~x := main_#t~mem14;havoc isnan_float_#res;havoc isnan_float_~x;isnan_float_~x := isnan_float_#in~x;isnan_float_#res := (if ~someBinaryFLOATComparisonOperation(isnan_float_~x, isnan_float_~x) then 1 else 0); {226#true} is VALID [2020-07-28 17:54:11,031 INFO L280 TraceCheckUtils]: 11: Hoare triple {226#true} main_#t~ret15 := isnan_float_#res;assume -2147483648 <= main_#t~ret15 && main_#t~ret15 <= 2147483647;main_#t~short17 := 0 != main_#t~ret15; {226#true} is VALID [2020-07-28 17:54:11,032 INFO L280 TraceCheckUtils]: 12: Hoare triple {226#true} assume !main_#t~short17; {228#(not |ULTIMATE.start_main_#t~short17|)} is VALID [2020-07-28 17:54:11,033 INFO L280 TraceCheckUtils]: 13: Hoare triple {228#(not |ULTIMATE.start_main_#t~short17|)} assume main_#t~short17;havoc main_#t~mem14;havoc main_#t~ret15;havoc main_#t~ret16;havoc main_#t~short17; {227#false} is VALID [2020-07-28 17:54:11,033 INFO L280 TraceCheckUtils]: 14: Hoare triple {227#false} assume !false; {227#false} is VALID [2020-07-28 17:54:11,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:54:11,035 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067915175] [2020-07-28 17:54:11,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:54:11,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-28 17:54:11,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112384428] [2020-07-28 17:54:11,040 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2020-07-28 17:54:11,041 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:54:11,041 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-28 17:54:11,067 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:54:11,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-28 17:54:11,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 17:54:11,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-28 17:54:11,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 17:54:11,068 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 3 states. [2020-07-28 17:54:11,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:54:11,157 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2020-07-28 17:54:11,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-28 17:54:11,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2020-07-28 17:54:11,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:54:11,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 17:54:11,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2020-07-28 17:54:11,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 17:54:11,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2020-07-28 17:54:11,161 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 36 transitions. [2020-07-28 17:54:11,211 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:54:11,212 INFO L225 Difference]: With dead ends: 34 [2020-07-28 17:54:11,212 INFO L226 Difference]: Without dead ends: 31 [2020-07-28 17:54:11,213 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 17:54:11,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-28 17:54:11,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-07-28 17:54:11,221 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:54:11,222 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2020-07-28 17:54:11,222 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2020-07-28 17:54:11,222 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2020-07-28 17:54:11,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:54:11,225 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2020-07-28 17:54:11,225 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2020-07-28 17:54:11,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:54:11,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:54:11,226 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2020-07-28 17:54:11,226 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2020-07-28 17:54:11,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:54:11,229 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2020-07-28 17:54:11,229 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2020-07-28 17:54:11,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:54:11,230 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:54:11,230 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:54:11,230 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:54:11,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-28 17:54:11,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2020-07-28 17:54:11,232 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 15 [2020-07-28 17:54:11,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:54:11,233 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2020-07-28 17:54:11,233 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-28 17:54:11,233 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2020-07-28 17:54:11,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-28 17:54:11,234 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:54:11,234 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:54:11,235 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-28 17:54:11,235 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:54:11,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:54:11,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1761490312, now seen corresponding path program 1 times [2020-07-28 17:54:11,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:54:11,236 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497054026] [2020-07-28 17:54:11,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:54:11,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 17:54:11,289 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 17:54:11,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 17:54:11,336 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 17:54:11,367 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-28 17:54:11,368 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-28 17:54:11,368 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-28 17:54:11,407 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 17:54:11,408 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-28 17:54:11,408 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2020-07-28 17:54:11,408 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2020-07-28 17:54:11,408 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2020-07-28 17:54:11,408 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2020-07-28 17:54:11,408 WARN L170 areAnnotationChecker]: L16-3 has no Hoare annotation [2020-07-28 17:54:11,409 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-28 17:54:11,409 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-28 17:54:11,409 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-28 17:54:11,409 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-28 17:54:11,409 WARN L170 areAnnotationChecker]: L58-2 has no Hoare annotation [2020-07-28 17:54:11,409 WARN L170 areAnnotationChecker]: L58-2 has no Hoare annotation [2020-07-28 17:54:11,409 WARN L170 areAnnotationChecker]: L24-2 has no Hoare annotation [2020-07-28 17:54:11,410 WARN L170 areAnnotationChecker]: L24-2 has no Hoare annotation [2020-07-28 17:54:11,410 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2020-07-28 17:54:11,410 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2020-07-28 17:54:11,410 WARN L170 areAnnotationChecker]: L58-1 has no Hoare annotation [2020-07-28 17:54:11,410 WARN L170 areAnnotationChecker]: L58-1 has no Hoare annotation [2020-07-28 17:54:11,410 WARN L170 areAnnotationChecker]: L63-1 has no Hoare annotation [2020-07-28 17:54:11,411 WARN L170 areAnnotationChecker]: L63-1 has no Hoare annotation [2020-07-28 17:54:11,411 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2020-07-28 17:54:11,411 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2020-07-28 17:54:11,411 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2020-07-28 17:54:11,411 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2020-07-28 17:54:11,411 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2020-07-28 17:54:11,411 WARN L170 areAnnotationChecker]: L47-2 has no Hoare annotation [2020-07-28 17:54:11,412 WARN L170 areAnnotationChecker]: L47-2 has no Hoare annotation [2020-07-28 17:54:11,412 WARN L170 areAnnotationChecker]: L63 has no Hoare annotation [2020-07-28 17:54:11,412 WARN L170 areAnnotationChecker]: L63 has no Hoare annotation [2020-07-28 17:54:11,412 WARN L170 areAnnotationChecker]: L63-2 has no Hoare annotation [2020-07-28 17:54:11,412 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2020-07-28 17:54:11,412 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2020-07-28 17:54:11,413 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2020-07-28 17:54:11,413 WARN L170 areAnnotationChecker]: L40-1 has no Hoare annotation [2020-07-28 17:54:11,413 WARN L170 areAnnotationChecker]: L40-1 has no Hoare annotation [2020-07-28 17:54:11,413 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2020-07-28 17:54:11,413 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2020-07-28 17:54:11,413 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2020-07-28 17:54:11,413 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2020-07-28 17:54:11,414 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-28 17:54:11,414 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-28 17:54:11,414 WARN L170 areAnnotationChecker]: L40-2 has no Hoare annotation [2020-07-28 17:54:11,414 WARN L170 areAnnotationChecker]: L85 has no Hoare annotation [2020-07-28 17:54:11,414 WARN L170 areAnnotationChecker]: L85 has no Hoare annotation [2020-07-28 17:54:11,414 WARN L170 areAnnotationChecker]: L73-1 has no Hoare annotation [2020-07-28 17:54:11,415 WARN L170 areAnnotationChecker]: L85-2 has no Hoare annotation [2020-07-28 17:54:11,415 WARN L170 areAnnotationChecker]: L85-2 has no Hoare annotation [2020-07-28 17:54:11,415 WARN L170 areAnnotationChecker]: L86 has no Hoare annotation [2020-07-28 17:54:11,415 WARN L170 areAnnotationChecker]: L86 has no Hoare annotation [2020-07-28 17:54:11,415 WARN L170 areAnnotationChecker]: L89 has no Hoare annotation [2020-07-28 17:54:11,416 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 17:54:11,416 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-28 17:54:11,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 05:54:11 BoogieIcfgContainer [2020-07-28 17:54:11,418 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 17:54:11,419 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 17:54:11,419 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 17:54:11,419 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 17:54:11,420 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:54:10" (3/4) ... [2020-07-28 17:54:11,424 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-28 17:54:11,424 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 17:54:11,430 INFO L168 Benchmark]: Toolchain (without parser) took 2426.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 954.9 MB in the beginning and 993.5 MB in the end (delta: -38.6 MB). Peak memory consumption was 101.9 MB. Max. memory is 11.5 GB. [2020-07-28 17:54:11,430 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 17:54:11,431 INFO L168 Benchmark]: CACSL2BoogieTranslator took 337.09 ms. Allocated memory is still 1.0 GB. Free memory was 954.9 MB in the beginning and 938.8 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2020-07-28 17:54:11,432 INFO L168 Benchmark]: Boogie Procedure Inliner took 133.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 938.8 MB in the beginning and 1.1 GB in the end (delta: -191.7 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2020-07-28 17:54:11,433 INFO L168 Benchmark]: Boogie Preprocessor took 40.24 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 17:54:11,434 INFO L168 Benchmark]: RCFGBuilder took 605.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.3 MB). Peak memory consumption was 45.3 MB. Max. memory is 11.5 GB. [2020-07-28 17:54:11,434 INFO L168 Benchmark]: TraceAbstraction took 1298.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 993.5 MB in the end (delta: 91.7 MB). Peak memory consumption was 91.7 MB. Max. memory is 11.5 GB. [2020-07-28 17:54:11,435 INFO L168 Benchmark]: Witness Printer took 4.87 ms. Allocated memory is still 1.2 GB. Free memory is still 993.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 17:54:11,439 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 337.09 ms. Allocated memory is still 1.0 GB. Free memory was 954.9 MB in the beginning and 938.8 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 133.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 938.8 MB in the beginning and 1.1 GB in the end (delta: -191.7 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.24 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 605.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.3 MB). Peak memory consumption was 45.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1298.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 993.5 MB in the end (delta: 91.7 MB). Peak memory consumption was 91.7 MB. Max. memory is 11.5 GB. * Witness Printer took 4.87 ms. Allocated memory is still 1.2 GB. Free memory is still 993.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 86]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 73, overapproximation of someBinaryArithmeticFLOAToperation at line 80, overapproximation of bitwiseAnd at line 26. Possible FailurePath: [L11] static const float one_modf = 1.0; VAL [one_modf=1] [L80] float x = 0.0f / 0.0f; [L81] float iptr; [L14] __int32_t i0, j0; [L15] __uint32_t i; VAL [one_modf=1] [L17] ieee_float_shape_type gf_u; [L18] gf_u.value = (x) [L19] EXPR gf_u.word [L19] (i0) = gf_u.word [L21] j0 = ((i0 >> 23) & 0xff) - 0x7f VAL [one_modf=1] [L22] COND TRUE j0 < 23 VAL [one_modf=1] [L23] COND TRUE j0 < 0 VAL [one_modf=1] [L25] ieee_float_shape_type sf_u; [L26] sf_u.word = (i0 & 0x80000000) [L27] EXPR sf_u.value [L27] (*iptr) = sf_u.value [L29] return x; VAL [one_modf=1] [L82] float res = modf_float(x, &iptr); [L85] EXPR \read(iptr) [L73] return x != x; VAL [one_modf=1] [L85] isnan_float(iptr) && !isnan_float(res) [L73] return x != x; VAL [one_modf=1] [L85] isnan_float(iptr) && !isnan_float(res) VAL [one_modf=1] [L85] COND TRUE isnan_float(iptr) && !isnan_float(res) [L86] __VERIFIER_error() VAL [one_modf=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 34 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 1.1s, OverallIterations: 3, TraceHistogramMax: 1, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 71 SDtfs, 0 SDslu, 28 SDs, 0 SdLazy, 5 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 44 NumberOfCodeBlocks, 44 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 26 ConstructedInterpolants, 0 QuantifiedInterpolants, 354 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: 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-8bd4bc6 [2020-07-28 17:54:13,335 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 17:54:13,337 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 17:54:13,350 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 17:54:13,350 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 17:54:13,351 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 17:54:13,353 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 17:54:13,355 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 17:54:13,357 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 17:54:13,358 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 17:54:13,359 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 17:54:13,360 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 17:54:13,361 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 17:54:13,362 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 17:54:13,363 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 17:54:13,366 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 17:54:13,367 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 17:54:13,371 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 17:54:13,373 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 17:54:13,378 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 17:54:13,381 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 17:54:13,384 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 17:54:13,387 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 17:54:13,389 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 17:54:13,393 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 17:54:13,394 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 17:54:13,394 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 17:54:13,395 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 17:54:13,396 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 17:54:13,398 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 17:54:13,398 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 17:54:13,399 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 17:54:13,401 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 17:54:13,402 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 17:54:13,404 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 17:54:13,406 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 17:54:13,407 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 17:54:13,407 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 17:54:13,407 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 17:54:13,408 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 17:54:13,410 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 17:54:13,411 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2020-07-28 17:54:13,434 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 17:54:13,434 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 17:54:13,437 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 17:54:13,437 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 17:54:13,437 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 17:54:13,438 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 17:54:13,438 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 17:54:13,438 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 17:54:13,439 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 17:54:13,439 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 17:54:13,440 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 17:54:13,440 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 17:54:13,441 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-07-28 17:54:13,441 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-07-28 17:54:13,442 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 17:54:13,442 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 17:54:13,442 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 17:54:13,442 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 17:54:13,443 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 17:54:13,443 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 17:54:13,443 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 17:54:13,443 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 17:54:13,444 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 17:54:13,444 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 17:54:13,444 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 17:54:13,445 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 17:54:13,445 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-07-28 17:54:13,445 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-07-28 17:54:13,445 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 17:54:13,446 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 17:54:13,446 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-28 17:54:13,446 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 36fce2ac9d239f0bf9286aa317af7b50704c65b6 [2020-07-28 17:54:13,826 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 17:54:13,847 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 17:54:13,851 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 17:54:13,852 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 17:54:13,854 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 17:54:13,855 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1210.c [2020-07-28 17:54:13,926 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/394ac580b/61fb8cf4e72c46dc9c872c60e0389483/FLAG4edd1c476 [2020-07-28 17:54:14,389 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 17:54:14,390 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1210.c [2020-07-28 17:54:14,400 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/394ac580b/61fb8cf4e72c46dc9c872c60e0389483/FLAG4edd1c476 [2020-07-28 17:54:14,741 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/394ac580b/61fb8cf4e72c46dc9c872c60e0389483 [2020-07-28 17:54:14,745 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 17:54:14,748 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 17:54:14,750 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 17:54:14,750 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 17:54:14,754 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 17:54:14,756 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:54:14" (1/1) ... [2020-07-28 17:54:14,759 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a5575ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:54:14, skipping insertion in model container [2020-07-28 17:54:14,759 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:54:14" (1/1) ... [2020-07-28 17:54:14,767 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 17:54:14,788 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 17:54:14,984 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:54:15,001 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 17:54:15,095 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:54:15,114 INFO L208 MainTranslator]: Completed translation [2020-07-28 17:54:15,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:54:15 WrapperNode [2020-07-28 17:54:15,115 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 17:54:15,116 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 17:54:15,116 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 17:54:15,116 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 17:54:15,125 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:54:15" (1/1) ... [2020-07-28 17:54:15,137 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:54:15" (1/1) ... [2020-07-28 17:54:15,172 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 17:54:15,173 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 17:54:15,173 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 17:54:15,173 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 17:54:15,183 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:54:15" (1/1) ... [2020-07-28 17:54:15,183 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:54:15" (1/1) ... [2020-07-28 17:54:15,188 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:54:15" (1/1) ... [2020-07-28 17:54:15,189 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:54:15" (1/1) ... [2020-07-28 17:54:15,206 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:54:15" (1/1) ... [2020-07-28 17:54:15,213 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:54:15" (1/1) ... [2020-07-28 17:54:15,216 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:54:15" (1/1) ... [2020-07-28 17:54:15,221 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 17:54:15,221 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 17:54:15,221 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 17:54:15,222 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 17:54:15,223 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:54:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-07-28 17:54:15,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-28 17:54:15,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2020-07-28 17:54:15,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2020-07-28 17:54:15,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 17:54:15,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 17:54:15,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2020-07-28 17:54:15,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2020-07-28 17:54:15,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-28 17:54:15,965 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 17:54:15,966 INFO L295 CfgBuilder]: Removed 24 assume(true) statements. [2020-07-28 17:54:15,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:54:15 BoogieIcfgContainer [2020-07-28 17:54:15,970 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 17:54:15,971 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 17:54:15,971 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 17:54:15,974 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 17:54:15,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 05:54:14" (1/3) ... [2020-07-28 17:54:15,976 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55f65e67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:54:15, skipping insertion in model container [2020-07-28 17:54:15,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:54:15" (2/3) ... [2020-07-28 17:54:15,976 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55f65e67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:54:15, skipping insertion in model container [2020-07-28 17:54:15,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:54:15" (3/3) ... [2020-07-28 17:54:15,979 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1210.c [2020-07-28 17:54:15,989 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 17:54:15,997 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 17:54:16,010 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 17:54:16,033 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 17:54:16,034 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 17:54:16,034 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 17:54:16,034 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 17:54:16,035 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 17:54:16,035 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 17:54:16,035 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 17:54:16,035 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 17:54:16,049 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2020-07-28 17:54:16,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-28 17:54:16,056 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:54:16,057 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:54:16,058 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:54:16,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:54:16,064 INFO L82 PathProgramCache]: Analyzing trace with hash -556426464, now seen corresponding path program 1 times [2020-07-28 17:54:16,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 17:54:16,078 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [628734] [2020-07-28 17:54:16,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-07-28 17:54:16,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:54:16,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 1 conjunts are in the unsatisfiable core [2020-07-28 17:54:16,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:54:16,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 17:54:16,306 INFO L280 TraceCheckUtils]: 0: Hoare triple {37#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~one_modf~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0)); {37#true} is VALID [2020-07-28 17:54:16,306 INFO L280 TraceCheckUtils]: 1: Hoare triple {37#true} havoc main_#res;havoc main_#t~ret13, main_#t~mem14, main_#t~ret15, main_#t~ret16, main_#t~short17, main_~x~0, main_~#iptr~0.base, main_~#iptr~0.offset, main_~res~0;main_~x~0 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());call main_~#iptr~0.base, main_~#iptr~0.offset := #Ultimate.allocOnStack(4bv32);modf_float_#in~x, modf_float_#in~iptr.base, modf_float_#in~iptr.offset := main_~x~0, main_~#iptr~0.base, main_~#iptr~0.offset;havoc modf_float_#res;havoc modf_float_#t~mem0, modf_float_#t~union1, modf_float_~#gf_u~0.base, modf_float_~#gf_u~0.offset, modf_float_#t~mem2, modf_float_~#sf_u~0.base, modf_float_~#sf_u~0.offset, modf_float_#t~mem3, modf_float_#t~union4, modf_float_~#gf_u~1.base, modf_float_~#gf_u~1.offset, modf_float_#t~mem5, modf_float_#t~union6, modf_float_~#sf_u~1.base, modf_float_~#sf_u~1.offset, modf_float_~ix~0, modf_float_#t~mem7, modf_float_~#sf_u~2.base, modf_float_~#sf_u~2.offset, modf_float_#t~mem8, modf_float_#t~mem9, modf_float_#t~union10, modf_float_~#gf_u~2.base, modf_float_~#gf_u~2.offset, modf_float_#t~mem11, modf_float_#t~union12, modf_float_~#sf_u~3.base, modf_float_~#sf_u~3.offset, modf_float_~ix~1, modf_float_~x, modf_float_~iptr.base, modf_float_~iptr.offset, modf_float_~i0~0, modf_float_~j0~0, modf_float_~i~0;modf_float_~x := modf_float_#in~x;modf_float_~iptr.base, modf_float_~iptr.offset := modf_float_#in~iptr.base, modf_float_#in~iptr.offset;havoc modf_float_~i0~0;havoc modf_float_~j0~0;havoc modf_float_~i~0; {37#true} is VALID [2020-07-28 17:54:16,308 INFO L280 TraceCheckUtils]: 2: Hoare triple {37#true} assume !true; {38#false} is VALID [2020-07-28 17:54:16,308 INFO L280 TraceCheckUtils]: 3: Hoare triple {38#false} modf_float_~j0~0 := ~bvsub32(~bvand32(255bv32, ~bvashr32(modf_float_~i0~0, 23bv32)), 127bv32); {38#false} is VALID [2020-07-28 17:54:16,308 INFO L280 TraceCheckUtils]: 4: Hoare triple {38#false} assume !~bvslt32(modf_float_~j0~0, 23bv32);havoc modf_float_~ix~1;call write~intFLOATTYPE4(~fp.mul~FLOAT(currentRoundingMode, modf_float_~x, ~one_modf~0), modf_float_~iptr.base, modf_float_~iptr.offset, 4bv32); {38#false} is VALID [2020-07-28 17:54:16,309 INFO L280 TraceCheckUtils]: 5: Hoare triple {38#false} assume !true; {38#false} is VALID [2020-07-28 17:54:16,309 INFO L280 TraceCheckUtils]: 6: Hoare triple {38#false} assume !true; {38#false} is VALID [2020-07-28 17:54:16,309 INFO L280 TraceCheckUtils]: 7: Hoare triple {38#false} modf_float_#res := modf_float_~x; {38#false} is VALID [2020-07-28 17:54:16,310 INFO L280 TraceCheckUtils]: 8: Hoare triple {38#false} main_#t~ret13 := modf_float_#res;main_~res~0 := main_#t~ret13;havoc main_#t~ret13;call main_#t~mem14 := read~intFLOATTYPE4(main_~#iptr~0.base, main_~#iptr~0.offset, 4bv32);isnan_float_#in~x := main_#t~mem14;havoc isnan_float_#res;havoc isnan_float_~x;isnan_float_~x := isnan_float_#in~x;isnan_float_#res := (if !~fp.eq~FLOAT(isnan_float_~x, isnan_float_~x) then 1bv32 else 0bv32); {38#false} is VALID [2020-07-28 17:54:16,310 INFO L280 TraceCheckUtils]: 9: Hoare triple {38#false} main_#t~ret15 := isnan_float_#res;main_#t~short17 := 0bv32 != main_#t~ret15; {38#false} is VALID [2020-07-28 17:54:16,311 INFO L280 TraceCheckUtils]: 10: Hoare triple {38#false} assume !main_#t~short17; {38#false} is VALID [2020-07-28 17:54:16,311 INFO L280 TraceCheckUtils]: 11: Hoare triple {38#false} assume main_#t~short17;havoc main_#t~ret15;havoc main_#t~ret16;havoc main_#t~short17;havoc main_#t~mem14; {38#false} is VALID [2020-07-28 17:54:16,311 INFO L280 TraceCheckUtils]: 12: Hoare triple {38#false} assume !false; {38#false} is VALID [2020-07-28 17:54:16,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:54:16,315 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 17:54:16,330 INFO L280 TraceCheckUtils]: 12: Hoare triple {38#false} assume !false; {38#false} is VALID [2020-07-28 17:54:16,330 INFO L280 TraceCheckUtils]: 11: Hoare triple {38#false} assume main_#t~short17;havoc main_#t~ret15;havoc main_#t~ret16;havoc main_#t~short17;havoc main_#t~mem14; {38#false} is VALID [2020-07-28 17:54:16,330 INFO L280 TraceCheckUtils]: 10: Hoare triple {38#false} assume !main_#t~short17; {38#false} is VALID [2020-07-28 17:54:16,331 INFO L280 TraceCheckUtils]: 9: Hoare triple {38#false} main_#t~ret15 := isnan_float_#res;main_#t~short17 := 0bv32 != main_#t~ret15; {38#false} is VALID [2020-07-28 17:54:16,331 INFO L280 TraceCheckUtils]: 8: Hoare triple {38#false} main_#t~ret13 := modf_float_#res;main_~res~0 := main_#t~ret13;havoc main_#t~ret13;call main_#t~mem14 := read~intFLOATTYPE4(main_~#iptr~0.base, main_~#iptr~0.offset, 4bv32);isnan_float_#in~x := main_#t~mem14;havoc isnan_float_#res;havoc isnan_float_~x;isnan_float_~x := isnan_float_#in~x;isnan_float_#res := (if !~fp.eq~FLOAT(isnan_float_~x, isnan_float_~x) then 1bv32 else 0bv32); {38#false} is VALID [2020-07-28 17:54:16,331 INFO L280 TraceCheckUtils]: 7: Hoare triple {38#false} modf_float_#res := modf_float_~x; {38#false} is VALID [2020-07-28 17:54:16,332 INFO L280 TraceCheckUtils]: 6: Hoare triple {38#false} assume !true; {38#false} is VALID [2020-07-28 17:54:16,332 INFO L280 TraceCheckUtils]: 5: Hoare triple {38#false} assume !true; {38#false} is VALID [2020-07-28 17:54:16,332 INFO L280 TraceCheckUtils]: 4: Hoare triple {38#false} assume !~bvslt32(modf_float_~j0~0, 23bv32);havoc modf_float_~ix~1;call write~intFLOATTYPE4(~fp.mul~FLOAT(currentRoundingMode, modf_float_~x, ~one_modf~0), modf_float_~iptr.base, modf_float_~iptr.offset, 4bv32); {38#false} is VALID [2020-07-28 17:54:16,333 INFO L280 TraceCheckUtils]: 3: Hoare triple {38#false} modf_float_~j0~0 := ~bvsub32(~bvand32(255bv32, ~bvashr32(modf_float_~i0~0, 23bv32)), 127bv32); {38#false} is VALID [2020-07-28 17:54:16,333 INFO L280 TraceCheckUtils]: 2: Hoare triple {37#true} assume !true; {38#false} is VALID [2020-07-28 17:54:16,334 INFO L280 TraceCheckUtils]: 1: Hoare triple {37#true} havoc main_#res;havoc main_#t~ret13, main_#t~mem14, main_#t~ret15, main_#t~ret16, main_#t~short17, main_~x~0, main_~#iptr~0.base, main_~#iptr~0.offset, main_~res~0;main_~x~0 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());call main_~#iptr~0.base, main_~#iptr~0.offset := #Ultimate.allocOnStack(4bv32);modf_float_#in~x, modf_float_#in~iptr.base, modf_float_#in~iptr.offset := main_~x~0, main_~#iptr~0.base, main_~#iptr~0.offset;havoc modf_float_#res;havoc modf_float_#t~mem0, modf_float_#t~union1, modf_float_~#gf_u~0.base, modf_float_~#gf_u~0.offset, modf_float_#t~mem2, modf_float_~#sf_u~0.base, modf_float_~#sf_u~0.offset, modf_float_#t~mem3, modf_float_#t~union4, modf_float_~#gf_u~1.base, modf_float_~#gf_u~1.offset, modf_float_#t~mem5, modf_float_#t~union6, modf_float_~#sf_u~1.base, modf_float_~#sf_u~1.offset, modf_float_~ix~0, modf_float_#t~mem7, modf_float_~#sf_u~2.base, modf_float_~#sf_u~2.offset, modf_float_#t~mem8, modf_float_#t~mem9, modf_float_#t~union10, modf_float_~#gf_u~2.base, modf_float_~#gf_u~2.offset, modf_float_#t~mem11, modf_float_#t~union12, modf_float_~#sf_u~3.base, modf_float_~#sf_u~3.offset, modf_float_~ix~1, modf_float_~x, modf_float_~iptr.base, modf_float_~iptr.offset, modf_float_~i0~0, modf_float_~j0~0, modf_float_~i~0;modf_float_~x := modf_float_#in~x;modf_float_~iptr.base, modf_float_~iptr.offset := modf_float_#in~iptr.base, modf_float_#in~iptr.offset;havoc modf_float_~i0~0;havoc modf_float_~j0~0;havoc modf_float_~i~0; {37#true} is VALID [2020-07-28 17:54:16,334 INFO L280 TraceCheckUtils]: 0: Hoare triple {37#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~one_modf~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0)); {37#true} is VALID [2020-07-28 17:54:16,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:54:16,336 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [628734] [2020-07-28 17:54:16,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:54:16,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-07-28 17:54:16,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547028162] [2020-07-28 17:54:16,344 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2020-07-28 17:54:16,345 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:54:16,349 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 17:54:16,407 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:54:16,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 17:54:16,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 17:54:16,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 17:54:16,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 17:54:16,419 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2020-07-28 17:54:16,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:54:16,653 INFO L93 Difference]: Finished difference Result 66 states and 102 transitions. [2020-07-28 17:54:16,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 17:54:16,654 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2020-07-28 17:54:16,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:54:16,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:54:16,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 102 transitions. [2020-07-28 17:54:16,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:54:16,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 102 transitions. [2020-07-28 17:54:16,667 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 102 transitions. [2020-07-28 17:54:16,939 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:54:16,951 INFO L225 Difference]: With dead ends: 66 [2020-07-28 17:54:16,951 INFO L226 Difference]: Without dead ends: 31 [2020-07-28 17:54:16,954 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 17:54:16,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-28 17:54:16,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-07-28 17:54:16,989 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:54:16,990 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2020-07-28 17:54:16,990 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2020-07-28 17:54:16,990 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2020-07-28 17:54:16,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:54:16,995 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2020-07-28 17:54:16,995 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2020-07-28 17:54:16,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:54:16,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:54:16,996 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2020-07-28 17:54:16,996 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2020-07-28 17:54:16,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:54:17,000 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2020-07-28 17:54:17,000 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2020-07-28 17:54:17,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:54:17,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:54:17,001 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:54:17,001 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:54:17,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-28 17:54:17,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2020-07-28 17:54:17,005 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 13 [2020-07-28 17:54:17,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:54:17,006 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2020-07-28 17:54:17,006 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 17:54:17,006 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2020-07-28 17:54:17,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-28 17:54:17,007 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:54:17,007 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:54:17,220 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-07-28 17:54:17,220 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:54:17,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:54:17,221 INFO L82 PathProgramCache]: Analyzing trace with hash -56818241, now seen corresponding path program 1 times [2020-07-28 17:54:17,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 17:54:17,230 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [346684640] [2020-07-28 17:54:17,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-07-28 17:54:17,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:54:17,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-28 17:54:17,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:54:17,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 17:54:17,512 INFO L280 TraceCheckUtils]: 0: Hoare triple {298#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~one_modf~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0)); {298#true} is VALID [2020-07-28 17:54:17,516 INFO L280 TraceCheckUtils]: 1: Hoare triple {298#true} havoc main_#res;havoc main_#t~ret13, main_#t~mem14, main_#t~ret15, main_#t~ret16, main_#t~short17, main_~x~0, main_~#iptr~0.base, main_~#iptr~0.offset, main_~res~0;main_~x~0 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());call main_~#iptr~0.base, main_~#iptr~0.offset := #Ultimate.allocOnStack(4bv32);modf_float_#in~x, modf_float_#in~iptr.base, modf_float_#in~iptr.offset := main_~x~0, main_~#iptr~0.base, main_~#iptr~0.offset;havoc modf_float_#res;havoc modf_float_#t~mem0, modf_float_#t~union1, modf_float_~#gf_u~0.base, modf_float_~#gf_u~0.offset, modf_float_#t~mem2, modf_float_~#sf_u~0.base, modf_float_~#sf_u~0.offset, modf_float_#t~mem3, modf_float_#t~union4, modf_float_~#gf_u~1.base, modf_float_~#gf_u~1.offset, modf_float_#t~mem5, modf_float_#t~union6, modf_float_~#sf_u~1.base, modf_float_~#sf_u~1.offset, modf_float_~ix~0, modf_float_#t~mem7, modf_float_~#sf_u~2.base, modf_float_~#sf_u~2.offset, modf_float_#t~mem8, modf_float_#t~mem9, modf_float_#t~union10, modf_float_~#gf_u~2.base, modf_float_~#gf_u~2.offset, modf_float_#t~mem11, modf_float_#t~union12, modf_float_~#sf_u~3.base, modf_float_~#sf_u~3.offset, modf_float_~ix~1, modf_float_~x, modf_float_~iptr.base, modf_float_~iptr.offset, modf_float_~i0~0, modf_float_~j0~0, modf_float_~i~0;modf_float_~x := modf_float_#in~x;modf_float_~iptr.base, modf_float_~iptr.offset := modf_float_#in~iptr.base, modf_float_#in~iptr.offset;havoc modf_float_~i0~0;havoc modf_float_~j0~0;havoc modf_float_~i~0; {306#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_modf_float_~x (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2020-07-28 17:54:17,600 INFO L280 TraceCheckUtils]: 2: Hoare triple {306#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_modf_float_~x (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} call modf_float_~#gf_u~0.base, modf_float_~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(modf_float_~x, modf_float_~#gf_u~0.base, modf_float_~#gf_u~0.offset, 4bv32);call modf_float_#t~mem0 := read~intINTTYPE4(modf_float_~#gf_u~0.base, modf_float_~#gf_u~0.offset, 4bv32);modf_float_~i0~0 := modf_float_#t~mem0;call write~intFLOATTYPE4(modf_float_#t~union1, modf_float_~#gf_u~0.base, modf_float_~#gf_u~0.offset, 4bv32);havoc modf_float_#t~mem0;havoc modf_float_#t~union1;call ULTIMATE.dealloc(modf_float_~#gf_u~0.base, modf_float_~#gf_u~0.offset);havoc modf_float_~#gf_u~0.base, modf_float_~#gf_u~0.offset; {310#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24)) (fp ((_ extract 31 31) ULTIMATE.start_modf_float_~i0~0) ((_ extract 30 23) ULTIMATE.start_modf_float_~i0~0) ((_ extract 22 0) ULTIMATE.start_modf_float_~i0~0))))} is VALID [2020-07-28 17:54:17,601 INFO L280 TraceCheckUtils]: 3: Hoare triple {310#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24)) (fp ((_ extract 31 31) ULTIMATE.start_modf_float_~i0~0) ((_ extract 30 23) ULTIMATE.start_modf_float_~i0~0) ((_ extract 22 0) ULTIMATE.start_modf_float_~i0~0))))} goto; {310#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24)) (fp ((_ extract 31 31) ULTIMATE.start_modf_float_~i0~0) ((_ extract 30 23) ULTIMATE.start_modf_float_~i0~0) ((_ extract 22 0) ULTIMATE.start_modf_float_~i0~0))))} is VALID [2020-07-28 17:54:17,609 INFO L280 TraceCheckUtils]: 4: Hoare triple {310#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24)) (fp ((_ extract 31 31) ULTIMATE.start_modf_float_~i0~0) ((_ extract 30 23) ULTIMATE.start_modf_float_~i0~0) ((_ extract 22 0) ULTIMATE.start_modf_float_~i0~0))))} modf_float_~j0~0 := ~bvsub32(~bvand32(255bv32, ~bvashr32(modf_float_~i0~0, 23bv32)), 127bv32); {317#(exists ((ULTIMATE.start_modf_float_~i0~0 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (bvadd ULTIMATE.start_modf_float_~j0~0 (_ bv127 32)) (bvand (_ bv255 32) (bvashr ULTIMATE.start_modf_float_~i0~0 (_ bv23 32)))) (= (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24)) (fp ((_ extract 31 31) ULTIMATE.start_modf_float_~i0~0) ((_ extract 30 23) ULTIMATE.start_modf_float_~i0~0) ((_ extract 22 0) ULTIMATE.start_modf_float_~i0~0)))))} is VALID [2020-07-28 17:54:17,613 INFO L280 TraceCheckUtils]: 5: Hoare triple {317#(exists ((ULTIMATE.start_modf_float_~i0~0 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (bvadd ULTIMATE.start_modf_float_~j0~0 (_ bv127 32)) (bvand (_ bv255 32) (bvashr ULTIMATE.start_modf_float_~i0~0 (_ bv23 32)))) (= (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24)) (fp ((_ extract 31 31) ULTIMATE.start_modf_float_~i0~0) ((_ extract 30 23) ULTIMATE.start_modf_float_~i0~0) ((_ extract 22 0) ULTIMATE.start_modf_float_~i0~0)))))} assume ~bvslt32(modf_float_~j0~0, 23bv32); {299#false} is VALID [2020-07-28 17:54:17,613 INFO L280 TraceCheckUtils]: 6: Hoare triple {299#false} assume ~bvslt32(modf_float_~j0~0, 0bv32); {299#false} is VALID [2020-07-28 17:54:17,614 INFO L280 TraceCheckUtils]: 7: Hoare triple {299#false} call modf_float_~#sf_u~0.base, modf_float_~#sf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intINTTYPE4(~bvand32(2147483648bv32, modf_float_~i0~0), modf_float_~#sf_u~0.base, modf_float_~#sf_u~0.offset, 4bv32);call modf_float_#t~mem2 := read~intFLOATTYPE4(modf_float_~#sf_u~0.base, modf_float_~#sf_u~0.offset, 4bv32);call write~intFLOATTYPE4(modf_float_#t~mem2, modf_float_~iptr.base, modf_float_~iptr.offset, 4bv32);havoc modf_float_#t~mem2;call ULTIMATE.dealloc(modf_float_~#sf_u~0.base, modf_float_~#sf_u~0.offset);havoc modf_float_~#sf_u~0.base, modf_float_~#sf_u~0.offset; {299#false} is VALID [2020-07-28 17:54:17,614 INFO L280 TraceCheckUtils]: 8: Hoare triple {299#false} goto; {299#false} is VALID [2020-07-28 17:54:17,614 INFO L280 TraceCheckUtils]: 9: Hoare triple {299#false} modf_float_#res := modf_float_~x; {299#false} is VALID [2020-07-28 17:54:17,615 INFO L280 TraceCheckUtils]: 10: Hoare triple {299#false} main_#t~ret13 := modf_float_#res;main_~res~0 := main_#t~ret13;havoc main_#t~ret13;call main_#t~mem14 := read~intFLOATTYPE4(main_~#iptr~0.base, main_~#iptr~0.offset, 4bv32);isnan_float_#in~x := main_#t~mem14;havoc isnan_float_#res;havoc isnan_float_~x;isnan_float_~x := isnan_float_#in~x;isnan_float_#res := (if !~fp.eq~FLOAT(isnan_float_~x, isnan_float_~x) then 1bv32 else 0bv32); {299#false} is VALID [2020-07-28 17:54:17,615 INFO L280 TraceCheckUtils]: 11: Hoare triple {299#false} main_#t~ret15 := isnan_float_#res;main_#t~short17 := 0bv32 != main_#t~ret15; {299#false} is VALID [2020-07-28 17:54:17,615 INFO L280 TraceCheckUtils]: 12: Hoare triple {299#false} assume !main_#t~short17; {299#false} is VALID [2020-07-28 17:54:17,616 INFO L280 TraceCheckUtils]: 13: Hoare triple {299#false} assume main_#t~short17;havoc main_#t~ret15;havoc main_#t~ret16;havoc main_#t~short17;havoc main_#t~mem14; {299#false} is VALID [2020-07-28 17:54:17,616 INFO L280 TraceCheckUtils]: 14: Hoare triple {299#false} assume !false; {299#false} is VALID [2020-07-28 17:54:17,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:54:17,619 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 17:54:17,817 INFO L280 TraceCheckUtils]: 14: Hoare triple {299#false} assume !false; {299#false} is VALID [2020-07-28 17:54:17,817 INFO L280 TraceCheckUtils]: 13: Hoare triple {299#false} assume main_#t~short17;havoc main_#t~ret15;havoc main_#t~ret16;havoc main_#t~short17;havoc main_#t~mem14; {299#false} is VALID [2020-07-28 17:54:17,818 INFO L280 TraceCheckUtils]: 12: Hoare triple {299#false} assume !main_#t~short17; {299#false} is VALID [2020-07-28 17:54:17,818 INFO L280 TraceCheckUtils]: 11: Hoare triple {299#false} main_#t~ret15 := isnan_float_#res;main_#t~short17 := 0bv32 != main_#t~ret15; {299#false} is VALID [2020-07-28 17:54:17,819 INFO L280 TraceCheckUtils]: 10: Hoare triple {299#false} main_#t~ret13 := modf_float_#res;main_~res~0 := main_#t~ret13;havoc main_#t~ret13;call main_#t~mem14 := read~intFLOATTYPE4(main_~#iptr~0.base, main_~#iptr~0.offset, 4bv32);isnan_float_#in~x := main_#t~mem14;havoc isnan_float_#res;havoc isnan_float_~x;isnan_float_~x := isnan_float_#in~x;isnan_float_#res := (if !~fp.eq~FLOAT(isnan_float_~x, isnan_float_~x) then 1bv32 else 0bv32); {299#false} is VALID [2020-07-28 17:54:17,819 INFO L280 TraceCheckUtils]: 9: Hoare triple {299#false} modf_float_#res := modf_float_~x; {299#false} is VALID [2020-07-28 17:54:17,820 INFO L280 TraceCheckUtils]: 8: Hoare triple {299#false} goto; {299#false} is VALID [2020-07-28 17:54:17,821 INFO L280 TraceCheckUtils]: 7: Hoare triple {299#false} call modf_float_~#sf_u~0.base, modf_float_~#sf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intINTTYPE4(~bvand32(2147483648bv32, modf_float_~i0~0), modf_float_~#sf_u~0.base, modf_float_~#sf_u~0.offset, 4bv32);call modf_float_#t~mem2 := read~intFLOATTYPE4(modf_float_~#sf_u~0.base, modf_float_~#sf_u~0.offset, 4bv32);call write~intFLOATTYPE4(modf_float_#t~mem2, modf_float_~iptr.base, modf_float_~iptr.offset, 4bv32);havoc modf_float_#t~mem2;call ULTIMATE.dealloc(modf_float_~#sf_u~0.base, modf_float_~#sf_u~0.offset);havoc modf_float_~#sf_u~0.base, modf_float_~#sf_u~0.offset; {299#false} is VALID [2020-07-28 17:54:17,821 INFO L280 TraceCheckUtils]: 6: Hoare triple {299#false} assume ~bvslt32(modf_float_~j0~0, 0bv32); {299#false} is VALID [2020-07-28 17:54:17,822 INFO L280 TraceCheckUtils]: 5: Hoare triple {375#(not (bvslt ULTIMATE.start_modf_float_~j0~0 (_ bv23 32)))} assume ~bvslt32(modf_float_~j0~0, 23bv32); {299#false} is VALID [2020-07-28 17:54:17,823 INFO L280 TraceCheckUtils]: 4: Hoare triple {379#(not (bvslt (bvadd (bvand (_ bv255 32) (bvashr ULTIMATE.start_modf_float_~i0~0 (_ bv23 32))) (_ bv4294967169 32)) (_ bv23 32)))} modf_float_~j0~0 := ~bvsub32(~bvand32(255bv32, ~bvashr32(modf_float_~i0~0, 23bv32)), 127bv32); {375#(not (bvslt ULTIMATE.start_modf_float_~j0~0 (_ bv23 32)))} is VALID [2020-07-28 17:54:17,824 INFO L280 TraceCheckUtils]: 3: Hoare triple {379#(not (bvslt (bvadd (bvand (_ bv255 32) (bvashr ULTIMATE.start_modf_float_~i0~0 (_ bv23 32))) (_ bv4294967169 32)) (_ bv23 32)))} goto; {379#(not (bvslt (bvadd (bvand (_ bv255 32) (bvashr ULTIMATE.start_modf_float_~i0~0 (_ bv23 32))) (_ bv4294967169 32)) (_ bv23 32)))} is VALID [2020-07-28 17:54:17,832 INFO L280 TraceCheckUtils]: 2: Hoare triple {386#(forall ((v_skolemized_v_prenex_1_3 (_ BitVec 32))) (or (not (bvslt (bvadd (bvand (_ bv255 32) (bvashr v_skolemized_v_prenex_1_3 (_ bv23 32))) (_ bv4294967169 32)) (_ bv23 32))) (not (= ULTIMATE.start_modf_float_~x (fp ((_ extract 31 31) v_skolemized_v_prenex_1_3) ((_ extract 30 23) v_skolemized_v_prenex_1_3) ((_ extract 22 0) v_skolemized_v_prenex_1_3))))))} call modf_float_~#gf_u~0.base, modf_float_~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(modf_float_~x, modf_float_~#gf_u~0.base, modf_float_~#gf_u~0.offset, 4bv32);call modf_float_#t~mem0 := read~intINTTYPE4(modf_float_~#gf_u~0.base, modf_float_~#gf_u~0.offset, 4bv32);modf_float_~i0~0 := modf_float_#t~mem0;call write~intFLOATTYPE4(modf_float_#t~union1, modf_float_~#gf_u~0.base, modf_float_~#gf_u~0.offset, 4bv32);havoc modf_float_#t~mem0;havoc modf_float_#t~union1;call ULTIMATE.dealloc(modf_float_~#gf_u~0.base, modf_float_~#gf_u~0.offset);havoc modf_float_~#gf_u~0.base, modf_float_~#gf_u~0.offset; {379#(not (bvslt (bvadd (bvand (_ bv255 32) (bvashr ULTIMATE.start_modf_float_~i0~0 (_ bv23 32))) (_ bv4294967169 32)) (_ bv23 32)))} is VALID [2020-07-28 17:54:17,840 INFO L280 TraceCheckUtils]: 1: Hoare triple {298#true} havoc main_#res;havoc main_#t~ret13, main_#t~mem14, main_#t~ret15, main_#t~ret16, main_#t~short17, main_~x~0, main_~#iptr~0.base, main_~#iptr~0.offset, main_~res~0;main_~x~0 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());call main_~#iptr~0.base, main_~#iptr~0.offset := #Ultimate.allocOnStack(4bv32);modf_float_#in~x, modf_float_#in~iptr.base, modf_float_#in~iptr.offset := main_~x~0, main_~#iptr~0.base, main_~#iptr~0.offset;havoc modf_float_#res;havoc modf_float_#t~mem0, modf_float_#t~union1, modf_float_~#gf_u~0.base, modf_float_~#gf_u~0.offset, modf_float_#t~mem2, modf_float_~#sf_u~0.base, modf_float_~#sf_u~0.offset, modf_float_#t~mem3, modf_float_#t~union4, modf_float_~#gf_u~1.base, modf_float_~#gf_u~1.offset, modf_float_#t~mem5, modf_float_#t~union6, modf_float_~#sf_u~1.base, modf_float_~#sf_u~1.offset, modf_float_~ix~0, modf_float_#t~mem7, modf_float_~#sf_u~2.base, modf_float_~#sf_u~2.offset, modf_float_#t~mem8, modf_float_#t~mem9, modf_float_#t~union10, modf_float_~#gf_u~2.base, modf_float_~#gf_u~2.offset, modf_float_#t~mem11, modf_float_#t~union12, modf_float_~#sf_u~3.base, modf_float_~#sf_u~3.offset, modf_float_~ix~1, modf_float_~x, modf_float_~iptr.base, modf_float_~iptr.offset, modf_float_~i0~0, modf_float_~j0~0, modf_float_~i~0;modf_float_~x := modf_float_#in~x;modf_float_~iptr.base, modf_float_~iptr.offset := modf_float_#in~iptr.base, modf_float_#in~iptr.offset;havoc modf_float_~i0~0;havoc modf_float_~j0~0;havoc modf_float_~i~0; {386#(forall ((v_skolemized_v_prenex_1_3 (_ BitVec 32))) (or (not (bvslt (bvadd (bvand (_ bv255 32) (bvashr v_skolemized_v_prenex_1_3 (_ bv23 32))) (_ bv4294967169 32)) (_ bv23 32))) (not (= ULTIMATE.start_modf_float_~x (fp ((_ extract 31 31) v_skolemized_v_prenex_1_3) ((_ extract 30 23) v_skolemized_v_prenex_1_3) ((_ extract 22 0) v_skolemized_v_prenex_1_3))))))} is VALID [2020-07-28 17:54:17,840 INFO L280 TraceCheckUtils]: 0: Hoare triple {298#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~one_modf~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0)); {298#true} is VALID [2020-07-28 17:54:17,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:54:17,842 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [346684640] [2020-07-28 17:54:17,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:54:17,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2020-07-28 17:54:17,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471835199] [2020-07-28 17:54:17,845 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2020-07-28 17:54:17,845 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:54:17,846 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-28 17:54:17,896 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:54:17,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-28 17:54:17,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 17:54:17,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-28 17:54:17,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-07-28 17:54:17,898 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 8 states. [2020-07-28 17:54:18,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:54:18,733 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2020-07-28 17:54:18,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-28 17:54:18,733 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2020-07-28 17:54:18,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:54:18,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-28 17:54:18,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2020-07-28 17:54:18,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-28 17:54:18,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2020-07-28 17:54:18,738 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 41 transitions. [2020-07-28 17:54:18,907 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:54:18,908 INFO L225 Difference]: With dead ends: 38 [2020-07-28 17:54:18,908 INFO L226 Difference]: Without dead ends: 18 [2020-07-28 17:54:18,910 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2020-07-28 17:54:18,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-28 17:54:18,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-07-28 17:54:18,940 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:54:18,940 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2020-07-28 17:54:18,940 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2020-07-28 17:54:18,940 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2020-07-28 17:54:18,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:54:18,942 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2020-07-28 17:54:18,942 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2020-07-28 17:54:18,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:54:18,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:54:18,943 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2020-07-28 17:54:18,944 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2020-07-28 17:54:18,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:54:18,946 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2020-07-28 17:54:18,946 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2020-07-28 17:54:18,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:54:18,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:54:18,947 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:54:18,948 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:54:18,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-28 17:54:18,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2020-07-28 17:54:18,956 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2020-07-28 17:54:18,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:54:18,958 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2020-07-28 17:54:18,958 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-28 17:54:18,958 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2020-07-28 17:54:18,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-28 17:54:18,959 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:54:18,959 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:54:19,164 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-07-28 17:54:19,165 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:54:19,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:54:19,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1951048762, now seen corresponding path program 1 times [2020-07-28 17:54:19,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 17:54:19,168 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1576543698] [2020-07-28 17:54:19,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-07-28 17:54:19,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:54:19,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-28 17:54:19,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:54:19,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 17:54:19,334 INFO L280 TraceCheckUtils]: 0: Hoare triple {506#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~one_modf~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0)); {506#true} is VALID [2020-07-28 17:54:19,335 INFO L280 TraceCheckUtils]: 1: Hoare triple {506#true} havoc main_#res;havoc main_#t~ret13, main_#t~mem14, main_#t~ret15, main_#t~ret16, main_#t~short17, main_~x~0, main_~#iptr~0.base, main_~#iptr~0.offset, main_~res~0;main_~x~0 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());call main_~#iptr~0.base, main_~#iptr~0.offset := #Ultimate.allocOnStack(4bv32);modf_float_#in~x, modf_float_#in~iptr.base, modf_float_#in~iptr.offset := main_~x~0, main_~#iptr~0.base, main_~#iptr~0.offset;havoc modf_float_#res;havoc modf_float_#t~mem0, modf_float_#t~union1, modf_float_~#gf_u~0.base, modf_float_~#gf_u~0.offset, modf_float_#t~mem2, modf_float_~#sf_u~0.base, modf_float_~#sf_u~0.offset, modf_float_#t~mem3, modf_float_#t~union4, modf_float_~#gf_u~1.base, modf_float_~#gf_u~1.offset, modf_float_#t~mem5, modf_float_#t~union6, modf_float_~#sf_u~1.base, modf_float_~#sf_u~1.offset, modf_float_~ix~0, modf_float_#t~mem7, modf_float_~#sf_u~2.base, modf_float_~#sf_u~2.offset, modf_float_#t~mem8, modf_float_#t~mem9, modf_float_#t~union10, modf_float_~#gf_u~2.base, modf_float_~#gf_u~2.offset, modf_float_#t~mem11, modf_float_#t~union12, modf_float_~#sf_u~3.base, modf_float_~#sf_u~3.offset, modf_float_~ix~1, modf_float_~x, modf_float_~iptr.base, modf_float_~iptr.offset, modf_float_~i0~0, modf_float_~j0~0, modf_float_~i~0;modf_float_~x := modf_float_#in~x;modf_float_~iptr.base, modf_float_~iptr.offset := modf_float_#in~iptr.base, modf_float_#in~iptr.offset;havoc modf_float_~i0~0;havoc modf_float_~j0~0;havoc modf_float_~i~0; {506#true} is VALID [2020-07-28 17:54:19,335 INFO L280 TraceCheckUtils]: 2: Hoare triple {506#true} call modf_float_~#gf_u~0.base, modf_float_~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(modf_float_~x, modf_float_~#gf_u~0.base, modf_float_~#gf_u~0.offset, 4bv32);call modf_float_#t~mem0 := read~intINTTYPE4(modf_float_~#gf_u~0.base, modf_float_~#gf_u~0.offset, 4bv32);modf_float_~i0~0 := modf_float_#t~mem0;call write~intFLOATTYPE4(modf_float_#t~union1, modf_float_~#gf_u~0.base, modf_float_~#gf_u~0.offset, 4bv32);havoc modf_float_#t~mem0;havoc modf_float_#t~union1;call ULTIMATE.dealloc(modf_float_~#gf_u~0.base, modf_float_~#gf_u~0.offset);havoc modf_float_~#gf_u~0.base, modf_float_~#gf_u~0.offset; {506#true} is VALID [2020-07-28 17:54:19,335 INFO L280 TraceCheckUtils]: 3: Hoare triple {506#true} goto; {506#true} is VALID [2020-07-28 17:54:19,336 INFO L280 TraceCheckUtils]: 4: Hoare triple {506#true} modf_float_~j0~0 := ~bvsub32(~bvand32(255bv32, ~bvashr32(modf_float_~i0~0, 23bv32)), 127bv32); {506#true} is VALID [2020-07-28 17:54:19,336 INFO L280 TraceCheckUtils]: 5: Hoare triple {506#true} assume !~bvslt32(modf_float_~j0~0, 23bv32);havoc modf_float_~ix~1;call write~intFLOATTYPE4(~fp.mul~FLOAT(currentRoundingMode, modf_float_~x, ~one_modf~0), modf_float_~iptr.base, modf_float_~iptr.offset, 4bv32); {506#true} is VALID [2020-07-28 17:54:19,336 INFO L280 TraceCheckUtils]: 6: Hoare triple {506#true} call modf_float_~#gf_u~2.base, modf_float_~#gf_u~2.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(modf_float_~x, modf_float_~#gf_u~2.base, modf_float_~#gf_u~2.offset, 4bv32);call modf_float_#t~mem9 := read~intINTTYPE4(modf_float_~#gf_u~2.base, modf_float_~#gf_u~2.offset, 4bv32);modf_float_~ix~1 := modf_float_#t~mem9;call write~intFLOATTYPE4(modf_float_#t~union10, modf_float_~#gf_u~2.base, modf_float_~#gf_u~2.offset, 4bv32);havoc modf_float_#t~union10;havoc modf_float_#t~mem9;call ULTIMATE.dealloc(modf_float_~#gf_u~2.base, modf_float_~#gf_u~2.offset);havoc modf_float_~#gf_u~2.base, modf_float_~#gf_u~2.offset; {506#true} is VALID [2020-07-28 17:54:19,337 INFO L280 TraceCheckUtils]: 7: Hoare triple {506#true} goto; {506#true} is VALID [2020-07-28 17:54:19,337 INFO L280 TraceCheckUtils]: 8: Hoare triple {506#true} call modf_float_~#sf_u~3.base, modf_float_~#sf_u~3.offset := #Ultimate.allocOnStack(4bv32);call write~intINTTYPE4(~bvand32(2147483648bv32, modf_float_~ix~1), modf_float_~#sf_u~3.base, modf_float_~#sf_u~3.offset, 4bv32);call modf_float_#t~mem11 := read~intFLOATTYPE4(modf_float_~#sf_u~3.base, modf_float_~#sf_u~3.offset, 4bv32);modf_float_~x := modf_float_#t~mem11;call write~intINTTYPE4(modf_float_#t~union12, modf_float_~#sf_u~3.base, modf_float_~#sf_u~3.offset, 4bv32);havoc modf_float_#t~mem11;havoc modf_float_#t~union12;call ULTIMATE.dealloc(modf_float_~#sf_u~3.base, modf_float_~#sf_u~3.offset);havoc modf_float_~#sf_u~3.base, modf_float_~#sf_u~3.offset; {506#true} is VALID [2020-07-28 17:54:19,337 INFO L280 TraceCheckUtils]: 9: Hoare triple {506#true} goto; {506#true} is VALID [2020-07-28 17:54:19,338 INFO L280 TraceCheckUtils]: 10: Hoare triple {506#true} modf_float_#res := modf_float_~x; {506#true} is VALID [2020-07-28 17:54:19,338 INFO L280 TraceCheckUtils]: 11: Hoare triple {506#true} main_#t~ret13 := modf_float_#res;main_~res~0 := main_#t~ret13;havoc main_#t~ret13;call main_#t~mem14 := read~intFLOATTYPE4(main_~#iptr~0.base, main_~#iptr~0.offset, 4bv32);isnan_float_#in~x := main_#t~mem14;havoc isnan_float_#res;havoc isnan_float_~x;isnan_float_~x := isnan_float_#in~x;isnan_float_#res := (if !~fp.eq~FLOAT(isnan_float_~x, isnan_float_~x) then 1bv32 else 0bv32); {506#true} is VALID [2020-07-28 17:54:19,338 INFO L280 TraceCheckUtils]: 12: Hoare triple {506#true} main_#t~ret15 := isnan_float_#res;main_#t~short17 := 0bv32 != main_#t~ret15; {506#true} is VALID [2020-07-28 17:54:19,343 INFO L280 TraceCheckUtils]: 13: Hoare triple {506#true} assume !main_#t~short17; {550#(not |ULTIMATE.start_main_#t~short17|)} is VALID [2020-07-28 17:54:19,344 INFO L280 TraceCheckUtils]: 14: Hoare triple {550#(not |ULTIMATE.start_main_#t~short17|)} assume main_#t~short17;havoc main_#t~ret15;havoc main_#t~ret16;havoc main_#t~short17;havoc main_#t~mem14; {507#false} is VALID [2020-07-28 17:54:19,345 INFO L280 TraceCheckUtils]: 15: Hoare triple {507#false} assume !false; {507#false} is VALID [2020-07-28 17:54:19,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:54:19,345 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 17:54:19,357 INFO L280 TraceCheckUtils]: 15: Hoare triple {507#false} assume !false; {507#false} is VALID [2020-07-28 17:54:19,365 INFO L280 TraceCheckUtils]: 14: Hoare triple {550#(not |ULTIMATE.start_main_#t~short17|)} assume main_#t~short17;havoc main_#t~ret15;havoc main_#t~ret16;havoc main_#t~short17;havoc main_#t~mem14; {507#false} is VALID [2020-07-28 17:54:19,366 INFO L280 TraceCheckUtils]: 13: Hoare triple {506#true} assume !main_#t~short17; {550#(not |ULTIMATE.start_main_#t~short17|)} is VALID [2020-07-28 17:54:19,367 INFO L280 TraceCheckUtils]: 12: Hoare triple {506#true} main_#t~ret15 := isnan_float_#res;main_#t~short17 := 0bv32 != main_#t~ret15; {506#true} is VALID [2020-07-28 17:54:19,367 INFO L280 TraceCheckUtils]: 11: Hoare triple {506#true} main_#t~ret13 := modf_float_#res;main_~res~0 := main_#t~ret13;havoc main_#t~ret13;call main_#t~mem14 := read~intFLOATTYPE4(main_~#iptr~0.base, main_~#iptr~0.offset, 4bv32);isnan_float_#in~x := main_#t~mem14;havoc isnan_float_#res;havoc isnan_float_~x;isnan_float_~x := isnan_float_#in~x;isnan_float_#res := (if !~fp.eq~FLOAT(isnan_float_~x, isnan_float_~x) then 1bv32 else 0bv32); {506#true} is VALID [2020-07-28 17:54:19,367 INFO L280 TraceCheckUtils]: 10: Hoare triple {506#true} modf_float_#res := modf_float_~x; {506#true} is VALID [2020-07-28 17:54:19,367 INFO L280 TraceCheckUtils]: 9: Hoare triple {506#true} goto; {506#true} is VALID [2020-07-28 17:54:19,368 INFO L280 TraceCheckUtils]: 8: Hoare triple {506#true} call modf_float_~#sf_u~3.base, modf_float_~#sf_u~3.offset := #Ultimate.allocOnStack(4bv32);call write~intINTTYPE4(~bvand32(2147483648bv32, modf_float_~ix~1), modf_float_~#sf_u~3.base, modf_float_~#sf_u~3.offset, 4bv32);call modf_float_#t~mem11 := read~intFLOATTYPE4(modf_float_~#sf_u~3.base, modf_float_~#sf_u~3.offset, 4bv32);modf_float_~x := modf_float_#t~mem11;call write~intINTTYPE4(modf_float_#t~union12, modf_float_~#sf_u~3.base, modf_float_~#sf_u~3.offset, 4bv32);havoc modf_float_#t~mem11;havoc modf_float_#t~union12;call ULTIMATE.dealloc(modf_float_~#sf_u~3.base, modf_float_~#sf_u~3.offset);havoc modf_float_~#sf_u~3.base, modf_float_~#sf_u~3.offset; {506#true} is VALID [2020-07-28 17:54:19,368 INFO L280 TraceCheckUtils]: 7: Hoare triple {506#true} goto; {506#true} is VALID [2020-07-28 17:54:19,368 INFO L280 TraceCheckUtils]: 6: Hoare triple {506#true} call modf_float_~#gf_u~2.base, modf_float_~#gf_u~2.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(modf_float_~x, modf_float_~#gf_u~2.base, modf_float_~#gf_u~2.offset, 4bv32);call modf_float_#t~mem9 := read~intINTTYPE4(modf_float_~#gf_u~2.base, modf_float_~#gf_u~2.offset, 4bv32);modf_float_~ix~1 := modf_float_#t~mem9;call write~intFLOATTYPE4(modf_float_#t~union10, modf_float_~#gf_u~2.base, modf_float_~#gf_u~2.offset, 4bv32);havoc modf_float_#t~union10;havoc modf_float_#t~mem9;call ULTIMATE.dealloc(modf_float_~#gf_u~2.base, modf_float_~#gf_u~2.offset);havoc modf_float_~#gf_u~2.base, modf_float_~#gf_u~2.offset; {506#true} is VALID [2020-07-28 17:54:19,368 INFO L280 TraceCheckUtils]: 5: Hoare triple {506#true} assume !~bvslt32(modf_float_~j0~0, 23bv32);havoc modf_float_~ix~1;call write~intFLOATTYPE4(~fp.mul~FLOAT(currentRoundingMode, modf_float_~x, ~one_modf~0), modf_float_~iptr.base, modf_float_~iptr.offset, 4bv32); {506#true} is VALID [2020-07-28 17:54:19,369 INFO L280 TraceCheckUtils]: 4: Hoare triple {506#true} modf_float_~j0~0 := ~bvsub32(~bvand32(255bv32, ~bvashr32(modf_float_~i0~0, 23bv32)), 127bv32); {506#true} is VALID [2020-07-28 17:54:19,369 INFO L280 TraceCheckUtils]: 3: Hoare triple {506#true} goto; {506#true} is VALID [2020-07-28 17:54:19,369 INFO L280 TraceCheckUtils]: 2: Hoare triple {506#true} call modf_float_~#gf_u~0.base, modf_float_~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(modf_float_~x, modf_float_~#gf_u~0.base, modf_float_~#gf_u~0.offset, 4bv32);call modf_float_#t~mem0 := read~intINTTYPE4(modf_float_~#gf_u~0.base, modf_float_~#gf_u~0.offset, 4bv32);modf_float_~i0~0 := modf_float_#t~mem0;call write~intFLOATTYPE4(modf_float_#t~union1, modf_float_~#gf_u~0.base, modf_float_~#gf_u~0.offset, 4bv32);havoc modf_float_#t~mem0;havoc modf_float_#t~union1;call ULTIMATE.dealloc(modf_float_~#gf_u~0.base, modf_float_~#gf_u~0.offset);havoc modf_float_~#gf_u~0.base, modf_float_~#gf_u~0.offset; {506#true} is VALID [2020-07-28 17:54:19,369 INFO L280 TraceCheckUtils]: 1: Hoare triple {506#true} havoc main_#res;havoc main_#t~ret13, main_#t~mem14, main_#t~ret15, main_#t~ret16, main_#t~short17, main_~x~0, main_~#iptr~0.base, main_~#iptr~0.offset, main_~res~0;main_~x~0 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());call main_~#iptr~0.base, main_~#iptr~0.offset := #Ultimate.allocOnStack(4bv32);modf_float_#in~x, modf_float_#in~iptr.base, modf_float_#in~iptr.offset := main_~x~0, main_~#iptr~0.base, main_~#iptr~0.offset;havoc modf_float_#res;havoc modf_float_#t~mem0, modf_float_#t~union1, modf_float_~#gf_u~0.base, modf_float_~#gf_u~0.offset, modf_float_#t~mem2, modf_float_~#sf_u~0.base, modf_float_~#sf_u~0.offset, modf_float_#t~mem3, modf_float_#t~union4, modf_float_~#gf_u~1.base, modf_float_~#gf_u~1.offset, modf_float_#t~mem5, modf_float_#t~union6, modf_float_~#sf_u~1.base, modf_float_~#sf_u~1.offset, modf_float_~ix~0, modf_float_#t~mem7, modf_float_~#sf_u~2.base, modf_float_~#sf_u~2.offset, modf_float_#t~mem8, modf_float_#t~mem9, modf_float_#t~union10, modf_float_~#gf_u~2.base, modf_float_~#gf_u~2.offset, modf_float_#t~mem11, modf_float_#t~union12, modf_float_~#sf_u~3.base, modf_float_~#sf_u~3.offset, modf_float_~ix~1, modf_float_~x, modf_float_~iptr.base, modf_float_~iptr.offset, modf_float_~i0~0, modf_float_~j0~0, modf_float_~i~0;modf_float_~x := modf_float_#in~x;modf_float_~iptr.base, modf_float_~iptr.offset := modf_float_#in~iptr.base, modf_float_#in~iptr.offset;havoc modf_float_~i0~0;havoc modf_float_~j0~0;havoc modf_float_~i~0; {506#true} is VALID [2020-07-28 17:54:19,370 INFO L280 TraceCheckUtils]: 0: Hoare triple {506#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~one_modf~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0)); {506#true} is VALID [2020-07-28 17:54:19,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:54:19,371 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1576543698] [2020-07-28 17:54:19,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:54:19,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-07-28 17:54:19,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351353557] [2020-07-28 17:54:19,372 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-07-28 17:54:19,372 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:54:19,372 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-28 17:54:19,422 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:54:19,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-28 17:54:19,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 17:54:19,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-28 17:54:19,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 17:54:19,423 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 3 states. [2020-07-28 17:54:19,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:54:19,616 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2020-07-28 17:54:19,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-28 17:54:19,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-07-28 17:54:19,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:54:19,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 17:54:19,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2020-07-28 17:54:19,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 17:54:19,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2020-07-28 17:54:19,619 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 20 transitions. [2020-07-28 17:54:19,684 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:54:19,685 INFO L225 Difference]: With dead ends: 21 [2020-07-28 17:54:19,685 INFO L226 Difference]: Without dead ends: 18 [2020-07-28 17:54:19,687 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 17:54:19,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-28 17:54:19,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-07-28 17:54:19,697 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:54:19,698 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2020-07-28 17:54:19,698 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2020-07-28 17:54:19,698 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2020-07-28 17:54:19,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:54:19,700 INFO L93 Difference]: Finished difference Result 18 states and 17 transitions. [2020-07-28 17:54:19,700 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 17 transitions. [2020-07-28 17:54:19,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:54:19,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:54:19,701 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2020-07-28 17:54:19,701 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2020-07-28 17:54:19,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:54:19,702 INFO L93 Difference]: Finished difference Result 18 states and 17 transitions. [2020-07-28 17:54:19,702 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 17 transitions. [2020-07-28 17:54:19,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:54:19,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:54:19,703 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:54:19,703 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:54:19,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-28 17:54:19,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 17 transitions. [2020-07-28 17:54:19,705 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 17 transitions. Word has length 16 [2020-07-28 17:54:19,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:54:19,705 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 17 transitions. [2020-07-28 17:54:19,705 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-28 17:54:19,705 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 17 transitions. [2020-07-28 17:54:19,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-28 17:54:19,706 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:54:19,706 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:54:19,917 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-07-28 17:54:19,917 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:54:19,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:54:19,918 INFO L82 PathProgramCache]: Analyzing trace with hash 352844637, now seen corresponding path program 1 times [2020-07-28 17:54:19,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 17:54:19,920 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1148191452] [2020-07-28 17:54:19,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-07-28 17:54:20,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 17:54:20,150 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 17:54:20,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 17:54:20,315 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 17:54:20,368 INFO L174 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2020-07-28 17:54:20,368 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-28 17:54:20,569 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-07-28 17:54:20,625 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 17:54:20,625 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-28 17:54:20,625 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2020-07-28 17:54:20,625 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2020-07-28 17:54:20,626 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2020-07-28 17:54:20,626 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2020-07-28 17:54:20,626 WARN L170 areAnnotationChecker]: L16-3 has no Hoare annotation [2020-07-28 17:54:20,626 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-28 17:54:20,626 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-28 17:54:20,626 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-28 17:54:20,626 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-28 17:54:20,626 WARN L170 areAnnotationChecker]: L58-2 has no Hoare annotation [2020-07-28 17:54:20,626 WARN L170 areAnnotationChecker]: L58-2 has no Hoare annotation [2020-07-28 17:54:20,627 WARN L170 areAnnotationChecker]: L24-2 has no Hoare annotation [2020-07-28 17:54:20,627 WARN L170 areAnnotationChecker]: L24-2 has no Hoare annotation [2020-07-28 17:54:20,627 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2020-07-28 17:54:20,627 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2020-07-28 17:54:20,627 WARN L170 areAnnotationChecker]: L58-1 has no Hoare annotation [2020-07-28 17:54:20,627 WARN L170 areAnnotationChecker]: L58-1 has no Hoare annotation [2020-07-28 17:54:20,628 WARN L170 areAnnotationChecker]: L63-1 has no Hoare annotation [2020-07-28 17:54:20,628 WARN L170 areAnnotationChecker]: L63-1 has no Hoare annotation [2020-07-28 17:54:20,628 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2020-07-28 17:54:20,628 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2020-07-28 17:54:20,628 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2020-07-28 17:54:20,629 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2020-07-28 17:54:20,629 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2020-07-28 17:54:20,629 WARN L170 areAnnotationChecker]: L47-2 has no Hoare annotation [2020-07-28 17:54:20,629 WARN L170 areAnnotationChecker]: L47-2 has no Hoare annotation [2020-07-28 17:54:20,630 WARN L170 areAnnotationChecker]: L63 has no Hoare annotation [2020-07-28 17:54:20,630 WARN L170 areAnnotationChecker]: L63 has no Hoare annotation [2020-07-28 17:54:20,630 WARN L170 areAnnotationChecker]: L63-2 has no Hoare annotation [2020-07-28 17:54:20,631 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2020-07-28 17:54:20,631 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2020-07-28 17:54:20,631 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2020-07-28 17:54:20,631 WARN L170 areAnnotationChecker]: L40-1 has no Hoare annotation [2020-07-28 17:54:20,631 WARN L170 areAnnotationChecker]: L40-1 has no Hoare annotation [2020-07-28 17:54:20,631 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2020-07-28 17:54:20,631 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2020-07-28 17:54:20,632 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2020-07-28 17:54:20,632 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2020-07-28 17:54:20,632 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-28 17:54:20,633 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-28 17:54:20,634 WARN L170 areAnnotationChecker]: L40-2 has no Hoare annotation [2020-07-28 17:54:20,634 WARN L170 areAnnotationChecker]: L85 has no Hoare annotation [2020-07-28 17:54:20,634 WARN L170 areAnnotationChecker]: L85 has no Hoare annotation [2020-07-28 17:54:20,634 WARN L170 areAnnotationChecker]: L73-1 has no Hoare annotation [2020-07-28 17:54:20,635 WARN L170 areAnnotationChecker]: L85-2 has no Hoare annotation [2020-07-28 17:54:20,635 WARN L170 areAnnotationChecker]: L85-2 has no Hoare annotation [2020-07-28 17:54:20,635 WARN L170 areAnnotationChecker]: L86 has no Hoare annotation [2020-07-28 17:54:20,635 WARN L170 areAnnotationChecker]: L86 has no Hoare annotation [2020-07-28 17:54:20,635 WARN L170 areAnnotationChecker]: L89 has no Hoare annotation [2020-07-28 17:54:20,635 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 17:54:20,635 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-28 17:54:20,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 05:54:20 BoogieIcfgContainer [2020-07-28 17:54:20,638 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 17:54:20,638 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 17:54:20,638 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 17:54:20,639 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 17:54:20,639 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:54:15" (3/4) ... [2020-07-28 17:54:20,641 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-07-28 17:54:20,705 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-28 17:54:20,705 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 17:54:20,708 INFO L168 Benchmark]: Toolchain (without parser) took 5961.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 962.9 MB in the beginning and 832.3 MB in the end (delta: 130.6 MB). Peak memory consumption was 256.9 MB. Max. memory is 11.5 GB. [2020-07-28 17:54:20,709 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 17:54:20,710 INFO L168 Benchmark]: CACSL2BoogieTranslator took 365.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 962.9 MB in the beginning and 1.1 GB in the end (delta: -153.1 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2020-07-28 17:54:20,710 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.50 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 17:54:20,711 INFO L168 Benchmark]: Boogie Preprocessor took 48.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2020-07-28 17:54:20,711 INFO L168 Benchmark]: RCFGBuilder took 748.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.6 MB). Peak memory consumption was 33.6 MB. Max. memory is 11.5 GB. [2020-07-28 17:54:20,712 INFO L168 Benchmark]: TraceAbstraction took 4666.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 839.0 MB in the end (delta: 230.2 MB). Peak memory consumption was 230.2 MB. Max. memory is 11.5 GB. [2020-07-28 17:54:20,713 INFO L168 Benchmark]: Witness Printer took 66.89 ms. Allocated memory is still 1.2 GB. Free memory was 839.0 MB in the beginning and 832.3 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2020-07-28 17:54:20,717 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 365.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 962.9 MB in the beginning and 1.1 GB in the end (delta: -153.1 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 56.50 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 48.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 748.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.6 MB). Peak memory consumption was 33.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4666.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 839.0 MB in the end (delta: 230.2 MB). Peak memory consumption was 230.2 MB. Max. memory is 11.5 GB. * Witness Printer took 66.89 ms. Allocated memory is still 1.2 GB. Free memory was 839.0 MB in the beginning and 832.3 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 86]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L11] static const float one_modf = 1.0; VAL [one_modf=1.0] [L80] float x = 0.0f / 0.0f; [L81] float iptr; [L14] __int32_t i0, j0; [L15] __uint32_t i; VAL [one_modf=1.0] [L17] ieee_float_shape_type gf_u; [L18] gf_u.value = (x) [L19] EXPR gf_u.word [L19] (i0) = gf_u.word [L21] j0 = ((i0 >> 23) & 0xff) - 0x7f VAL [one_modf=1.0] [L22] COND FALSE !(j0 < 23) [L56] __uint32_t ix; [L57] *iptr = x * one_modf VAL [one_modf=1.0] [L59] ieee_float_shape_type gf_u; [L60] gf_u.value = (x) [L61] EXPR gf_u.word [L61] (ix) = gf_u.word [L64] ieee_float_shape_type sf_u; [L65] sf_u.word = (ix & 0x80000000) [L66] EXPR sf_u.value [L66] (x) = sf_u.value [L68] return x; VAL [one_modf=1.0] [L82] float res = modf_float(x, &iptr); [L85] EXPR \read(iptr) [L73] return x != x; VAL [one_modf=1.0] [L85] isnan_float(iptr) && !isnan_float(res) [L73] return x != x; VAL [one_modf=1.0] [L85] isnan_float(iptr) && !isnan_float(res) VAL [one_modf=1.0] [L85] COND TRUE isnan_float(iptr) && !isnan_float(res) [L86] __VERIFIER_error() VAL [one_modf=1.0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 34 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 4.5s, OverallIterations: 4, TraceHistogramMax: 1, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 69 SDtfs, 46 SDslu, 34 SDs, 0 SdLazy, 17 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred 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.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 61 NumberOfCodeBlocks, 61 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 82 ConstructedInterpolants, 5 QuantifiedInterpolants, 2476 SizeOfPredicates, 8 NumberOfNonLiveVariables, 159 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...