./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/float-newlib/float_req_bl_1230_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -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 /storage/repos/svcomp/c/float-newlib/float_req_bl_1230_true-unreach-call.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 31da98a788dd1938c78053bade42bc512d4e8954 ................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -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 /storage/repos/svcomp/c/float-newlib/float_req_bl_1230_true-unreach-call.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 31da98a788dd1938c78053bade42bc512d4e8954 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 09:16:30,020 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 09:16:30,022 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 09:16:30,034 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 09:16:30,034 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 09:16:30,035 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 09:16:30,037 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 09:16:30,046 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 09:16:30,048 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 09:16:30,049 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 09:16:30,050 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 09:16:30,050 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 09:16:30,051 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 09:16:30,052 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 09:16:30,053 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 09:16:30,054 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 09:16:30,056 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 09:16:30,057 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 09:16:30,061 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 09:16:30,063 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 09:16:30,065 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 09:16:30,066 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 09:16:30,069 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 09:16:30,070 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 09:16:30,072 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 09:16:30,073 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 09:16:30,074 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 09:16:30,074 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 09:16:30,078 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 09:16:30,079 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 09:16:30,079 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 09:16:30,082 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 09:16:30,082 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 09:16:30,082 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 09:16:30,083 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 09:16:30,084 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 09:16:30,084 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 09:16:30,108 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 09:16:30,108 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 09:16:30,109 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 09:16:30,110 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 09:16:30,110 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 09:16:30,110 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 09:16:30,110 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 09:16:30,110 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 09:16:30,111 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 09:16:30,111 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 09:16:30,111 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 09:16:30,111 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 09:16:30,111 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 09:16:30,112 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 09:16:30,113 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 09:16:30,113 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 09:16:30,113 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 09:16:30,113 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 09:16:30,114 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 09:16:30,114 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 09:16:30,114 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 09:16:30,114 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 09:16:30,114 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 09:16:30,115 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 09:16:30,116 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 09:16:30,116 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 09:16:30,116 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 09:16:30,116 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 09:16:30,117 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /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 -> 31da98a788dd1938c78053bade42bc512d4e8954 [2019-01-12 09:16:30,168 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 09:16:30,185 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 09:16:30,193 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 09:16:30,196 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 09:16:30,198 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 09:16:30,199 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/float_req_bl_1230_true-unreach-call.c [2019-01-12 09:16:30,261 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4083a2c68/204194a7878e4defa9159cc585f207c7/FLAG563df741e [2019-01-12 09:16:30,727 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 09:16:30,728 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/float_req_bl_1230_true-unreach-call.c [2019-01-12 09:16:30,734 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4083a2c68/204194a7878e4defa9159cc585f207c7/FLAG563df741e [2019-01-12 09:16:31,093 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4083a2c68/204194a7878e4defa9159cc585f207c7 [2019-01-12 09:16:31,096 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 09:16:31,098 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 09:16:31,099 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 09:16:31,099 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 09:16:31,103 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 09:16:31,104 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:16:31" (1/1) ... [2019-01-12 09:16:31,107 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d054b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:31, skipping insertion in model container [2019-01-12 09:16:31,107 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:16:31" (1/1) ... [2019-01-12 09:16:31,117 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 09:16:31,142 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 09:16:31,386 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:16:31,390 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 09:16:31,424 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:16:31,454 INFO L195 MainTranslator]: Completed translation [2019-01-12 09:16:31,454 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:31 WrapperNode [2019-01-12 09:16:31,454 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 09:16:31,456 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 09:16:31,456 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 09:16:31,456 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 09:16:31,466 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:31" (1/1) ... [2019-01-12 09:16:31,477 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:31" (1/1) ... [2019-01-12 09:16:31,517 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 09:16:31,521 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 09:16:31,521 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 09:16:31,521 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 09:16:31,534 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:31" (1/1) ... [2019-01-12 09:16:31,534 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:31" (1/1) ... [2019-01-12 09:16:31,538 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:31" (1/1) ... [2019-01-12 09:16:31,546 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:31" (1/1) ... [2019-01-12 09:16:31,555 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:31" (1/1) ... [2019-01-12 09:16:31,564 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:31" (1/1) ... [2019-01-12 09:16:31,567 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:31" (1/1) ... [2019-01-12 09:16:31,641 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 09:16:31,641 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 09:16:31,641 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 09:16:31,641 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 09:16:31,644 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:31" (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 [2019-01-12 09:16:31,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-01-12 09:16:31,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 09:16:31,721 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 09:16:31,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-12 09:16:31,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 09:16:31,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 09:16:32,309 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 09:16:32,309 INFO L286 CfgBuilder]: Removed 16 assue(true) statements. [2019-01-12 09:16:32,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:16:32 BoogieIcfgContainer [2019-01-12 09:16:32,311 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 09:16:32,312 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 09:16:32,312 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 09:16:32,316 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 09:16:32,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 09:16:31" (1/3) ... [2019-01-12 09:16:32,317 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dc3cc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:16:32, skipping insertion in model container [2019-01-12 09:16:32,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:31" (2/3) ... [2019-01-12 09:16:32,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dc3cc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:16:32, skipping insertion in model container [2019-01-12 09:16:32,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:16:32" (3/3) ... [2019-01-12 09:16:32,320 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1230_true-unreach-call.c [2019-01-12 09:16:32,330 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 09:16:32,338 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 09:16:32,356 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 09:16:32,388 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 09:16:32,389 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 09:16:32,389 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 09:16:32,389 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 09:16:32,390 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 09:16:32,390 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 09:16:32,391 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 09:16:32,391 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 09:16:32,391 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 09:16:32,405 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2019-01-12 09:16:32,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-12 09:16:32,411 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:16:32,412 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:16:32,415 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:16:32,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:16:32,421 INFO L82 PathProgramCache]: Analyzing trace with hash -958093107, now seen corresponding path program 1 times [2019-01-12 09:16:32,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:16:32,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:16:32,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:16:32,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:16:32,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:16:32,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:16:32,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:16:32,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:16:32,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 09:16:32,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 09:16:32,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 09:16:32,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 09:16:32,564 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2019-01-12 09:16:32,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:16:32,580 INFO L93 Difference]: Finished difference Result 54 states and 84 transitions. [2019-01-12 09:16:32,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 09:16:32,581 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-01-12 09:16:32,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:16:32,592 INFO L225 Difference]: With dead ends: 54 [2019-01-12 09:16:32,592 INFO L226 Difference]: Without dead ends: 25 [2019-01-12 09:16:32,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 09:16:32,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-12 09:16:32,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-01-12 09:16:32,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-12 09:16:32,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2019-01-12 09:16:32,627 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 35 transitions. Word has length 10 [2019-01-12 09:16:32,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:16:32,627 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 35 transitions. [2019-01-12 09:16:32,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 09:16:32,627 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2019-01-12 09:16:32,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-12 09:16:32,628 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:16:32,628 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:16:32,628 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:16:32,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:16:32,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1001566992, now seen corresponding path program 1 times [2019-01-12 09:16:32,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:16:32,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:16:32,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:16:32,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:16:32,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:16:32,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:16:32,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:16:32,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:16:32,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:16:32,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:16:32,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:16:32,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:16:32,774 INFO L87 Difference]: Start difference. First operand 25 states and 35 transitions. Second operand 4 states. [2019-01-12 09:16:32,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:16:32,903 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2019-01-12 09:16:32,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:16:32,904 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-01-12 09:16:32,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:16:32,905 INFO L225 Difference]: With dead ends: 41 [2019-01-12 09:16:32,905 INFO L226 Difference]: Without dead ends: 36 [2019-01-12 09:16:32,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:16:32,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-12 09:16:32,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2019-01-12 09:16:32,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-12 09:16:32,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2019-01-12 09:16:32,914 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 11 [2019-01-12 09:16:32,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:16:32,915 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2019-01-12 09:16:32,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:16:32,915 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2019-01-12 09:16:32,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-12 09:16:32,916 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:16:32,916 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:16:32,916 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:16:32,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:16:32,917 INFO L82 PathProgramCache]: Analyzing trace with hash -555778251, now seen corresponding path program 1 times [2019-01-12 09:16:32,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:16:32,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:16:32,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:16:32,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:16:32,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:16:32,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:16:33,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:16:33,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:16:33,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:16:33,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:16:33,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:16:33,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:16:33,039 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 4 states. [2019-01-12 09:16:33,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:16:33,182 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2019-01-12 09:16:33,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:16:33,183 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-01-12 09:16:33,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:16:33,184 INFO L225 Difference]: With dead ends: 43 [2019-01-12 09:16:33,184 INFO L226 Difference]: Without dead ends: 38 [2019-01-12 09:16:33,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:16:33,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-12 09:16:33,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 27. [2019-01-12 09:16:33,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-12 09:16:33,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2019-01-12 09:16:33,194 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 14 [2019-01-12 09:16:33,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:16:33,196 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2019-01-12 09:16:33,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:16:33,196 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2019-01-12 09:16:33,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-12 09:16:33,197 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:16:33,197 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:16:33,199 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:16:33,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:16:33,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1219229111, now seen corresponding path program 1 times [2019-01-12 09:16:33,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:16:33,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:16:33,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:16:33,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:16:33,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:16:33,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 09:16:33,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 09:16:33,299 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 09:16:33,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 09:16:33 BoogieIcfgContainer [2019-01-12 09:16:33,329 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 09:16:33,329 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 09:16:33,329 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 09:16:33,330 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 09:16:33,330 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:16:32" (3/4) ... [2019-01-12 09:16:33,334 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-12 09:16:33,334 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 09:16:33,335 INFO L168 Benchmark]: Toolchain (without parser) took 2237.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -110.7 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2019-01-12 09:16:33,337 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:16:33,337 INFO L168 Benchmark]: CACSL2BoogieTranslator took 356.14 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-12 09:16:33,338 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.97 ms. Allocated memory is still 1.0 GB. Free memory was 937.9 MB in the beginning and 932.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-12 09:16:33,339 INFO L168 Benchmark]: Boogie Preprocessor took 119.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -191.2 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. [2019-01-12 09:16:33,340 INFO L168 Benchmark]: RCFGBuilder took 669.96 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: 24.4 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. [2019-01-12 09:16:33,341 INFO L168 Benchmark]: TraceAbstraction took 1016.70 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: 40.0 MB). Peak memory consumption was 40.0 MB. Max. memory is 11.5 GB. [2019-01-12 09:16:33,342 INFO L168 Benchmark]: Witness Printer took 4.79 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:16:33,347 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 356.14 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 64.97 ms. Allocated memory is still 1.0 GB. Free memory was 937.9 MB in the beginning and 932.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 119.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -191.2 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 669.96 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: 24.4 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1016.70 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: 40.0 MB). Peak memory consumption was 40.0 MB. Max. memory is 11.5 GB. * Witness Printer took 4.79 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 59]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 44, overapproximation of someBinaryArithmeticFLOAToperation at line 54. Possible FailurePath: [L54] float x = 0.0f / 0.0f; [L55] float y = 0.0f / 0.0f; [L12] __uint32_t w; [L15] ieee_float_shape_type gf_u; [L16] gf_u.value = (x) [L17] EXPR gf_u.word [L17] (w) = gf_u.word [L20] COND FALSE !(w == 0x00000000 || w == 0x80000000) [L22-L23] COND FALSE !((w >= 0x00800000 && w <= 0x7f7fffff) || (w >= 0x80800000 && w <= 0xff7fffff)) [L25-L26] COND FALSE !((w >= 0x00000001 && w <= 0x007fffff) || (w >= 0x80000001 && w <= 0x807fffff)) [L28] COND FALSE !(w == 0x7f800000 || w == 0xff800000) [L31] return 0; [L35] COND TRUE __fpclassify_float(x) == 0 [L36] return y; [L56] float res = fmin_float(x, y); [L44] return x != x; [L58] COND TRUE !isnan_float(res) [L59] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 28 locations, 1 error locations. UNSAFE Result, 0.9s OverallTime, 4 OverallIterations, 1 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 110 SDtfs, 22 SDslu, 110 SDs, 0 SdLazy, 30 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 20 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 49 NumberOfCodeBlocks, 49 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 32 ConstructedInterpolants, 0 QuantifiedInterpolants, 442 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-0ed9222-m [2019-01-12 09:16:35,780 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 09:16:35,782 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 09:16:35,795 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 09:16:35,795 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 09:16:35,796 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 09:16:35,798 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 09:16:35,800 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 09:16:35,801 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 09:16:35,802 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 09:16:35,803 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 09:16:35,804 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 09:16:35,804 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 09:16:35,805 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 09:16:35,807 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 09:16:35,807 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 09:16:35,808 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 09:16:35,810 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 09:16:35,812 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 09:16:35,813 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 09:16:35,815 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 09:16:35,817 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 09:16:35,821 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 09:16:35,821 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 09:16:35,822 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 09:16:35,825 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 09:16:35,827 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 09:16:35,828 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 09:16:35,830 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 09:16:35,831 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 09:16:35,831 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 09:16:35,834 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 09:16:35,834 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 09:16:35,835 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 09:16:35,836 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 09:16:35,837 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 09:16:35,837 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-01-12 09:16:35,864 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 09:16:35,864 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 09:16:35,865 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 09:16:35,866 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 09:16:35,867 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 09:16:35,867 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 09:16:35,867 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 09:16:35,867 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 09:16:35,867 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 09:16:35,868 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 09:16:35,868 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 09:16:35,868 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 09:16:35,868 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2019-01-12 09:16:35,869 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-01-12 09:16:35,869 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 09:16:35,869 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 09:16:35,869 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 09:16:35,869 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 09:16:35,869 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 09:16:35,870 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 09:16:35,870 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 09:16:35,870 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 09:16:35,870 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 09:16:35,870 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 09:16:35,870 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 09:16:35,871 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 09:16:35,872 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2019-01-12 09:16:35,872 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 09:16:35,872 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-01-12 09:16:35,873 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2019-01-12 09:16:35,873 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /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 -> 31da98a788dd1938c78053bade42bc512d4e8954 [2019-01-12 09:16:35,921 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 09:16:35,933 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 09:16:35,937 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 09:16:35,941 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 09:16:35,941 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 09:16:35,942 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/float_req_bl_1230_true-unreach-call.c [2019-01-12 09:16:36,003 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f4061784/16f6a63f82c44488851e688029aa7f6c/FLAG2f5030c16 [2019-01-12 09:16:36,471 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 09:16:36,471 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/float_req_bl_1230_true-unreach-call.c [2019-01-12 09:16:36,478 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f4061784/16f6a63f82c44488851e688029aa7f6c/FLAG2f5030c16 [2019-01-12 09:16:36,819 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f4061784/16f6a63f82c44488851e688029aa7f6c [2019-01-12 09:16:36,822 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 09:16:36,824 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 09:16:36,825 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 09:16:36,825 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 09:16:36,829 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 09:16:36,830 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:16:36" (1/1) ... [2019-01-12 09:16:36,832 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a06803e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:36, skipping insertion in model container [2019-01-12 09:16:36,832 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:16:36" (1/1) ... [2019-01-12 09:16:36,840 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 09:16:36,866 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 09:16:37,131 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:16:37,143 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 09:16:37,169 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:16:37,196 INFO L195 MainTranslator]: Completed translation [2019-01-12 09:16:37,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:37 WrapperNode [2019-01-12 09:16:37,197 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 09:16:37,198 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 09:16:37,198 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 09:16:37,198 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 09:16:37,205 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:37" (1/1) ... [2019-01-12 09:16:37,216 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:37" (1/1) ... [2019-01-12 09:16:37,240 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 09:16:37,241 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 09:16:37,241 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 09:16:37,241 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 09:16:37,248 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:37" (1/1) ... [2019-01-12 09:16:37,248 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:37" (1/1) ... [2019-01-12 09:16:37,252 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:37" (1/1) ... [2019-01-12 09:16:37,253 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:37" (1/1) ... [2019-01-12 09:16:37,340 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:37" (1/1) ... [2019-01-12 09:16:37,351 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:37" (1/1) ... [2019-01-12 09:16:37,356 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:37" (1/1) ... [2019-01-12 09:16:37,367 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 09:16:37,371 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 09:16:37,371 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 09:16:37,372 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 09:16:37,373 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:37" (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 [2019-01-12 09:16:37,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 09:16:37,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-01-12 09:16:37,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 09:16:37,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 09:16:37,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2019-01-12 09:16:37,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 09:16:37,659 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:16:37,953 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:16:38,010 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 09:16:38,011 INFO L286 CfgBuilder]: Removed 16 assue(true) statements. [2019-01-12 09:16:38,012 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:16:38 BoogieIcfgContainer [2019-01-12 09:16:38,013 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 09:16:38,014 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 09:16:38,014 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 09:16:38,017 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 09:16:38,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 09:16:36" (1/3) ... [2019-01-12 09:16:38,019 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75fc84df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:16:38, skipping insertion in model container [2019-01-12 09:16:38,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:37" (2/3) ... [2019-01-12 09:16:38,019 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75fc84df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:16:38, skipping insertion in model container [2019-01-12 09:16:38,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:16:38" (3/3) ... [2019-01-12 09:16:38,022 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1230_true-unreach-call.c [2019-01-12 09:16:38,031 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 09:16:38,037 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 09:16:38,052 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 09:16:38,083 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 09:16:38,084 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 09:16:38,084 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 09:16:38,085 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 09:16:38,085 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 09:16:38,085 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 09:16:38,086 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 09:16:38,086 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 09:16:38,086 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 09:16:38,102 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2019-01-12 09:16:38,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-12 09:16:38,109 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:16:38,110 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:16:38,113 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:16:38,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:16:38,118 INFO L82 PathProgramCache]: Analyzing trace with hash -958093107, now seen corresponding path program 1 times [2019-01-12 09:16:38,121 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:16:38,122 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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 [2019-01-12 09:16:38,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:16:38,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:16:38,185 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:16:38,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:16:38,198 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:16:38,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:16:38,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 09:16:38,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 09:16:38,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 09:16:38,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 09:16:38,229 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2019-01-12 09:16:38,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:16:38,248 INFO L93 Difference]: Finished difference Result 54 states and 84 transitions. [2019-01-12 09:16:38,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 09:16:38,250 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-01-12 09:16:38,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:16:38,260 INFO L225 Difference]: With dead ends: 54 [2019-01-12 09:16:38,260 INFO L226 Difference]: Without dead ends: 25 [2019-01-12 09:16:38,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 09:16:38,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-12 09:16:38,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-01-12 09:16:38,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-12 09:16:38,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2019-01-12 09:16:38,294 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 35 transitions. Word has length 10 [2019-01-12 09:16:38,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:16:38,295 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 35 transitions. [2019-01-12 09:16:38,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 09:16:38,295 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2019-01-12 09:16:38,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-12 09:16:38,296 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:16:38,296 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:16:38,296 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:16:38,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:16:38,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1001566992, now seen corresponding path program 1 times [2019-01-12 09:16:38,297 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:16:38,298 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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 [2019-01-12 09:16:38,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:16:38,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:16:38,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:16:38,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:16:38,419 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:16:38,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:16:38,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:16:38,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:16:38,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:16:38,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:16:38,432 INFO L87 Difference]: Start difference. First operand 25 states and 35 transitions. Second operand 4 states. [2019-01-12 09:16:38,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:16:38,646 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2019-01-12 09:16:38,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:16:38,647 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-01-12 09:16:38,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:16:38,649 INFO L225 Difference]: With dead ends: 41 [2019-01-12 09:16:38,649 INFO L226 Difference]: Without dead ends: 36 [2019-01-12 09:16:38,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:16:38,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-12 09:16:38,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2019-01-12 09:16:38,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-12 09:16:38,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2019-01-12 09:16:38,658 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 11 [2019-01-12 09:16:38,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:16:38,659 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2019-01-12 09:16:38,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:16:38,659 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2019-01-12 09:16:38,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-12 09:16:38,660 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:16:38,660 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:16:38,660 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:16:38,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:16:38,661 INFO L82 PathProgramCache]: Analyzing trace with hash 502183504, now seen corresponding path program 1 times [2019-01-12 09:16:38,661 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:16:38,661 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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 [2019-01-12 09:16:38,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:16:38,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:16:38,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:16:38,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:16:38,821 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:16:38,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:16:38,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:16:38,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:16:38,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:16:38,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:16:38,833 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 4 states. [2019-01-12 09:16:38,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:16:38,955 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2019-01-12 09:16:38,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:16:38,956 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-01-12 09:16:38,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:16:38,957 INFO L225 Difference]: With dead ends: 43 [2019-01-12 09:16:38,957 INFO L226 Difference]: Without dead ends: 38 [2019-01-12 09:16:38,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:16:38,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-12 09:16:38,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 27. [2019-01-12 09:16:38,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-12 09:16:38,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2019-01-12 09:16:38,964 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 12 [2019-01-12 09:16:38,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:16:38,964 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2019-01-12 09:16:38,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:16:38,965 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2019-01-12 09:16:38,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-12 09:16:38,965 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:16:38,966 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:16:38,966 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:16:38,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:16:38,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1951251627, now seen corresponding path program 1 times [2019-01-12 09:16:38,967 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:16:38,967 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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 [2019-01-12 09:16:38,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:16:39,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:16:39,020 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:16:39,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:16:39,036 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:16:39,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:16:39,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:16:39,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:16:39,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:16:39,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:16:39,049 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 4 states. [2019-01-12 09:16:39,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:16:39,417 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2019-01-12 09:16:39,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:16:39,419 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-01-12 09:16:39,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:16:39,420 INFO L225 Difference]: With dead ends: 43 [2019-01-12 09:16:39,420 INFO L226 Difference]: Without dead ends: 38 [2019-01-12 09:16:39,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:16:39,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-12 09:16:39,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 27. [2019-01-12 09:16:39,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-12 09:16:39,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2019-01-12 09:16:39,433 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 13 [2019-01-12 09:16:39,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:16:39,434 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2019-01-12 09:16:39,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:16:39,436 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2019-01-12 09:16:39,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-12 09:16:39,436 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:16:39,436 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:16:39,437 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:16:39,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:16:39,437 INFO L82 PathProgramCache]: Analyzing trace with hash -555778251, now seen corresponding path program 1 times [2019-01-12 09:16:39,438 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:16:39,438 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-01-12 09:16:39,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:16:39,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:16:39,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:16:39,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:16:39,510 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:16:39,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:16:39,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:16:39,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:16:39,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:16:39,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:16:39,521 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 4 states. [2019-01-12 09:16:39,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:16:39,656 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2019-01-12 09:16:39,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:16:39,657 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-01-12 09:16:39,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:16:39,658 INFO L225 Difference]: With dead ends: 43 [2019-01-12 09:16:39,658 INFO L226 Difference]: Without dead ends: 38 [2019-01-12 09:16:39,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:16:39,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-12 09:16:39,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 27. [2019-01-12 09:16:39,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-12 09:16:39,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2019-01-12 09:16:39,667 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 14 [2019-01-12 09:16:39,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:16:39,667 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2019-01-12 09:16:39,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:16:39,667 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2019-01-12 09:16:39,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-12 09:16:39,668 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:16:39,668 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:16:39,669 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:16:39,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:16:39,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1219229111, now seen corresponding path program 1 times [2019-01-12 09:16:39,669 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:16:39,669 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-01-12 09:16:39,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:16:39,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:16:39,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:16:39,884 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 5 [2019-01-12 09:16:39,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:16:39,928 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:16:39,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:16:39,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 09:16:39,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 09:16:39,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 09:16:39,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 09:16:39,940 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 6 states. [2019-01-12 09:16:40,282 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-12 09:16:40,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:16:40,393 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2019-01-12 09:16:40,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 09:16:40,395 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-01-12 09:16:40,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:16:40,396 INFO L225 Difference]: With dead ends: 36 [2019-01-12 09:16:40,396 INFO L226 Difference]: Without dead ends: 27 [2019-01-12 09:16:40,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 09:16:40,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-12 09:16:40,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2019-01-12 09:16:40,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-12 09:16:40,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2019-01-12 09:16:40,403 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 14 [2019-01-12 09:16:40,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:16:40,403 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-01-12 09:16:40,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 09:16:40,403 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2019-01-12 09:16:40,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-12 09:16:40,405 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:16:40,405 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:16:40,405 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:16:40,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:16:40,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1012428811, now seen corresponding path program 1 times [2019-01-12 09:16:40,406 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:16:40,406 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-01-12 09:16:40,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:16:40,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:16:40,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:16:40,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:16:40,474 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:16:40,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:16:40,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:16:40,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:16:40,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:16:40,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:16:40,486 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand 4 states. [2019-01-12 09:16:40,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:16:40,626 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2019-01-12 09:16:40,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:16:40,627 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-01-12 09:16:40,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:16:40,627 INFO L225 Difference]: With dead ends: 41 [2019-01-12 09:16:40,628 INFO L226 Difference]: Without dead ends: 36 [2019-01-12 09:16:40,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:16:40,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-12 09:16:40,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2019-01-12 09:16:40,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-12 09:16:40,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2019-01-12 09:16:40,634 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 16 [2019-01-12 09:16:40,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:16:40,634 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-01-12 09:16:40,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:16:40,634 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2019-01-12 09:16:40,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-12 09:16:40,635 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:16:40,635 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:16:40,636 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:16:40,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:16:40,636 INFO L82 PathProgramCache]: Analyzing trace with hash 874917212, now seen corresponding path program 1 times [2019-01-12 09:16:40,636 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:16:40,636 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-01-12 09:16:40,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:16:40,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:16:40,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:16:40,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:16:40,710 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:16:40,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:16:40,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:16:40,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:16:40,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:16:40,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:16:40,725 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 4 states. [2019-01-12 09:16:40,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:16:40,818 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2019-01-12 09:16:40,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:16:40,819 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-01-12 09:16:40,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:16:40,822 INFO L225 Difference]: With dead ends: 43 [2019-01-12 09:16:40,822 INFO L226 Difference]: Without dead ends: 38 [2019-01-12 09:16:40,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:16:40,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-12 09:16:40,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 27. [2019-01-12 09:16:40,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-12 09:16:40,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2019-01-12 09:16:40,828 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 17 [2019-01-12 09:16:40,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:16:40,828 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-01-12 09:16:40,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:16:40,829 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2019-01-12 09:16:40,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-12 09:16:40,829 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:16:40,829 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:16:40,831 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:16:40,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:16:40,832 INFO L82 PathProgramCache]: Analyzing trace with hash -356841937, now seen corresponding path program 1 times [2019-01-12 09:16:40,832 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:16:40,832 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-01-12 09:16:40,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:16:40,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:16:40,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:16:40,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:16:40,992 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:16:41,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:16:41,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 09:16:41,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 09:16:41,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 09:16:41,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-12 09:16:41,003 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 7 states. [2019-01-12 09:16:41,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:16:41,169 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2019-01-12 09:16:41,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 09:16:41,170 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-01-12 09:16:41,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:16:41,172 INFO L225 Difference]: With dead ends: 32 [2019-01-12 09:16:41,172 INFO L226 Difference]: Without dead ends: 23 [2019-01-12 09:16:41,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-01-12 09:16:41,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-12 09:16:41,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-01-12 09:16:41,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-12 09:16:41,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2019-01-12 09:16:41,178 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 18 [2019-01-12 09:16:41,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:16:41,179 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2019-01-12 09:16:41,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 09:16:41,179 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2019-01-12 09:16:41,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-12 09:16:41,180 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:16:41,181 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:16:41,181 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:16:41,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:16:41,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1049576048, now seen corresponding path program 1 times [2019-01-12 09:16:41,182 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:16:41,182 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-01-12 09:16:41,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:16:41,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:16:41,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:16:41,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:16:41,239 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:16:41,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:16:41,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:16:41,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:16:41,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:16:41,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:16:41,252 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand 4 states. [2019-01-12 09:16:41,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:16:41,347 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2019-01-12 09:16:41,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:16:41,350 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-01-12 09:16:41,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:16:41,350 INFO L225 Difference]: With dead ends: 32 [2019-01-12 09:16:41,351 INFO L226 Difference]: Without dead ends: 25 [2019-01-12 09:16:41,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:16:41,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-12 09:16:41,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2019-01-12 09:16:41,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-12 09:16:41,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2019-01-12 09:16:41,356 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 18 [2019-01-12 09:16:41,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:16:41,356 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-01-12 09:16:41,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:16:41,357 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2019-01-12 09:16:41,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-12 09:16:41,357 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:16:41,358 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:16:41,358 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:16:41,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:16:41,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1983383519, now seen corresponding path program 1 times [2019-01-12 09:16:41,359 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:16:41,359 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2019-01-12 09:16:41,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:16:41,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:16:41,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:16:41,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:16:41,423 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:16:41,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:16:41,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:16:41,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:16:41,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:16:41,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:16:41,442 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 4 states. [2019-01-12 09:16:41,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:16:41,544 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2019-01-12 09:16:41,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:16:41,546 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-01-12 09:16:41,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:16:41,547 INFO L225 Difference]: With dead ends: 32 [2019-01-12 09:16:41,547 INFO L226 Difference]: Without dead ends: 25 [2019-01-12 09:16:41,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:16:41,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-12 09:16:41,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2019-01-12 09:16:41,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-12 09:16:41,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2019-01-12 09:16:41,552 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 19 [2019-01-12 09:16:41,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:16:41,552 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2019-01-12 09:16:41,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:16:41,553 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2019-01-12 09:16:41,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-12 09:16:41,553 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:16:41,553 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:16:41,554 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:16:41,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:16:41,554 INFO L82 PathProgramCache]: Analyzing trace with hash -208376157, now seen corresponding path program 1 times [2019-01-12 09:16:41,554 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:16:41,555 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-01-12 09:16:41,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:16:41,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:16:41,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:16:41,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:16:41,677 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:16:41,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:16:41,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 09:16:41,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 09:16:41,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 09:16:41,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 09:16:41,693 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 6 states. [2019-01-12 09:16:41,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:16:41,793 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2019-01-12 09:16:41,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 09:16:41,794 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-01-12 09:16:41,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:16:41,794 INFO L225 Difference]: With dead ends: 23 [2019-01-12 09:16:41,795 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 09:16:41,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 09:16:41,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 09:16:41,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 09:16:41,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 09:16:41,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 09:16:41,797 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2019-01-12 09:16:41,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:16:41,797 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 09:16:41,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 09:16:41,797 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 09:16:41,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 09:16:41,802 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 09:16:42,108 INFO L444 ceAbstractionStarter]: At program point L31(lines 11 32) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 8 24) (_ +zero 8 24)))) (and (= ULTIMATE.start_fmin_float_~x .cse0) (= ULTIMATE.start_fmin_float_~y .cse0))) [2019-01-12 09:16:42,108 INFO L444 ceAbstractionStarter]: At program point L31-1(lines 11 32) the Hoare annotation is: (let ((.cse1 (fp.div roundNearestTiesToEven (_ +zero 8 24) (_ +zero 8 24)))) (let ((.cse0 (= ULTIMATE.start_fmin_float_~y .cse1))) (or (and (or (= (bvadd |ULTIMATE.start___fpclassify_float_#res| (_ bv4294967292 32)) (_ bv0 32)) (= (bvadd |ULTIMATE.start___fpclassify_float_#res| (_ bv4294967294 32)) (_ bv0 32))) .cse0) (and (= ULTIMATE.start_fmin_float_~x .cse1) .cse0) (and (= (bvadd |ULTIMATE.start___fpclassify_float_#res| (_ bv4294967295 32)) (_ bv0 32)) .cse0) (and (= (bvadd |ULTIMATE.start___fpclassify_float_#res| (_ bv4294967293 32)) (_ bv0 32)) .cse0)))) [2019-01-12 09:16:42,108 INFO L444 ceAbstractionStarter]: At program point L44(line 44) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 8 24) (_ +zero 8 24)))) (and (= (bvadd |ULTIMATE.start_isnan_float_#res| (_ bv4294967295 32)) (_ bv0 32)) (= |ULTIMATE.start_fmin_float_#res| .cse0) (= ULTIMATE.start_fmin_float_~y .cse0))) [2019-01-12 09:16:42,108 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-01-12 09:16:42,109 INFO L448 ceAbstractionStarter]: For program point L40-2(line 40) no Hoare annotation was computed. [2019-01-12 09:16:42,110 INFO L444 ceAbstractionStarter]: At program point L40-3(lines 34 41) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 8 24) (_ +zero 8 24)))) (and (= |ULTIMATE.start_fmin_float_#res| .cse0) (= ULTIMATE.start_fmin_float_~y .cse0))) [2019-01-12 09:16:42,110 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 09:16:42,110 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 09:16:42,110 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 09:16:42,110 INFO L448 ceAbstractionStarter]: For program point L28(lines 28 31) no Hoare annotation was computed. [2019-01-12 09:16:42,110 INFO L448 ceAbstractionStarter]: For program point L28-1(lines 28 31) no Hoare annotation was computed. [2019-01-12 09:16:42,110 INFO L448 ceAbstractionStarter]: For program point L37(lines 37 38) no Hoare annotation was computed. [2019-01-12 09:16:42,111 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 09:16:42,112 INFO L448 ceAbstractionStarter]: For program point L58(lines 58 61) no Hoare annotation was computed. [2019-01-12 09:16:42,112 INFO L448 ceAbstractionStarter]: For program point L25(lines 25 31) no Hoare annotation was computed. [2019-01-12 09:16:42,112 INFO L448 ceAbstractionStarter]: For program point L25-1(lines 25 31) no Hoare annotation was computed. [2019-01-12 09:16:42,112 INFO L451 ceAbstractionStarter]: At program point L63(lines 46 64) the Hoare annotation is: true [2019-01-12 09:16:42,112 INFO L448 ceAbstractionStarter]: For program point L59(line 59) no Hoare annotation was computed. [2019-01-12 09:16:42,112 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 59) no Hoare annotation was computed. [2019-01-12 09:16:42,113 INFO L448 ceAbstractionStarter]: For program point L22(lines 22 31) no Hoare annotation was computed. [2019-01-12 09:16:42,113 INFO L448 ceAbstractionStarter]: For program point L22-1(lines 22 31) no Hoare annotation was computed. [2019-01-12 09:16:42,113 INFO L448 ceAbstractionStarter]: For program point L14-1(lines 14 18) no Hoare annotation was computed. [2019-01-12 09:16:42,113 INFO L444 ceAbstractionStarter]: At program point L14-2(lines 14 18) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 8 24) (_ +zero 8 24)))) (and (= ULTIMATE.start_fmin_float_~x .cse0) (= ULTIMATE.start_fmin_float_~y .cse0))) [2019-01-12 09:16:42,113 INFO L448 ceAbstractionStarter]: For program point L14-3(lines 11 32) no Hoare annotation was computed. [2019-01-12 09:16:42,113 INFO L448 ceAbstractionStarter]: For program point L14-5(lines 14 18) no Hoare annotation was computed. [2019-01-12 09:16:42,113 INFO L444 ceAbstractionStarter]: At program point L14-6(lines 14 18) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 8 24) (_ +zero 8 24)))) (and (= ULTIMATE.start_fmin_float_~x .cse0) (= ULTIMATE.start_fmin_float_~y .cse0))) [2019-01-12 09:16:42,114 INFO L448 ceAbstractionStarter]: For program point L14-7(lines 11 32) no Hoare annotation was computed. [2019-01-12 09:16:42,114 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 36) no Hoare annotation was computed. [2019-01-12 09:16:42,121 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:16:42,122 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:16:42,125 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:16:42,125 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:16:42,126 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:16:42,126 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:16:42,127 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:16:42,127 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:16:42,128 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:16:42,128 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:16:42,128 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:16:42,128 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:16:42,129 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:16:42,129 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:16:42,129 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:16:42,130 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:16:42,130 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:16:42,130 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:16:42,131 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:16:42,131 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:16:42,132 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:16:42,132 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:16:42,132 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:16:42,133 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:16:42,133 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:16:42,133 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:16:42,134 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:16:42,134 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:16:42,134 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:16:42,134 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:16:42,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 09:16:42 BoogieIcfgContainer [2019-01-12 09:16:42,137 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 09:16:42,137 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 09:16:42,137 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 09:16:42,137 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 09:16:42,138 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:16:38" (3/4) ... [2019-01-12 09:16:42,142 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 09:16:42,154 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2019-01-12 09:16:42,154 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-01-12 09:16:42,155 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-12 09:16:42,185 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \result == ~fp.div~FLOAT(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && y == ~fp.div~FLOAT(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) [2019-01-12 09:16:42,186 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (~bvadd64(\result, 4294967295bv32) == 0bv32 && \result == ~fp.div~FLOAT(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && y == ~fp.div~FLOAT(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) [2019-01-12 09:16:42,186 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((~bvadd64(\result, 4294967292bv32) == 0bv32 || ~bvadd64(\result, 4294967294bv32) == 0bv32) && y == ~fp.div~FLOAT(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) || (x == ~fp.div~FLOAT(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && y == ~fp.div~FLOAT(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()))) || (~bvadd64(\result, 4294967295bv32) == 0bv32 && y == ~fp.div~FLOAT(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()))) || (~bvadd64(\result, 4294967293bv32) == 0bv32 && y == ~fp.div~FLOAT(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) [2019-01-12 09:16:42,223 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 09:16:42,223 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 09:16:42,224 INFO L168 Benchmark]: Toolchain (without parser) took 5400.79 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 65.0 MB). Free memory was 951.4 MB in the beginning and 766.4 MB in the end (delta: 184.9 MB). Peak memory consumption was 249.9 MB. Max. memory is 11.5 GB. [2019-01-12 09:16:42,225 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:16:42,226 INFO L168 Benchmark]: CACSL2BoogieTranslator took 371.96 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-12 09:16:42,226 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.65 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-12 09:16:42,227 INFO L168 Benchmark]: Boogie Preprocessor took 130.18 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 65.0 MB). Free memory was 935.3 MB in the beginning and 1.0 GB in the end (delta: -110.1 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. [2019-01-12 09:16:42,229 INFO L168 Benchmark]: RCFGBuilder took 641.69 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2019-01-12 09:16:42,230 INFO L168 Benchmark]: TraceAbstraction took 4123.18 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 773.5 MB in the end (delta: 252.1 MB). Peak memory consumption was 252.1 MB. Max. memory is 11.5 GB. [2019-01-12 09:16:42,230 INFO L168 Benchmark]: Witness Printer took 86.01 ms. Allocated memory is still 1.1 GB. Free memory was 773.5 MB in the beginning and 766.4 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-01-12 09:16:42,235 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 371.96 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.65 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 130.18 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 65.0 MB). Free memory was 935.3 MB in the beginning and 1.0 GB in the end (delta: -110.1 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 641.69 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4123.18 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 773.5 MB in the end (delta: 252.1 MB). Peak memory consumption was 252.1 MB. Max. memory is 11.5 GB. * Witness Printer took 86.01 ms. Allocated memory is still 1.1 GB. Free memory was 773.5 MB in the beginning and 766.4 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 59]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 11]: Loop Invariant [2019-01-12 09:16:42,249 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:16:42,249 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:16:42,250 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:16:42,250 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: x == ~fp.div~FLOAT(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && y == ~fp.div~FLOAT(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 34]: Loop Invariant [2019-01-12 09:16:42,250 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:16:42,250 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:16:42,254 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:16:42,254 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: \result == ~fp.div~FLOAT(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && y == ~fp.div~FLOAT(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 44]: Loop Invariant [2019-01-12 09:16:42,254 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:16:42,255 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:16:42,255 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:16:42,255 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (~bvadd64(\result, 4294967295bv32) == 0bv32 && \result == ~fp.div~FLOAT(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && y == ~fp.div~FLOAT(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 14]: Loop Invariant [2019-01-12 09:16:42,256 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:16:42,256 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:16:42,256 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:16:42,256 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: x == ~fp.div~FLOAT(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && y == ~fp.div~FLOAT(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 14]: Loop Invariant [2019-01-12 09:16:42,257 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:16:42,257 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:16:42,257 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:16:42,257 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: x == ~fp.div~FLOAT(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && y == ~fp.div~FLOAT(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 11]: Loop Invariant [2019-01-12 09:16:42,258 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:16:42,258 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:16:42,258 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:16:42,258 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:16:42,258 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:16:42,262 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:16:42,263 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:16:42,263 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:16:42,263 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:16:42,263 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((((~bvadd64(\result, 4294967292bv32) == 0bv32 || ~bvadd64(\result, 4294967294bv32) == 0bv32) && y == ~fp.div~FLOAT(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) || (x == ~fp.div~FLOAT(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && y == ~fp.div~FLOAT(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()))) || (~bvadd64(\result, 4294967295bv32) == 0bv32 && y == ~fp.div~FLOAT(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()))) || (~bvadd64(\result, 4294967293bv32) == 0bv32 && y == ~fp.div~FLOAT(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 28 locations, 1 error locations. SAFE Result, 4.0s OverallTime, 12 OverallIterations, 1 TraceHistogramMax, 2.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 413 SDtfs, 132 SDslu, 682 SDs, 0 SdLazy, 219 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 187 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 68 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 21 NumberOfFragments, 127 HoareAnnotationTreeSize, 7 FomulaSimplifications, 938 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 181 NumberOfCodeBlocks, 181 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 169 ConstructedInterpolants, 0 QuantifiedInterpolants, 6625 SizeOfPredicates, 32 NumberOfNonLiveVariables, 576 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...