./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/float-newlib/float_req_bl_1250_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa 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_1250_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 7aa9ac80ed7bb9ce6b78459a496e265402ed9cc3 .................................................................................................................................................................................................................................................................................................................................................... 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_1250_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 7aa9ac80ed7bb9ce6b78459a496e265402ed9cc3 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 04:06:39,416 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 04:06:39,418 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 04:06:39,431 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 04:06:39,432 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 04:06:39,433 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 04:06:39,434 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 04:06:39,436 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 04:06:39,438 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 04:06:39,438 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 04:06:39,439 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 04:06:39,440 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 04:06:39,441 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 04:06:39,442 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 04:06:39,445 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 04:06:39,446 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 04:06:39,450 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 04:06:39,452 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 04:06:39,458 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 04:06:39,460 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 04:06:39,461 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 04:06:39,464 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 04:06:39,468 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 04:06:39,470 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 04:06:39,470 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 04:06:39,471 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 04:06:39,472 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 04:06:39,473 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 04:06:39,477 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 04:06:39,480 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 04:06:39,480 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 04:06:39,481 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 04:06:39,481 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 04:06:39,481 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 04:06:39,482 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 04:06:39,486 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 04:06:39,488 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 04:06:39,521 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 04:06:39,522 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 04:06:39,523 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 04:06:39,524 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 04:06:39,524 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 04:06:39,524 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 04:06:39,524 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 04:06:39,524 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 04:06:39,524 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 04:06:39,526 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 04:06:39,526 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 04:06:39,527 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 04:06:39,527 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 04:06:39,527 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 04:06:39,527 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 04:06:39,528 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 04:06:39,528 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 04:06:39,528 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 04:06:39,529 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 04:06:39,529 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 04:06:39,529 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 04:06:39,529 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 04:06:39,529 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 04:06:39,532 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 04:06:39,532 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 04:06:39,532 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 04:06:39,533 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 04:06:39,533 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 04:06:39,533 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 -> 7aa9ac80ed7bb9ce6b78459a496e265402ed9cc3 [2018-12-31 04:06:39,593 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 04:06:39,607 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 04:06:39,611 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 04:06:39,613 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 04:06:39,613 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 04:06:39,614 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/float_req_bl_1250_true-unreach-call.c [2018-12-31 04:06:39,679 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cac0be956/92cf34dd33fa4f5283182b7980b3be0e/FLAG695d3626e [2018-12-31 04:06:40,208 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 04:06:40,209 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/float_req_bl_1250_true-unreach-call.c [2018-12-31 04:06:40,217 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cac0be956/92cf34dd33fa4f5283182b7980b3be0e/FLAG695d3626e [2018-12-31 04:06:40,561 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cac0be956/92cf34dd33fa4f5283182b7980b3be0e [2018-12-31 04:06:40,565 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 04:06:40,567 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 04:06:40,568 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 04:06:40,568 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 04:06:40,572 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 04:06:40,573 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 04:06:40" (1/1) ... [2018-12-31 04:06:40,577 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a490510 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:40, skipping insertion in model container [2018-12-31 04:06:40,577 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 04:06:40" (1/1) ... [2018-12-31 04:06:40,587 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 04:06:40,608 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 04:06:40,877 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 04:06:40,883 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 04:06:40,923 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 04:06:40,950 INFO L195 MainTranslator]: Completed translation [2018-12-31 04:06:40,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:40 WrapperNode [2018-12-31 04:06:40,951 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 04:06:40,952 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 04:06:40,952 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 04:06:40,952 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 04:06:40,963 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:40" (1/1) ... [2018-12-31 04:06:40,974 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:40" (1/1) ... [2018-12-31 04:06:41,014 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 04:06:41,014 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 04:06:41,015 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 04:06:41,015 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 04:06:41,100 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:40" (1/1) ... [2018-12-31 04:06:41,100 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:40" (1/1) ... [2018-12-31 04:06:41,111 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:40" (1/1) ... [2018-12-31 04:06:41,111 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:40" (1/1) ... [2018-12-31 04:06:41,129 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:40" (1/1) ... [2018-12-31 04:06:41,141 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:40" (1/1) ... [2018-12-31 04:06:41,147 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:40" (1/1) ... [2018-12-31 04:06:41,150 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 04:06:41,153 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 04:06:41,153 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 04:06:41,154 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 04:06:41,155 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:40" (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 [2018-12-31 04:06:41,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-12-31 04:06:41,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 04:06:41,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 04:06:41,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-31 04:06:41,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 04:06:41,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 04:06:41,877 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 04:06:41,877 INFO L280 CfgBuilder]: Removed 16 assue(true) statements. [2018-12-31 04:06:41,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 04:06:41 BoogieIcfgContainer [2018-12-31 04:06:41,878 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 04:06:41,879 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 04:06:41,879 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 04:06:41,882 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 04:06:41,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 04:06:40" (1/3) ... [2018-12-31 04:06:41,884 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62f8c56f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 04:06:41, skipping insertion in model container [2018-12-31 04:06:41,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:40" (2/3) ... [2018-12-31 04:06:41,884 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62f8c56f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 04:06:41, skipping insertion in model container [2018-12-31 04:06:41,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 04:06:41" (3/3) ... [2018-12-31 04:06:41,886 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1250_true-unreach-call.c [2018-12-31 04:06:41,897 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 04:06:41,906 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 04:06:41,926 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 04:06:41,960 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 04:06:41,960 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 04:06:41,961 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 04:06:41,961 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 04:06:41,962 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 04:06:41,962 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 04:06:41,962 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 04:06:41,962 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 04:06:41,962 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 04:06:41,980 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2018-12-31 04:06:41,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-31 04:06:41,987 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:06:41,988 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:06:41,991 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:06:41,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:06:41,997 INFO L82 PathProgramCache]: Analyzing trace with hash -958093107, now seen corresponding path program 1 times [2018-12-31 04:06:42,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:06:42,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:06:42,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:06:42,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:06:42,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:06:42,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:06:42,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:06:42,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:06:42,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 04:06:42,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 04:06:42,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 04:06:42,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 04:06:42,153 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2018-12-31 04:06:42,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:06:42,172 INFO L93 Difference]: Finished difference Result 54 states and 84 transitions. [2018-12-31 04:06:42,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 04:06:42,174 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-12-31 04:06:42,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:06:42,186 INFO L225 Difference]: With dead ends: 54 [2018-12-31 04:06:42,186 INFO L226 Difference]: Without dead ends: 25 [2018-12-31 04:06:42,190 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 [2018-12-31 04:06:42,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-31 04:06:42,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-31 04:06:42,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-31 04:06:42,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2018-12-31 04:06:42,230 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 35 transitions. Word has length 10 [2018-12-31 04:06:42,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:06:42,230 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 35 transitions. [2018-12-31 04:06:42,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 04:06:42,230 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2018-12-31 04:06:42,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-31 04:06:42,231 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:06:42,231 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:06:42,232 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:06:42,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:06:42,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1001566992, now seen corresponding path program 1 times [2018-12-31 04:06:42,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:06:42,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:06:42,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:06:42,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:06:42,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:06:42,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:06:42,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:06:42,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:06:42,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 04:06:42,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 04:06:42,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 04:06:42,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 04:06:42,354 INFO L87 Difference]: Start difference. First operand 25 states and 35 transitions. Second operand 4 states. [2018-12-31 04:06:42,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:06:42,558 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2018-12-31 04:06:42,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 04:06:42,560 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-12-31 04:06:42,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:06:42,561 INFO L225 Difference]: With dead ends: 41 [2018-12-31 04:06:42,561 INFO L226 Difference]: Without dead ends: 36 [2018-12-31 04:06:42,562 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 [2018-12-31 04:06:42,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-31 04:06:42,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2018-12-31 04:06:42,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-31 04:06:42,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2018-12-31 04:06:42,575 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 11 [2018-12-31 04:06:42,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:06:42,577 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2018-12-31 04:06:42,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 04:06:42,578 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2018-12-31 04:06:42,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-31 04:06:42,579 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:06:42,579 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:06:42,579 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:06:42,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:06:42,581 INFO L82 PathProgramCache]: Analyzing trace with hash -555778251, now seen corresponding path program 1 times [2018-12-31 04:06:42,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:06:42,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:06:42,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:06:42,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:06:42,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:06:42,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:06:42,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:06:42,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:06:42,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 04:06:42,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 04:06:42,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 04:06:42,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 04:06:42,724 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 4 states. [2018-12-31 04:06:42,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:06:42,837 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2018-12-31 04:06:42,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 04:06:42,838 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-12-31 04:06:42,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:06:42,840 INFO L225 Difference]: With dead ends: 43 [2018-12-31 04:06:42,840 INFO L226 Difference]: Without dead ends: 38 [2018-12-31 04:06:42,841 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 [2018-12-31 04:06:42,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-31 04:06:42,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 27. [2018-12-31 04:06:42,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-31 04:06:42,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2018-12-31 04:06:42,846 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 14 [2018-12-31 04:06:42,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:06:42,846 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2018-12-31 04:06:42,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 04:06:42,847 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2018-12-31 04:06:42,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-31 04:06:42,847 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:06:42,848 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:06:42,848 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:06:42,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:06:42,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1219229111, now seen corresponding path program 1 times [2018-12-31 04:06:42,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:06:42,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:06:42,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:06:42,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:06:42,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:06:42,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 04:06:42,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 04:06:42,933 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 04:06:42,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 04:06:42 BoogieIcfgContainer [2018-12-31 04:06:42,964 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 04:06:42,964 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 04:06:42,965 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 04:06:42,965 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 04:06:42,965 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 04:06:41" (3/4) ... [2018-12-31 04:06:42,971 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-31 04:06:42,971 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 04:06:42,972 INFO L168 Benchmark]: Toolchain (without parser) took 2405.86 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 96.5 MB). Free memory was 952.7 MB in the beginning and 1.0 GB in the end (delta: -69.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. [2018-12-31 04:06:42,974 INFO L168 Benchmark]: CDTParser took 0.16 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. [2018-12-31 04:06:42,975 INFO L168 Benchmark]: CACSL2BoogieTranslator took 383.32 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-31 04:06:42,976 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.19 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 936.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-31 04:06:42,977 INFO L168 Benchmark]: Boogie Preprocessor took 135.96 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 96.5 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -147.8 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2018-12-31 04:06:42,978 INFO L168 Benchmark]: RCFGBuilder took 724.86 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. [2018-12-31 04:06:42,979 INFO L168 Benchmark]: TraceAbstraction took 1085.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 41.4 MB). Peak memory consumption was 41.4 MB. Max. memory is 11.5 GB. [2018-12-31 04:06:42,979 INFO L168 Benchmark]: Witness Printer took 6.58 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 04:06:42,984 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.16 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 383.32 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 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 62.19 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 936.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 135.96 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 96.5 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -147.8 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 724.86 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1085.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 41.4 MB). Peak memory consumption was 41.4 MB. Max. memory is 11.5 GB. * Witness Printer took 6.58 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 65]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 54, overapproximation of someBinaryArithmeticFLOAToperation at line 60. Possible FailurePath: [L60] float x = 0.0f / 0.0f; [L61] float y = 0.0f / 0.0f; [L20] __uint32_t w; [L23] ieee_float_shape_type gf_u; [L24] gf_u.value = (x) [L25] EXPR gf_u.word [L25] (w) = gf_u.word [L28] COND FALSE !(w == 0x00000000 || w == 0x80000000) [L30-L31] COND FALSE !((w >= 0x00800000 && w <= 0x7f7fffff) || (w >= 0x80800000 && w <= 0xff7fffff)) [L33-L34] COND FALSE !((w >= 0x00000001 && w <= 0x007fffff) || (w >= 0x80000001 && w <= 0x807fffff)) [L36] COND FALSE !(w == 0x7f800000 || w == 0xff800000) [L39] return 0; [L43] COND TRUE __fpclassify_float(x) == 0 [L44] return y; [L62] float res = fmax_float(x, y); [L54] return x != x; [L64] COND TRUE !isnan_float(res) [L65] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 28 locations, 1 error locations. UNSAFE Result, 1.0s 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.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s 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-2e94e6a [2018-12-31 04:06:45,428 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 04:06:45,431 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 04:06:45,447 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 04:06:45,447 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 04:06:45,448 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 04:06:45,450 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 04:06:45,452 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 04:06:45,453 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 04:06:45,454 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 04:06:45,455 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 04:06:45,455 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 04:06:45,457 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 04:06:45,458 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 04:06:45,459 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 04:06:45,459 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 04:06:45,460 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 04:06:45,464 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 04:06:45,469 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 04:06:45,473 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 04:06:45,474 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 04:06:45,475 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 04:06:45,483 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 04:06:45,487 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 04:06:45,487 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 04:06:45,488 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 04:06:45,489 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 04:06:45,493 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 04:06:45,494 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 04:06:45,497 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 04:06:45,497 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 04:06:45,498 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 04:06:45,498 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 04:06:45,499 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 04:06:45,499 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 04:06:45,501 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 04:06:45,502 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-12-31 04:06:45,530 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 04:06:45,530 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 04:06:45,532 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 04:06:45,532 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 04:06:45,532 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 04:06:45,532 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 04:06:45,533 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 04:06:45,533 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 04:06:45,533 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 04:06:45,533 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 04:06:45,533 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 04:06:45,533 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 04:06:45,534 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-31 04:06:45,535 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-31 04:06:45,535 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 04:06:45,535 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 04:06:45,535 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 04:06:45,537 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 04:06:45,537 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 04:06:45,537 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 04:06:45,537 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 04:06:45,538 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 04:06:45,538 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 04:06:45,538 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 04:06:45,538 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 04:06:45,538 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 04:06:45,538 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-12-31 04:06:45,539 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 04:06:45,539 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-31 04:06:45,539 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-31 04:06:45,539 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 -> 7aa9ac80ed7bb9ce6b78459a496e265402ed9cc3 [2018-12-31 04:06:45,604 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 04:06:45,617 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 04:06:45,622 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 04:06:45,626 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 04:06:45,627 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 04:06:45,627 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/float_req_bl_1250_true-unreach-call.c [2018-12-31 04:06:45,691 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/460652465/234bf93ee8a644e6868ae94bf86a7dfa/FLAGbf8d3900b [2018-12-31 04:06:46,150 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 04:06:46,152 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/float_req_bl_1250_true-unreach-call.c [2018-12-31 04:06:46,162 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/460652465/234bf93ee8a644e6868ae94bf86a7dfa/FLAGbf8d3900b [2018-12-31 04:06:46,491 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/460652465/234bf93ee8a644e6868ae94bf86a7dfa [2018-12-31 04:06:46,495 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 04:06:46,496 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 04:06:46,497 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 04:06:46,497 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 04:06:46,501 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 04:06:46,502 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 04:06:46" (1/1) ... [2018-12-31 04:06:46,505 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bc5a943 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:46, skipping insertion in model container [2018-12-31 04:06:46,505 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 04:06:46" (1/1) ... [2018-12-31 04:06:46,514 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 04:06:46,539 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 04:06:46,740 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 04:06:46,749 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 04:06:46,777 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 04:06:46,802 INFO L195 MainTranslator]: Completed translation [2018-12-31 04:06:46,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:46 WrapperNode [2018-12-31 04:06:46,803 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 04:06:46,804 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 04:06:46,804 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 04:06:46,804 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 04:06:46,812 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:46" (1/1) ... [2018-12-31 04:06:46,823 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:46" (1/1) ... [2018-12-31 04:06:46,851 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 04:06:46,851 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 04:06:46,851 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 04:06:46,851 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 04:06:46,931 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:46" (1/1) ... [2018-12-31 04:06:46,931 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:46" (1/1) ... [2018-12-31 04:06:46,935 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:46" (1/1) ... [2018-12-31 04:06:46,935 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:46" (1/1) ... [2018-12-31 04:06:46,946 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:46" (1/1) ... [2018-12-31 04:06:46,951 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:46" (1/1) ... [2018-12-31 04:06:46,954 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:46" (1/1) ... [2018-12-31 04:06:46,958 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 04:06:46,958 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 04:06:46,958 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 04:06:46,958 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 04:06:46,959 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:46" (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 [2018-12-31 04:06:47,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-12-31 04:06:47,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 04:06:47,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 04:06:47,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2018-12-31 04:06:47,021 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 04:06:47,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 04:06:47,252 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 04:06:47,529 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 04:06:47,581 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 04:06:47,582 INFO L280 CfgBuilder]: Removed 16 assue(true) statements. [2018-12-31 04:06:47,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 04:06:47 BoogieIcfgContainer [2018-12-31 04:06:47,582 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 04:06:47,583 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 04:06:47,584 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 04:06:47,587 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 04:06:47,588 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 04:06:46" (1/3) ... [2018-12-31 04:06:47,588 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a94ecfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 04:06:47, skipping insertion in model container [2018-12-31 04:06:47,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:46" (2/3) ... [2018-12-31 04:06:47,589 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a94ecfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 04:06:47, skipping insertion in model container [2018-12-31 04:06:47,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 04:06:47" (3/3) ... [2018-12-31 04:06:47,591 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1250_true-unreach-call.c [2018-12-31 04:06:47,602 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 04:06:47,611 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 04:06:47,629 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 04:06:47,661 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 04:06:47,661 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 04:06:47,662 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 04:06:47,662 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 04:06:47,662 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 04:06:47,662 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 04:06:47,662 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 04:06:47,662 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 04:06:47,663 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 04:06:47,676 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2018-12-31 04:06:47,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-31 04:06:47,683 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:06:47,685 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:06:47,687 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:06:47,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:06:47,693 INFO L82 PathProgramCache]: Analyzing trace with hash -958093107, now seen corresponding path program 1 times [2018-12-31 04:06:47,697 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 04:06:47,698 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 [2018-12-31 04:06:47,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:06:47,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:06:47,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:06:47,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:06:47,783 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 04:06:47,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:06:47,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 04:06:47,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 04:06:47,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 04:06:47,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 04:06:47,815 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2018-12-31 04:06:47,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:06:47,834 INFO L93 Difference]: Finished difference Result 54 states and 84 transitions. [2018-12-31 04:06:47,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 04:06:47,836 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-12-31 04:06:47,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:06:47,847 INFO L225 Difference]: With dead ends: 54 [2018-12-31 04:06:47,847 INFO L226 Difference]: Without dead ends: 25 [2018-12-31 04:06:47,850 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 [2018-12-31 04:06:47,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-31 04:06:47,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-31 04:06:47,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-31 04:06:47,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2018-12-31 04:06:47,886 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 35 transitions. Word has length 10 [2018-12-31 04:06:47,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:06:47,886 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 35 transitions. [2018-12-31 04:06:47,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 04:06:47,886 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2018-12-31 04:06:47,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-31 04:06:47,887 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:06:47,887 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:06:47,888 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:06:47,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:06:47,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1001566992, now seen corresponding path program 1 times [2018-12-31 04:06:47,889 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 04:06:47,890 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 [2018-12-31 04:06:47,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:06:47,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:06:47,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:06:48,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:06:48,019 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 04:06:48,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:06:48,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 04:06:48,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 04:06:48,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 04:06:48,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 04:06:48,038 INFO L87 Difference]: Start difference. First operand 25 states and 35 transitions. Second operand 4 states. [2018-12-31 04:06:48,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:06:48,359 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2018-12-31 04:06:48,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 04:06:48,360 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-12-31 04:06:48,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:06:48,361 INFO L225 Difference]: With dead ends: 41 [2018-12-31 04:06:48,361 INFO L226 Difference]: Without dead ends: 36 [2018-12-31 04:06:48,363 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 [2018-12-31 04:06:48,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-31 04:06:48,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2018-12-31 04:06:48,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-31 04:06:48,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2018-12-31 04:06:48,370 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 11 [2018-12-31 04:06:48,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:06:48,370 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2018-12-31 04:06:48,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 04:06:48,372 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2018-12-31 04:06:48,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-31 04:06:48,372 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:06:48,372 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:06:48,373 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:06:48,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:06:48,373 INFO L82 PathProgramCache]: Analyzing trace with hash 502183504, now seen corresponding path program 1 times [2018-12-31 04:06:48,375 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 04:06:48,375 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 [2018-12-31 04:06:48,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:06:48,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:06:48,427 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:06:48,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:06:48,505 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 04:06:48,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:06:48,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 04:06:48,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 04:06:48,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 04:06:48,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 04:06:48,517 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 4 states. [2018-12-31 04:06:48,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:06:48,664 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2018-12-31 04:06:48,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 04:06:48,666 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-12-31 04:06:48,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:06:48,667 INFO L225 Difference]: With dead ends: 43 [2018-12-31 04:06:48,668 INFO L226 Difference]: Without dead ends: 38 [2018-12-31 04:06:48,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 04:06:48,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-31 04:06:48,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 27. [2018-12-31 04:06:48,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-31 04:06:48,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2018-12-31 04:06:48,675 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 12 [2018-12-31 04:06:48,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:06:48,675 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2018-12-31 04:06:48,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 04:06:48,676 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2018-12-31 04:06:48,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-31 04:06:48,677 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:06:48,677 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:06:48,678 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:06:48,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:06:48,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1951251627, now seen corresponding path program 1 times [2018-12-31 04:06:48,679 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 04:06:48,679 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 [2018-12-31 04:06:48,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:06:48,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:06:48,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:06:48,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:06:48,756 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 04:06:48,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:06:48,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 04:06:48,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 04:06:48,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 04:06:48,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 04:06:48,769 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 4 states. [2018-12-31 04:06:49,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:06:49,044 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2018-12-31 04:06:49,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 04:06:49,046 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-12-31 04:06:49,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:06:49,047 INFO L225 Difference]: With dead ends: 43 [2018-12-31 04:06:49,047 INFO L226 Difference]: Without dead ends: 38 [2018-12-31 04:06:49,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 04:06:49,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-31 04:06:49,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 27. [2018-12-31 04:06:49,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-31 04:06:49,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2018-12-31 04:06:49,061 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 13 [2018-12-31 04:06:49,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:06:49,062 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2018-12-31 04:06:49,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 04:06:49,062 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2018-12-31 04:06:49,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-31 04:06:49,063 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:06:49,063 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:06:49,063 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:06:49,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:06:49,065 INFO L82 PathProgramCache]: Analyzing trace with hash -555778251, now seen corresponding path program 1 times [2018-12-31 04:06:49,066 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 04:06:49,066 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 [2018-12-31 04:06:49,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:06:49,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:06:49,128 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:06:49,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:06:49,185 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 04:06:49,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:06:49,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 04:06:49,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 04:06:49,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 04:06:49,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 04:06:49,197 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 4 states. [2018-12-31 04:06:49,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:06:49,307 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2018-12-31 04:06:49,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 04:06:49,308 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-12-31 04:06:49,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:06:49,309 INFO L225 Difference]: With dead ends: 43 [2018-12-31 04:06:49,309 INFO L226 Difference]: Without dead ends: 38 [2018-12-31 04:06:49,309 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 [2018-12-31 04:06:49,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-31 04:06:49,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 27. [2018-12-31 04:06:49,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-31 04:06:49,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2018-12-31 04:06:49,316 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 14 [2018-12-31 04:06:49,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:06:49,316 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2018-12-31 04:06:49,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 04:06:49,317 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2018-12-31 04:06:49,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-31 04:06:49,317 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:06:49,317 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:06:49,318 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:06:49,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:06:49,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1219229111, now seen corresponding path program 1 times [2018-12-31 04:06:49,318 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 04:06:49,319 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 [2018-12-31 04:06:49,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:06:49,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:06:49,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:06:49,514 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 5 [2018-12-31 04:06:49,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:06:49,534 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 04:06:49,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:06:49,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 04:06:49,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 04:06:49,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 04:06:49,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 04:06:49,549 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 6 states. [2018-12-31 04:06:49,997 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-31 04:06:50,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:06:50,036 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2018-12-31 04:06:50,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 04:06:50,038 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-12-31 04:06:50,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:06:50,039 INFO L225 Difference]: With dead ends: 36 [2018-12-31 04:06:50,039 INFO L226 Difference]: Without dead ends: 27 [2018-12-31 04:06:50,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 04:06:50,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-31 04:06:50,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-12-31 04:06:50,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-31 04:06:50,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2018-12-31 04:06:50,047 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 14 [2018-12-31 04:06:50,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:06:50,048 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2018-12-31 04:06:50,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 04:06:50,048 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2018-12-31 04:06:50,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-31 04:06:50,049 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:06:50,049 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:06:50,049 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:06:50,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:06:50,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1012428811, now seen corresponding path program 1 times [2018-12-31 04:06:50,050 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 04:06:50,050 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 [2018-12-31 04:06:50,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:06:50,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:06:50,104 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:06:50,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:06:50,158 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 04:06:50,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:06:50,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 04:06:50,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 04:06:50,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 04:06:50,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 04:06:50,170 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand 4 states. [2018-12-31 04:06:50,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:06:50,453 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2018-12-31 04:06:50,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 04:06:50,454 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-12-31 04:06:50,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:06:50,455 INFO L225 Difference]: With dead ends: 41 [2018-12-31 04:06:50,456 INFO L226 Difference]: Without dead ends: 36 [2018-12-31 04:06:50,456 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 [2018-12-31 04:06:50,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-31 04:06:50,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2018-12-31 04:06:50,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-31 04:06:50,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2018-12-31 04:06:50,463 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 16 [2018-12-31 04:06:50,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:06:50,463 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2018-12-31 04:06:50,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 04:06:50,463 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2018-12-31 04:06:50,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-31 04:06:50,464 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:06:50,464 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:06:50,464 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:06:50,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:06:50,466 INFO L82 PathProgramCache]: Analyzing trace with hash 874917212, now seen corresponding path program 1 times [2018-12-31 04:06:50,467 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 04:06:50,467 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 [2018-12-31 04:06:50,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:06:50,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:06:50,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:06:50,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:06:50,536 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 04:06:50,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:06:50,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 04:06:50,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 04:06:50,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 04:06:50,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 04:06:50,549 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 4 states. [2018-12-31 04:06:50,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:06:50,636 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2018-12-31 04:06:50,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 04:06:50,640 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-12-31 04:06:50,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:06:50,641 INFO L225 Difference]: With dead ends: 43 [2018-12-31 04:06:50,641 INFO L226 Difference]: Without dead ends: 38 [2018-12-31 04:06:50,642 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 [2018-12-31 04:06:50,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-31 04:06:50,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 27. [2018-12-31 04:06:50,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-31 04:06:50,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2018-12-31 04:06:50,649 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 17 [2018-12-31 04:06:50,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:06:50,650 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2018-12-31 04:06:50,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 04:06:50,650 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2018-12-31 04:06:50,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-31 04:06:50,650 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:06:50,651 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:06:50,651 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:06:50,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:06:50,651 INFO L82 PathProgramCache]: Analyzing trace with hash -356841937, now seen corresponding path program 1 times [2018-12-31 04:06:50,651 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 04:06:50,652 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 [2018-12-31 04:06:50,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:06:50,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:06:50,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:06:50,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:06:50,885 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 04:06:50,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:06:50,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 04:06:50,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 04:06:50,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 04:06:50,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 04:06:50,896 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 7 states. [2018-12-31 04:06:51,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:06:51,068 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2018-12-31 04:06:51,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 04:06:51,068 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-12-31 04:06:51,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:06:51,069 INFO L225 Difference]: With dead ends: 32 [2018-12-31 04:06:51,069 INFO L226 Difference]: Without dead ends: 23 [2018-12-31 04:06:51,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-12-31 04:06:51,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-31 04:06:51,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-31 04:06:51,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-31 04:06:51,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2018-12-31 04:06:51,074 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 18 [2018-12-31 04:06:51,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:06:51,075 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2018-12-31 04:06:51,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 04:06:51,076 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2018-12-31 04:06:51,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-31 04:06:51,076 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:06:51,076 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:06:51,077 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:06:51,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:06:51,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1049576048, now seen corresponding path program 1 times [2018-12-31 04:06:51,077 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 04:06:51,079 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 [2018-12-31 04:06:51,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:06:51,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:06:51,135 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:06:51,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:06:51,153 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 04:06:51,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:06:51,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 04:06:51,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 04:06:51,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 04:06:51,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 04:06:51,165 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand 4 states. [2018-12-31 04:06:51,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:06:51,245 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-12-31 04:06:51,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 04:06:51,250 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-12-31 04:06:51,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:06:51,251 INFO L225 Difference]: With dead ends: 32 [2018-12-31 04:06:51,251 INFO L226 Difference]: Without dead ends: 25 [2018-12-31 04:06:51,251 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 [2018-12-31 04:06:51,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-31 04:06:51,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-12-31 04:06:51,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-31 04:06:51,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-12-31 04:06:51,257 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 18 [2018-12-31 04:06:51,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:06:51,257 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-12-31 04:06:51,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 04:06:51,257 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2018-12-31 04:06:51,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-31 04:06:51,259 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:06:51,259 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:06:51,260 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:06:51,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:06:51,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1983383519, now seen corresponding path program 1 times [2018-12-31 04:06:51,260 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 04:06:51,260 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 [2018-12-31 04:06:51,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:06:51,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:06:51,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:06:51,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:06:51,329 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 04:06:51,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:06:51,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 04:06:51,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 04:06:51,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 04:06:51,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 04:06:51,341 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 4 states. [2018-12-31 04:06:51,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:06:51,448 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-12-31 04:06:51,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 04:06:51,449 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-12-31 04:06:51,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:06:51,450 INFO L225 Difference]: With dead ends: 32 [2018-12-31 04:06:51,450 INFO L226 Difference]: Without dead ends: 25 [2018-12-31 04:06:51,451 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 [2018-12-31 04:06:51,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-31 04:06:51,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-12-31 04:06:51,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-31 04:06:51,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2018-12-31 04:06:51,455 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 19 [2018-12-31 04:06:51,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:06:51,455 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2018-12-31 04:06:51,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 04:06:51,457 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2018-12-31 04:06:51,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-31 04:06:51,457 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:06:51,458 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:06:51,458 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:06:51,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:06:51,458 INFO L82 PathProgramCache]: Analyzing trace with hash -208376157, now seen corresponding path program 1 times [2018-12-31 04:06:51,459 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 04:06:51,460 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 [2018-12-31 04:06:51,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:06:51,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:06:51,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:06:51,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:06:51,586 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 04:06:51,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:06:51,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 04:06:51,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 04:06:51,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 04:06:51,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 04:06:51,602 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 6 states. [2018-12-31 04:06:51,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:06:51,699 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2018-12-31 04:06:51,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 04:06:51,700 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-12-31 04:06:51,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:06:51,700 INFO L225 Difference]: With dead ends: 23 [2018-12-31 04:06:51,700 INFO L226 Difference]: Without dead ends: 0 [2018-12-31 04:06:51,701 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 [2018-12-31 04:06:51,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-31 04:06:51,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-31 04:06:51,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-31 04:06:51,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-31 04:06:51,702 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2018-12-31 04:06:51,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:06:51,702 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-31 04:06:51,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 04:06:51,702 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-31 04:06:51,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-31 04:06:51,709 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-31 04:06:52,067 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-12-31 04:06:52,164 INFO L448 ceAbstractionStarter]: For program point L64(lines 64 67) no Hoare annotation was computed. [2018-12-31 04:06:52,164 INFO L451 ceAbstractionStarter]: At program point L69(lines 56 70) the Hoare annotation is: true [2018-12-31 04:06:52,165 INFO L448 ceAbstractionStarter]: For program point L36(lines 36 39) no Hoare annotation was computed. [2018-12-31 04:06:52,165 INFO L448 ceAbstractionStarter]: For program point L36-1(lines 36 39) no Hoare annotation was computed. [2018-12-31 04:06:52,165 INFO L448 ceAbstractionStarter]: For program point L65(line 65) no Hoare annotation was computed. [2018-12-31 04:06:52,165 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-12-31 04:06:52,165 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-31 04:06:52,165 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-31 04:06:52,165 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 65) no Hoare annotation was computed. [2018-12-31 04:06:52,165 INFO L448 ceAbstractionStarter]: For program point L33(lines 33 39) no Hoare annotation was computed. [2018-12-31 04:06:52,166 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-31 04:06:52,166 INFO L448 ceAbstractionStarter]: For program point L33-1(lines 33 39) no Hoare annotation was computed. [2018-12-31 04:06:52,166 INFO L444 ceAbstractionStarter]: At program point L54(line 54) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 8 24) (_ +zero 8 24)))) (and (= |ULTIMATE.start_fmax_float_#res| .cse0) (= ULTIMATE.start_fmax_float_~y .cse0) (= (bvadd |ULTIMATE.start_isnan_float_#res| (_ bv4294967295 32)) (_ bv0 32)))) [2018-12-31 04:06:52,166 INFO L448 ceAbstractionStarter]: For program point L50(line 50) no Hoare annotation was computed. [2018-12-31 04:06:52,166 INFO L448 ceAbstractionStarter]: For program point L50-2(line 50) no Hoare annotation was computed. [2018-12-31 04:06:52,166 INFO L444 ceAbstractionStarter]: At program point L50-3(lines 42 51) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 8 24) (_ +zero 8 24)))) (and (= |ULTIMATE.start_fmax_float_#res| .cse0) (= ULTIMATE.start_fmax_float_~y .cse0))) [2018-12-31 04:06:52,166 INFO L448 ceAbstractionStarter]: For program point L30(lines 30 39) no Hoare annotation was computed. [2018-12-31 04:06:52,166 INFO L448 ceAbstractionStarter]: For program point L30-1(lines 30 39) no Hoare annotation was computed. [2018-12-31 04:06:52,167 INFO L448 ceAbstractionStarter]: For program point L22-1(lines 22 26) no Hoare annotation was computed. [2018-12-31 04:06:52,167 INFO L444 ceAbstractionStarter]: At program point L22-2(lines 22 26) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 8 24) (_ +zero 8 24)))) (and (= ULTIMATE.start_fmax_float_~y .cse0) (= ULTIMATE.start_fmax_float_~x .cse0))) [2018-12-31 04:06:52,167 INFO L448 ceAbstractionStarter]: For program point L22-3(lines 19 40) no Hoare annotation was computed. [2018-12-31 04:06:52,167 INFO L448 ceAbstractionStarter]: For program point L22-5(lines 22 26) no Hoare annotation was computed. [2018-12-31 04:06:52,167 INFO L444 ceAbstractionStarter]: At program point L22-6(lines 22 26) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 8 24) (_ +zero 8 24)))) (and (= ULTIMATE.start_fmax_float_~y .cse0) (= ULTIMATE.start_fmax_float_~x .cse0))) [2018-12-31 04:06:52,167 INFO L448 ceAbstractionStarter]: For program point L22-7(lines 19 40) no Hoare annotation was computed. [2018-12-31 04:06:52,167 INFO L448 ceAbstractionStarter]: For program point L47(lines 47 49) no Hoare annotation was computed. [2018-12-31 04:06:52,167 INFO L448 ceAbstractionStarter]: For program point L43(lines 43 45) no Hoare annotation was computed. [2018-12-31 04:06:52,167 INFO L444 ceAbstractionStarter]: At program point L39(lines 19 40) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 8 24) (_ +zero 8 24)))) (and (= ULTIMATE.start_fmax_float_~y .cse0) (= ULTIMATE.start_fmax_float_~x .cse0))) [2018-12-31 04:06:52,168 INFO L444 ceAbstractionStarter]: At program point L39-1(lines 19 40) the Hoare annotation is: (let ((.cse1 (fp.div roundNearestTiesToEven (_ +zero 8 24) (_ +zero 8 24)))) (let ((.cse0 (= ULTIMATE.start_fmax_float_~y .cse1))) (or (and .cse0 (= ULTIMATE.start_fmax_float_~x .cse1)) (and .cse0 (= (bvadd |ULTIMATE.start___fpclassify_float_#res| (_ bv4294967294 32)) (_ bv0 32))) (and .cse0 (= (bvadd |ULTIMATE.start___fpclassify_float_#res| (_ bv4294967293 32)) (_ bv0 32))) (and (= (bvadd |ULTIMATE.start___fpclassify_float_#res| (_ bv4294967292 32)) (_ bv0 32)) .cse0) (and (= (bvadd |ULTIMATE.start___fpclassify_float_#res| (_ bv4294967295 32)) (_ bv0 32)) .cse0)))) [2018-12-31 04:06:52,176 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:52,177 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:52,180 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:52,180 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:52,181 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:52,182 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:52,182 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:52,182 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:52,184 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:52,184 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:52,184 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:52,185 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:52,186 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:52,186 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:52,186 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:52,187 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:52,187 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:52,187 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:52,188 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:52,188 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:52,190 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:52,190 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:52,191 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:52,191 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:52,193 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:52,193 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:52,194 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:52,194 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:52,194 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:52,194 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:52,196 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:52,197 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:52,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 04:06:52 BoogieIcfgContainer [2018-12-31 04:06:52,200 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 04:06:52,200 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 04:06:52,200 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 04:06:52,201 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 04:06:52,201 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 04:06:47" (3/4) ... [2018-12-31 04:06:52,207 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-31 04:06:52,221 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2018-12-31 04:06:52,221 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-31 04:06:52,222 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-31 04:06:52,254 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()) [2018-12-31 04:06:52,255 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())) && ~bvadd64(\result, 4294967295bv32) == 0bv32 [2018-12-31 04:06:52,255 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((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, 4294967294bv32) == 0bv32)) || (y == ~fp.div~FLOAT(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && ~bvadd64(\result, 4294967293bv32) == 0bv32)) || (~bvadd64(\result, 4294967292bv32) == 0bv32 && y == ~fp.div~FLOAT(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()))) || (~bvadd64(\result, 4294967295bv32) == 0bv32 && y == ~fp.div~FLOAT(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) [2018-12-31 04:06:52,298 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 04:06:52,302 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 04:06:52,303 INFO L168 Benchmark]: Toolchain (without parser) took 5808.27 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 944.7 MB in the beginning and 823.2 MB in the end (delta: 121.5 MB). Peak memory consumption was 232.1 MB. Max. memory is 11.5 GB. [2018-12-31 04:06:52,306 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. [2018-12-31 04:06:52,306 INFO L168 Benchmark]: CACSL2BoogieTranslator took 306.10 ms. Allocated memory is still 1.0 GB. Free memory was 944.7 MB in the beginning and 933.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-31 04:06:52,307 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.23 ms. Allocated memory is still 1.0 GB. Free memory was 933.9 MB in the beginning and 928.5 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-31 04:06:52,308 INFO L168 Benchmark]: Boogie Preprocessor took 106.73 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 928.5 MB in the beginning and 1.1 GB in the end (delta: -170.0 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2018-12-31 04:06:52,309 INFO L168 Benchmark]: RCFGBuilder took 624.43 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. [2018-12-31 04:06:52,310 INFO L168 Benchmark]: TraceAbstraction took 4616.63 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 830.1 MB in the end (delta: 243.2 MB). Peak memory consumption was 243.2 MB. Max. memory is 11.5 GB. [2018-12-31 04:06:52,311 INFO L168 Benchmark]: Witness Printer took 102.04 ms. Allocated memory is still 1.1 GB. Free memory was 830.1 MB in the beginning and 823.2 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-12-31 04:06:52,316 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 306.10 ms. Allocated memory is still 1.0 GB. Free memory was 944.7 MB in the beginning and 933.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 47.23 ms. Allocated memory is still 1.0 GB. Free memory was 933.9 MB in the beginning and 928.5 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 106.73 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 928.5 MB in the beginning and 1.1 GB in the end (delta: -170.0 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 624.43 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4616.63 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 830.1 MB in the end (delta: 243.2 MB). Peak memory consumption was 243.2 MB. Max. memory is 11.5 GB. * Witness Printer took 102.04 ms. Allocated memory is still 1.1 GB. Free memory was 830.1 MB in the beginning and 823.2 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 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 - 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: 65]: 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: 42]: Loop Invariant [2018-12-31 04:06:52,338 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:52,338 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:52,339 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:52,339 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: 56]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 22]: Loop Invariant [2018-12-31 04:06:52,339 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:52,340 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:52,340 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:52,340 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: y == ~fp.div~FLOAT(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && x == ~fp.div~FLOAT(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 54]: Loop Invariant [2018-12-31 04:06:52,340 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:52,341 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:52,345 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:52,345 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())) && ~bvadd64(\result, 4294967295bv32) == 0bv32 - InvariantResult [Line: 19]: Loop Invariant [2018-12-31 04:06:52,345 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:52,346 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:52,346 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:52,346 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:52,346 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:52,347 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:52,351 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:52,352 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:52,352 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:52,352 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:52,352 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:52,352 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((((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, 4294967294bv32) == 0bv32)) || (y == ~fp.div~FLOAT(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && ~bvadd64(\result, 4294967293bv32) == 0bv32)) || (~bvadd64(\result, 4294967292bv32) == 0bv32 && y == ~fp.div~FLOAT(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()))) || (~bvadd64(\result, 4294967295bv32) == 0bv32 && y == ~fp.div~FLOAT(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) - InvariantResult [Line: 19]: Loop Invariant [2018-12-31 04:06:52,353 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:52,353 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:52,357 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:52,357 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: y == ~fp.div~FLOAT(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && x == ~fp.div~FLOAT(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 22]: Loop Invariant [2018-12-31 04:06:52,357 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:52,358 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:52,358 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:52,358 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: y == ~fp.div~FLOAT(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && x == ~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.5s OverallTime, 12 OverallIterations, 1 TraceHistogramMax, 2.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 413 SDtfs, 132 SDslu, 682 SDs, 0 SdLazy, 219 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 187 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.4s 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, 133 HoareAnnotationTreeSize, 7 FomulaSimplifications, 931 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 181 NumberOfCodeBlocks, 181 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 169 ConstructedInterpolants, 0 QuantifiedInterpolants, 6609 SizeOfPredicates, 32 NumberOfNonLiveVariables, 564 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...