./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/float-newlib/double_req_bl_1230_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/float-newlib/double_req_bl_1230_true-unreach-call.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b865bb4da04412be07ba7e2426d2224bb04a2953 ....................................................................................................................................................................................................................................................................................................................................................... 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/double_req_bl_1230_true-unreach-call.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b865bb4da04412be07ba7e2426d2224bb04a2953 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 09:08:48,344 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 09:08:48,346 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 09:08:48,357 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 09:08:48,358 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 09:08:48,359 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 09:08:48,360 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 09:08:48,363 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 09:08:48,365 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 09:08:48,366 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 09:08:48,367 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 09:08:48,367 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 09:08:48,369 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 09:08:48,371 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 09:08:48,373 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 09:08:48,373 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 09:08:48,376 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 09:08:48,378 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 09:08:48,380 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 09:08:48,381 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 09:08:48,383 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 09:08:48,384 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 09:08:48,386 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 09:08:48,386 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 09:08:48,387 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 09:08:48,388 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 09:08:48,389 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 09:08:48,390 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 09:08:48,390 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 09:08:48,392 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 09:08:48,392 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 09:08:48,393 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 09:08:48,393 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 09:08:48,393 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 09:08:48,394 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 09:08:48,395 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 09:08:48,395 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 09:08:48,410 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 09:08:48,410 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 09:08:48,411 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 09:08:48,412 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 09:08:48,412 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 09:08:48,412 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 09:08:48,412 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 09:08:48,412 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 09:08:48,413 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 09:08:48,413 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 09:08:48,413 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 09:08:48,413 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 09:08:48,413 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 09:08:48,413 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 09:08:48,414 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 09:08:48,414 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 09:08:48,414 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 09:08:48,414 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 09:08:48,414 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 09:08:48,414 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 09:08:48,415 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 09:08:48,415 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 09:08:48,415 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 09:08:48,415 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 09:08:48,415 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 09:08:48,415 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 09:08:48,416 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 09:08:48,416 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 09:08:48,416 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 -> b865bb4da04412be07ba7e2426d2224bb04a2953 [2019-01-12 09:08:48,471 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 09:08:48,488 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 09:08:48,493 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 09:08:48,494 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 09:08:48,495 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 09:08:48,496 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/double_req_bl_1230_true-unreach-call.c [2019-01-12 09:08:48,554 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/682571674/a43a1adce70d4ba39fd34365095d79c7/FLAGd9c9834ca [2019-01-12 09:08:48,997 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 09:08:48,997 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/double_req_bl_1230_true-unreach-call.c [2019-01-12 09:08:49,005 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/682571674/a43a1adce70d4ba39fd34365095d79c7/FLAGd9c9834ca [2019-01-12 09:08:49,362 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/682571674/a43a1adce70d4ba39fd34365095d79c7 [2019-01-12 09:08:49,366 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 09:08:49,368 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 09:08:49,373 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 09:08:49,373 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 09:08:49,377 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 09:08:49,378 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:08:49" (1/1) ... [2019-01-12 09:08:49,381 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17a8869e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:08:49, skipping insertion in model container [2019-01-12 09:08:49,382 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:08:49" (1/1) ... [2019-01-12 09:08:49,392 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 09:08:49,414 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 09:08:49,655 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:08:49,658 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 09:08:49,703 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:08:49,739 INFO L195 MainTranslator]: Completed translation [2019-01-12 09:08:49,740 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:08:49 WrapperNode [2019-01-12 09:08:49,740 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 09:08:49,741 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 09:08:49,741 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 09:08:49,741 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 09:08:49,752 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:08:49" (1/1) ... [2019-01-12 09:08:49,769 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:08:49" (1/1) ... [2019-01-12 09:08:49,806 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 09:08:49,806 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 09:08:49,806 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 09:08:49,806 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 09:08:49,880 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:08:49" (1/1) ... [2019-01-12 09:08:49,880 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:08:49" (1/1) ... [2019-01-12 09:08:49,884 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:08:49" (1/1) ... [2019-01-12 09:08:49,884 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:08:49" (1/1) ... [2019-01-12 09:08:49,899 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:08:49" (1/1) ... [2019-01-12 09:08:49,912 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:08:49" (1/1) ... [2019-01-12 09:08:49,918 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:08:49" (1/1) ... [2019-01-12 09:08:49,923 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 09:08:49,926 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 09:08:49,926 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 09:08:49,926 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 09:08:49,927 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:08:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 09:08:50,008 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 09:08:50,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-01-12 09:08:50,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 09:08:50,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 09:08:50,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-12 09:08:50,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 09:08:50,613 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 09:08:50,613 INFO L286 CfgBuilder]: Removed 16 assue(true) statements. [2019-01-12 09:08:50,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:08:50 BoogieIcfgContainer [2019-01-12 09:08:50,614 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 09:08:50,615 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 09:08:50,616 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 09:08:50,619 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 09:08:50,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 09:08:49" (1/3) ... [2019-01-12 09:08:50,620 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d76f524 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:08:50, skipping insertion in model container [2019-01-12 09:08:50,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:08:49" (2/3) ... [2019-01-12 09:08:50,621 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d76f524 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:08:50, skipping insertion in model container [2019-01-12 09:08:50,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:08:50" (3/3) ... [2019-01-12 09:08:50,623 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1230_true-unreach-call.c [2019-01-12 09:08:50,633 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 09:08:50,641 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 09:08:50,659 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 09:08:50,694 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 09:08:50,695 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 09:08:50,695 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 09:08:50,696 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 09:08:50,696 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 09:08:50,696 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 09:08:50,696 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 09:08:50,697 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 09:08:50,697 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 09:08:50,711 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2019-01-12 09:08:50,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-12 09:08:50,717 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:08:50,718 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:08:50,720 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:08:50,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:08:50,726 INFO L82 PathProgramCache]: Analyzing trace with hash -958093107, now seen corresponding path program 1 times [2019-01-12 09:08:50,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:08:50,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:08:50,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:08:50,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:08:50,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:08:50,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:08:50,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:08:50,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:08:50,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 09:08:50,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 09:08:50,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 09:08:50,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 09:08:50,860 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2019-01-12 09:08:50,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:08:50,880 INFO L93 Difference]: Finished difference Result 54 states and 84 transitions. [2019-01-12 09:08:50,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 09:08:50,881 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-01-12 09:08:50,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:08:50,892 INFO L225 Difference]: With dead ends: 54 [2019-01-12 09:08:50,893 INFO L226 Difference]: Without dead ends: 25 [2019-01-12 09:08:50,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 09:08:50,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-12 09:08:50,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-01-12 09:08:50,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-12 09:08:50,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2019-01-12 09:08:50,932 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 35 transitions. Word has length 10 [2019-01-12 09:08:50,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:08:50,932 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 35 transitions. [2019-01-12 09:08:50,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 09:08:50,933 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2019-01-12 09:08:50,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-12 09:08:50,933 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:08:50,933 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:08:50,934 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:08:50,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:08:50,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1001566992, now seen corresponding path program 1 times [2019-01-12 09:08:50,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:08:50,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:08:50,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:08:50,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:08:50,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:08:50,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:08:51,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:08:51,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:08:51,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:08:51,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:08:51,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:08:51,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:08:51,051 INFO L87 Difference]: Start difference. First operand 25 states and 35 transitions. Second operand 4 states. [2019-01-12 09:08:51,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:08:51,205 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2019-01-12 09:08:51,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:08:51,205 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-01-12 09:08:51,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:08:51,207 INFO L225 Difference]: With dead ends: 41 [2019-01-12 09:08:51,207 INFO L226 Difference]: Without dead ends: 36 [2019-01-12 09:08:51,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:08:51,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-12 09:08:51,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2019-01-12 09:08:51,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-12 09:08:51,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2019-01-12 09:08:51,215 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 11 [2019-01-12 09:08:51,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:08:51,215 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2019-01-12 09:08:51,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:08:51,215 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2019-01-12 09:08:51,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-12 09:08:51,216 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:08:51,216 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:08:51,216 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:08:51,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:08:51,217 INFO L82 PathProgramCache]: Analyzing trace with hash -555778251, now seen corresponding path program 1 times [2019-01-12 09:08:51,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:08:51,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:08:51,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:08:51,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:08:51,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:08:51,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:08:51,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:08:51,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:08:51,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:08:51,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:08:51,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:08:51,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:08:51,324 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 4 states. [2019-01-12 09:08:51,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:08:51,644 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2019-01-12 09:08:51,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:08:51,645 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-01-12 09:08:51,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:08:51,647 INFO L225 Difference]: With dead ends: 43 [2019-01-12 09:08:51,649 INFO L226 Difference]: Without dead ends: 38 [2019-01-12 09:08:51,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:08:51,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-12 09:08:51,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 27. [2019-01-12 09:08:51,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-12 09:08:51,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2019-01-12 09:08:51,663 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 14 [2019-01-12 09:08:51,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:08:51,663 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2019-01-12 09:08:51,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:08:51,664 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2019-01-12 09:08:51,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-12 09:08:51,665 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:08:51,666 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:08:51,666 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:08:51,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:08:51,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1219229111, now seen corresponding path program 1 times [2019-01-12 09:08:51,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:08:51,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:08:51,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:08:51,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:08:51,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:08:51,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 09:08:51,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 09:08:51,753 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 09:08:51,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 09:08:51 BoogieIcfgContainer [2019-01-12 09:08:51,783 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 09:08:51,783 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 09:08:51,783 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 09:08:51,784 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 09:08:51,784 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:08:50" (3/4) ... [2019-01-12 09:08:51,788 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-12 09:08:51,788 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 09:08:51,789 INFO L168 Benchmark]: Toolchain (without parser) took 2422.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 951.4 MB in the beginning and 1.0 GB in the end (delta: -94.0 MB). Peak memory consumption was 30.8 MB. Max. memory is 11.5 GB. [2019-01-12 09:08:51,791 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:08:51,792 INFO L168 Benchmark]: CACSL2BoogieTranslator took 368.08 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-12 09:08:51,793 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.72 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-12 09:08:51,794 INFO L168 Benchmark]: Boogie Preprocessor took 119.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -176.2 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2019-01-12 09:08:51,794 INFO L168 Benchmark]: RCFGBuilder took 688.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. [2019-01-12 09:08:51,795 INFO L168 Benchmark]: TraceAbstraction took 1167.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.2 MB). Peak memory consumption was 47.2 MB. Max. memory is 11.5 GB. [2019-01-12 09:08:51,796 INFO L168 Benchmark]: Witness Printer took 4.93 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:08:51,802 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.17 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 368.08 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 64.72 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 119.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -176.2 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 688.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1167.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.2 MB). Peak memory consumption was 47.2 MB. Max. memory is 11.5 GB. * Witness Printer took 4.93 ms. Allocated memory is still 1.2 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: 66]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 16, overapproximation of someBinaryArithmeticDOUBLEoperation at line 61. Possible FailurePath: [L61] double x = 0.0 / 0.0; [L62] double y = 0.0 / 0.0; [L18] __uint32_t msw, lsw; [L21] ieee_double_shape_type ew_u; [L22] ew_u.value = (x) [L23] EXPR ew_u.parts.msw [L23] (msw) = ew_u.parts.msw [L24] EXPR ew_u.parts.lsw [L24] (lsw) = ew_u.parts.lsw [L27-L28] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) [L30-L31] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) [L33-L34] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) [L37-L38] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L41] return 0; [L45] COND TRUE __fpclassify_double(x) == 0 [L46] return y; [L63] double res = fmin_double(x, y); [L16] return x != x; [L65] COND TRUE !isnan_double(res) [L66] __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.5s 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.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 20 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 49 NumberOfCodeBlocks, 49 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 32 ConstructedInterpolants, 0 QuantifiedInterpolants, 442 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-0ed9222-m [2019-01-12 09:08:54,104 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 09:08:54,106 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 09:08:54,124 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 09:08:54,125 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 09:08:54,127 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 09:08:54,129 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 09:08:54,131 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 09:08:54,136 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 09:08:54,143 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 09:08:54,146 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 09:08:54,146 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 09:08:54,147 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 09:08:54,148 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 09:08:54,149 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 09:08:54,155 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 09:08:54,155 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 09:08:54,158 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 09:08:54,163 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 09:08:54,166 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 09:08:54,167 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 09:08:54,168 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 09:08:54,173 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 09:08:54,174 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 09:08:54,175 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 09:08:54,176 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 09:08:54,177 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 09:08:54,179 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 09:08:54,180 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 09:08:54,182 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 09:08:54,182 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 09:08:54,183 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 09:08:54,183 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 09:08:54,183 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 09:08:54,185 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 09:08:54,186 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 09:08:54,188 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-01-12 09:08:54,212 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 09:08:54,213 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 09:08:54,215 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 09:08:54,218 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 09:08:54,218 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 09:08:54,218 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 09:08:54,218 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 09:08:54,218 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 09:08:54,219 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 09:08:54,219 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 09:08:54,219 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 09:08:54,219 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 09:08:54,219 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2019-01-12 09:08:54,219 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-01-12 09:08:54,220 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 09:08:54,221 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 09:08:54,221 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 09:08:54,221 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 09:08:54,222 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 09:08:54,222 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 09:08:54,222 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 09:08:54,222 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 09:08:54,222 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 09:08:54,222 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 09:08:54,225 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 09:08:54,225 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 09:08:54,225 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2019-01-12 09:08:54,225 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 09:08:54,225 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-01-12 09:08:54,226 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2019-01-12 09:08:54,226 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 -> b865bb4da04412be07ba7e2426d2224bb04a2953 [2019-01-12 09:08:54,287 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 09:08:54,299 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 09:08:54,303 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 09:08:54,305 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 09:08:54,305 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 09:08:54,306 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/double_req_bl_1230_true-unreach-call.c [2019-01-12 09:08:54,363 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d7e92e84/09d1a89aebc442e790195a73dacf2d5c/FLAGe6db7f698 [2019-01-12 09:08:54,838 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 09:08:54,839 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/double_req_bl_1230_true-unreach-call.c [2019-01-12 09:08:54,844 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d7e92e84/09d1a89aebc442e790195a73dacf2d5c/FLAGe6db7f698 [2019-01-12 09:08:55,179 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d7e92e84/09d1a89aebc442e790195a73dacf2d5c [2019-01-12 09:08:55,183 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 09:08:55,185 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 09:08:55,187 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 09:08:55,187 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 09:08:55,192 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 09:08:55,193 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:08:55" (1/1) ... [2019-01-12 09:08:55,197 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@152ee249 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:08:55, skipping insertion in model container [2019-01-12 09:08:55,198 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:08:55" (1/1) ... [2019-01-12 09:08:55,207 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 09:08:55,231 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 09:08:55,496 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:08:55,505 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 09:08:55,555 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:08:55,598 INFO L195 MainTranslator]: Completed translation [2019-01-12 09:08:55,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:08:55 WrapperNode [2019-01-12 09:08:55,598 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 09:08:55,599 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 09:08:55,599 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 09:08:55,599 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 09:08:55,609 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:08:55" (1/1) ... [2019-01-12 09:08:55,622 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:08:55" (1/1) ... [2019-01-12 09:08:55,657 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 09:08:55,657 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 09:08:55,657 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 09:08:55,657 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 09:08:55,749 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:08:55" (1/1) ... [2019-01-12 09:08:55,749 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:08:55" (1/1) ... [2019-01-12 09:08:55,757 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:08:55" (1/1) ... [2019-01-12 09:08:55,762 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:08:55" (1/1) ... [2019-01-12 09:08:55,783 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:08:55" (1/1) ... [2019-01-12 09:08:55,794 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:08:55" (1/1) ... [2019-01-12 09:08:55,800 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:08:55" (1/1) ... [2019-01-12 09:08:55,812 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 09:08:55,815 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 09:08:55,815 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 09:08:55,815 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 09:08:55,816 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:08:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 09:08:55,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2019-01-12 09:08:55,890 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 09:08:55,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-01-12 09:08:55,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 09:08:55,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 09:08:55,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 09:08:56,162 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:08:56,512 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:08:56,578 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 09:08:56,579 INFO L286 CfgBuilder]: Removed 16 assue(true) statements. [2019-01-12 09:08:56,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:08:56 BoogieIcfgContainer [2019-01-12 09:08:56,580 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 09:08:56,581 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 09:08:56,581 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 09:08:56,584 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 09:08:56,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 09:08:55" (1/3) ... [2019-01-12 09:08:56,586 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5790429b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:08:56, skipping insertion in model container [2019-01-12 09:08:56,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:08:55" (2/3) ... [2019-01-12 09:08:56,586 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5790429b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:08:56, skipping insertion in model container [2019-01-12 09:08:56,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:08:56" (3/3) ... [2019-01-12 09:08:56,588 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1230_true-unreach-call.c [2019-01-12 09:08:56,598 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 09:08:56,607 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 09:08:56,625 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 09:08:56,656 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 09:08:56,657 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 09:08:56,657 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 09:08:56,658 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 09:08:56,658 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 09:08:56,658 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 09:08:56,658 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 09:08:56,658 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 09:08:56,659 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 09:08:56,674 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2019-01-12 09:08:56,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-12 09:08:56,680 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:08:56,681 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:08:56,684 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:08:56,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:08:56,691 INFO L82 PathProgramCache]: Analyzing trace with hash -958093107, now seen corresponding path program 1 times [2019-01-12 09:08:56,696 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:08:56,696 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-01-12 09:08:56,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:08:56,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:08:56,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:08:56,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:08:56,800 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:08:56,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:08:56,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 09:08:56,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 09:08:56,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 09:08:56,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 09:08:56,829 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2019-01-12 09:08:56,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:08:56,848 INFO L93 Difference]: Finished difference Result 54 states and 84 transitions. [2019-01-12 09:08:56,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 09:08:56,850 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-01-12 09:08:56,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:08:56,861 INFO L225 Difference]: With dead ends: 54 [2019-01-12 09:08:56,861 INFO L226 Difference]: Without dead ends: 25 [2019-01-12 09:08:56,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 09:08:56,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-12 09:08:56,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-01-12 09:08:56,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-12 09:08:56,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2019-01-12 09:08:56,895 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 35 transitions. Word has length 10 [2019-01-12 09:08:56,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:08:56,896 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 35 transitions. [2019-01-12 09:08:56,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 09:08:56,896 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2019-01-12 09:08:56,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-12 09:08:56,897 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:08:56,897 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:08:56,897 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:08:56,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:08:56,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1001566992, now seen corresponding path program 1 times [2019-01-12 09:08:56,898 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:08:56,898 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-01-12 09:08:56,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:08:56,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:08:56,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:08:56,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:08:56,998 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:08:57,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:08:57,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:08:57,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:08:57,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:08:57,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:08:57,019 INFO L87 Difference]: Start difference. First operand 25 states and 35 transitions. Second operand 4 states. [2019-01-12 09:08:57,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:08:57,303 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2019-01-12 09:08:57,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:08:57,304 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-01-12 09:08:57,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:08:57,305 INFO L225 Difference]: With dead ends: 41 [2019-01-12 09:08:57,306 INFO L226 Difference]: Without dead ends: 36 [2019-01-12 09:08:57,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:08:57,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-12 09:08:57,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2019-01-12 09:08:57,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-12 09:08:57,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2019-01-12 09:08:57,315 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 11 [2019-01-12 09:08:57,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:08:57,316 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2019-01-12 09:08:57,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:08:57,316 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2019-01-12 09:08:57,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-12 09:08:57,317 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:08:57,317 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:08:57,317 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:08:57,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:08:57,319 INFO L82 PathProgramCache]: Analyzing trace with hash 502183504, now seen corresponding path program 1 times [2019-01-12 09:08:57,320 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:08:57,320 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-01-12 09:08:57,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:08:57,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:08:57,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:08:57,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:08:57,473 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:08:57,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:08:57,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:08:57,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:08:57,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:08:57,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:08:57,489 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 4 states. [2019-01-12 09:08:57,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:08:57,770 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2019-01-12 09:08:57,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:08:57,771 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-01-12 09:08:57,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:08:57,772 INFO L225 Difference]: With dead ends: 43 [2019-01-12 09:08:57,772 INFO L226 Difference]: Without dead ends: 38 [2019-01-12 09:08:57,773 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 [2019-01-12 09:08:57,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-12 09:08:57,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 27. [2019-01-12 09:08:57,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-12 09:08:57,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2019-01-12 09:08:57,779 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 12 [2019-01-12 09:08:57,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:08:57,779 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2019-01-12 09:08:57,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:08:57,780 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2019-01-12 09:08:57,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-12 09:08:57,781 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:08:57,781 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:08:57,781 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:08:57,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:08:57,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1951251627, now seen corresponding path program 1 times [2019-01-12 09:08:57,782 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:08:57,782 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-01-12 09:08:57,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:08:57,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:08:57,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:08:57,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:08:57,864 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:08:57,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:08:57,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:08:57,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:08:57,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:08:57,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:08:57,877 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 4 states. [2019-01-12 09:08:58,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:08:58,050 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2019-01-12 09:08:58,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:08:58,052 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-01-12 09:08:58,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:08:58,054 INFO L225 Difference]: With dead ends: 43 [2019-01-12 09:08:58,054 INFO L226 Difference]: Without dead ends: 38 [2019-01-12 09:08:58,054 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 [2019-01-12 09:08:58,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-12 09:08:58,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 27. [2019-01-12 09:08:58,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-12 09:08:58,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2019-01-12 09:08:58,059 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 13 [2019-01-12 09:08:58,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:08:58,060 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2019-01-12 09:08:58,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:08:58,060 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2019-01-12 09:08:58,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-12 09:08:58,061 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:08:58,061 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:08:58,061 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:08:58,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:08:58,062 INFO L82 PathProgramCache]: Analyzing trace with hash -555778251, now seen corresponding path program 1 times [2019-01-12 09:08:58,062 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:08:58,062 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-01-12 09:08:58,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:08:58,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:08:58,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:08:58,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:08:58,146 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:08:58,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:08:58,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:08:58,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:08:58,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:08:58,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:08:58,159 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 4 states. [2019-01-12 09:08:58,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:08:58,334 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2019-01-12 09:08:58,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:08:58,335 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-01-12 09:08:58,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:08:58,337 INFO L225 Difference]: With dead ends: 43 [2019-01-12 09:08:58,337 INFO L226 Difference]: Without dead ends: 38 [2019-01-12 09:08:58,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:08:58,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-12 09:08:58,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 27. [2019-01-12 09:08:58,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-12 09:08:58,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2019-01-12 09:08:58,344 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 14 [2019-01-12 09:08:58,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:08:58,344 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2019-01-12 09:08:58,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:08:58,345 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2019-01-12 09:08:58,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-12 09:08:58,345 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:08:58,346 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:08:58,346 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:08:58,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:08:58,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1219229111, now seen corresponding path program 1 times [2019-01-12 09:08:58,347 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:08:58,347 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-01-12 09:08:58,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:08:58,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:08:58,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:08:58,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:08:58,557 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:08:58,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:08:58,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 09:08:58,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 09:08:58,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 09:08:58,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 09:08:58,574 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 6 states. [2019-01-12 09:08:58,919 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-12 09:08:59,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:08:59,011 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2019-01-12 09:08:59,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 09:08:59,014 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-01-12 09:08:59,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:08:59,016 INFO L225 Difference]: With dead ends: 36 [2019-01-12 09:08:59,016 INFO L226 Difference]: Without dead ends: 27 [2019-01-12 09:08:59,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 09:08:59,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-12 09:08:59,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2019-01-12 09:08:59,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-12 09:08:59,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2019-01-12 09:08:59,021 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 14 [2019-01-12 09:08:59,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:08:59,022 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-01-12 09:08:59,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 09:08:59,022 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2019-01-12 09:08:59,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-12 09:08:59,023 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:08:59,023 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:08:59,023 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:08:59,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:08:59,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1012428811, now seen corresponding path program 1 times [2019-01-12 09:08:59,024 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:08:59,024 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-01-12 09:08:59,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:08:59,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:08:59,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:08:59,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:08:59,133 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:08:59,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:08:59,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:08:59,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:08:59,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:08:59,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:08:59,146 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand 4 states. [2019-01-12 09:08:59,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:08:59,242 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2019-01-12 09:08:59,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:08:59,243 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-01-12 09:08:59,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:08:59,244 INFO L225 Difference]: With dead ends: 41 [2019-01-12 09:08:59,244 INFO L226 Difference]: Without dead ends: 36 [2019-01-12 09:08:59,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:08:59,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-12 09:08:59,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2019-01-12 09:08:59,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-12 09:08:59,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2019-01-12 09:08:59,251 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 16 [2019-01-12 09:08:59,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:08:59,251 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-01-12 09:08:59,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:08:59,252 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2019-01-12 09:08:59,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-12 09:08:59,252 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:08:59,253 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:08:59,253 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:08:59,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:08:59,253 INFO L82 PathProgramCache]: Analyzing trace with hash 874917212, now seen corresponding path program 1 times [2019-01-12 09:08:59,254 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:08:59,254 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-01-12 09:08:59,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:08:59,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:08:59,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:08:59,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:08:59,373 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:08:59,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:08:59,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:08:59,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:08:59,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:08:59,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:08:59,390 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 4 states. [2019-01-12 09:08:59,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:08:59,493 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2019-01-12 09:08:59,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:08:59,495 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-01-12 09:08:59,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:08:59,496 INFO L225 Difference]: With dead ends: 43 [2019-01-12 09:08:59,496 INFO L226 Difference]: Without dead ends: 38 [2019-01-12 09:08:59,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:08:59,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-12 09:08:59,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 27. [2019-01-12 09:08:59,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-12 09:08:59,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2019-01-12 09:08:59,504 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 17 [2019-01-12 09:08:59,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:08:59,504 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-01-12 09:08:59,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:08:59,504 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2019-01-12 09:08:59,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-12 09:08:59,506 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:08:59,506 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:08:59,507 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:08:59,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:08:59,507 INFO L82 PathProgramCache]: Analyzing trace with hash -356841937, now seen corresponding path program 1 times [2019-01-12 09:08:59,507 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:08:59,507 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-01-12 09:08:59,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:08:59,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:08:59,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:08:59,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:08:59,825 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:08:59,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:08:59,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 09:08:59,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 09:08:59,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 09:08:59,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-12 09:08:59,837 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 7 states. [2019-01-12 09:09:00,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:09:00,023 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2019-01-12 09:09:00,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 09:09:00,024 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-01-12 09:09:00,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:09:00,025 INFO L225 Difference]: With dead ends: 32 [2019-01-12 09:09:00,025 INFO L226 Difference]: Without dead ends: 23 [2019-01-12 09:09:00,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-01-12 09:09:00,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-12 09:09:00,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-01-12 09:09:00,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-12 09:09:00,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2019-01-12 09:09:00,031 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 18 [2019-01-12 09:09:00,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:09:00,031 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2019-01-12 09:09:00,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 09:09:00,032 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2019-01-12 09:09:00,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-12 09:09:00,032 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:09:00,032 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:09:00,033 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:09:00,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:09:00,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1049576048, now seen corresponding path program 1 times [2019-01-12 09:09:00,033 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:09:00,034 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-01-12 09:09:00,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:09:00,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:09:00,108 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:09:00,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:09:00,134 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:09:00,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:09:00,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:09:00,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:09:00,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:09:00,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:09:00,146 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand 4 states. [2019-01-12 09:09:00,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:09:00,216 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2019-01-12 09:09:00,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:09:00,223 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-01-12 09:09:00,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:09:00,224 INFO L225 Difference]: With dead ends: 32 [2019-01-12 09:09:00,224 INFO L226 Difference]: Without dead ends: 25 [2019-01-12 09:09:00,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:09:00,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-12 09:09:00,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2019-01-12 09:09:00,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-12 09:09:00,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2019-01-12 09:09:00,232 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 18 [2019-01-12 09:09:00,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:09:00,232 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-01-12 09:09:00,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:09:00,232 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2019-01-12 09:09:00,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-12 09:09:00,233 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:09:00,233 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:09:00,234 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:09:00,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:09:00,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1983383519, now seen corresponding path program 1 times [2019-01-12 09:09:00,234 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:09:00,234 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2019-01-12 09:09:00,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:09:00,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:09:00,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:09:00,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:09:00,339 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:09:00,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:09:00,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:09:00,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:09:00,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:09:00,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:09:00,350 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 4 states. [2019-01-12 09:09:00,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:09:00,428 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2019-01-12 09:09:00,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:09:00,429 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-01-12 09:09:00,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:09:00,429 INFO L225 Difference]: With dead ends: 32 [2019-01-12 09:09:00,430 INFO L226 Difference]: Without dead ends: 25 [2019-01-12 09:09:00,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:09:00,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-12 09:09:00,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2019-01-12 09:09:00,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-12 09:09:00,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2019-01-12 09:09:00,434 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 19 [2019-01-12 09:09:00,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:09:00,435 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2019-01-12 09:09:00,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:09:00,435 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2019-01-12 09:09:00,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-12 09:09:00,435 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:09:00,436 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:09:00,436 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:09:00,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:09:00,436 INFO L82 PathProgramCache]: Analyzing trace with hash -208376157, now seen corresponding path program 1 times [2019-01-12 09:09:00,437 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:09:00,437 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-01-12 09:09:00,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:09:00,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:09:00,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:09:00,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:09:00,587 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:09:00,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:09:00,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 09:09:00,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 09:09:00,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 09:09:00,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 09:09:00,603 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 6 states. [2019-01-12 09:09:00,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:09:00,735 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2019-01-12 09:09:00,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 09:09:00,735 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-01-12 09:09:00,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:09:00,735 INFO L225 Difference]: With dead ends: 23 [2019-01-12 09:09:00,736 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 09:09:00,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 09:09:00,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 09:09:00,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 09:09:00,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 09:09:00,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 09:09:00,737 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2019-01-12 09:09:00,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:09:00,737 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 09:09:00,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 09:09:00,737 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 09:09:00,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 09:09:00,742 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 09:09:01,090 INFO L448 ceAbstractionStarter]: For program point L65(lines 65 68) no Hoare annotation was computed. [2019-01-12 09:09:01,090 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 09:09:01,091 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 09:09:01,091 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 09:09:01,091 INFO L448 ceAbstractionStarter]: For program point L20-1(lines 20 25) no Hoare annotation was computed. [2019-01-12 09:09:01,092 INFO L444 ceAbstractionStarter]: At program point L20-2(lines 20 25) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))) (and (= ULTIMATE.start_fmin_double_~y .cse0) (= ULTIMATE.start_fmin_double_~x .cse0))) [2019-01-12 09:09:01,092 INFO L448 ceAbstractionStarter]: For program point L20-3(lines 17 42) no Hoare annotation was computed. [2019-01-12 09:09:01,092 INFO L444 ceAbstractionStarter]: At program point L16(line 16) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))) (and (= ULTIMATE.start_fmin_double_~y .cse0) (= (bvadd |ULTIMATE.start_isnan_double_#res| (_ bv4294967295 32)) (_ bv0 32)) (= |ULTIMATE.start_fmin_double_#res| .cse0))) [2019-01-12 09:09:01,092 INFO L448 ceAbstractionStarter]: For program point L20-5(lines 20 25) no Hoare annotation was computed. [2019-01-12 09:09:01,092 INFO L444 ceAbstractionStarter]: At program point L20-6(lines 20 25) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))) (and (= ULTIMATE.start_fmin_double_~y .cse0) (= ULTIMATE.start_fmin_double_~x .cse0))) [2019-01-12 09:09:01,092 INFO L448 ceAbstractionStarter]: For program point L45(lines 45 46) no Hoare annotation was computed. [2019-01-12 09:09:01,092 INFO L448 ceAbstractionStarter]: For program point L20-7(lines 17 42) no Hoare annotation was computed. [2019-01-12 09:09:01,093 INFO L444 ceAbstractionStarter]: At program point L41(lines 17 42) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))) (and (= ULTIMATE.start_fmin_double_~y .cse0) (= ULTIMATE.start_fmin_double_~x .cse0))) [2019-01-12 09:09:01,093 INFO L444 ceAbstractionStarter]: At program point L41-1(lines 17 42) the Hoare annotation is: (let ((.cse1 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))) (let ((.cse0 (= ULTIMATE.start_fmin_double_~y .cse1))) (or (and .cse0 (= (bvadd |ULTIMATE.start___fpclassify_double_#res| (_ bv4294967292 32)) (_ bv0 32))) (and .cse0 (= (bvadd |ULTIMATE.start___fpclassify_double_#res| (_ bv4294967295 32)) (_ bv0 32))) (and .cse0 (= (bvadd |ULTIMATE.start___fpclassify_double_#res| (_ bv4294967294 32)) (_ bv0 32))) (and .cse0 (= (bvadd |ULTIMATE.start___fpclassify_double_#res| (_ bv4294967293 32)) (_ bv0 32))) (and .cse0 (= ULTIMATE.start_fmin_double_~x .cse1))))) [2019-01-12 09:09:01,093 INFO L451 ceAbstractionStarter]: At program point L70(lines 53 71) the Hoare annotation is: true [2019-01-12 09:09:01,093 INFO L448 ceAbstractionStarter]: For program point L37(lines 37 41) no Hoare annotation was computed. [2019-01-12 09:09:01,093 INFO L448 ceAbstractionStarter]: For program point L37-1(lines 37 41) no Hoare annotation was computed. [2019-01-12 09:09:01,093 INFO L448 ceAbstractionStarter]: For program point L66(line 66) no Hoare annotation was computed. [2019-01-12 09:09:01,094 INFO L448 ceAbstractionStarter]: For program point L33(lines 33 41) no Hoare annotation was computed. [2019-01-12 09:09:01,094 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 09:09:01,094 INFO L448 ceAbstractionStarter]: For program point L33-1(lines 33 41) no Hoare annotation was computed. [2019-01-12 09:09:01,094 INFO L448 ceAbstractionStarter]: For program point L50(line 50) no Hoare annotation was computed. [2019-01-12 09:09:01,094 INFO L448 ceAbstractionStarter]: For program point L50-2(line 50) no Hoare annotation was computed. [2019-01-12 09:09:01,094 INFO L444 ceAbstractionStarter]: At program point L50-3(lines 44 51) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))) (and (= ULTIMATE.start_fmin_double_~y .cse0) (= |ULTIMATE.start_fmin_double_#res| .cse0))) [2019-01-12 09:09:01,095 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 66) no Hoare annotation was computed. [2019-01-12 09:09:01,095 INFO L448 ceAbstractionStarter]: For program point L30(lines 30 41) no Hoare annotation was computed. [2019-01-12 09:09:01,095 INFO L448 ceAbstractionStarter]: For program point L30-1(lines 30 41) no Hoare annotation was computed. [2019-01-12 09:09:01,095 INFO L448 ceAbstractionStarter]: For program point L47(lines 47 48) no Hoare annotation was computed. [2019-01-12 09:09:01,103 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:09:01,104 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:09:01,107 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:09:01,107 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:09:01,108 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:09:01,109 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:09:01,109 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:09:01,110 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:09:01,110 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:09:01,110 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:09:01,111 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:09:01,111 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:09:01,112 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:09:01,112 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:09:01,112 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:09:01,113 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:09:01,113 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:09:01,113 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:09:01,114 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:09:01,114 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:09:01,114 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:09:01,115 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:09:01,115 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:09:01,115 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:09:01,116 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:09:01,116 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:09:01,116 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:09:01,117 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:09:01,117 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:09:01,117 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:09:01,117 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:09:01,118 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:09:01,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 09:09:01 BoogieIcfgContainer [2019-01-12 09:09:01,120 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 09:09:01,120 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 09:09:01,120 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 09:09:01,121 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 09:09:01,121 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:08:56" (3/4) ... [2019-01-12 09:09:01,125 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 09:09:01,138 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2019-01-12 09:09:01,138 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-01-12 09:09:01,138 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-12 09:09:01,164 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && \result == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) [2019-01-12 09:09:01,164 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && ~bvadd64(\result, 4294967295bv32) == 0bv32) && \result == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) [2019-01-12 09:09:01,165 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && ~bvadd64(\result, 4294967292bv32) == 0bv32) || (y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && ~bvadd64(\result, 4294967295bv32) == 0bv32)) || (y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && ~bvadd64(\result, 4294967294bv32) == 0bv32)) || (y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && ~bvadd64(\result, 4294967293bv32) == 0bv32)) || (y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) [2019-01-12 09:09:01,220 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 09:09:01,223 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 09:09:01,225 INFO L168 Benchmark]: Toolchain (without parser) took 6040.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 947.3 MB in the beginning and 841.7 MB in the end (delta: 105.6 MB). Peak memory consumption was 243.0 MB. Max. memory is 11.5 GB. [2019-01-12 09:09:01,226 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:09:01,226 INFO L168 Benchmark]: CACSL2BoogieTranslator took 412.24 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-12 09:09:01,227 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.82 ms. Allocated memory is still 1.0 GB. Free memory was 936.6 MB in the beginning and 931.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-12 09:09:01,227 INFO L168 Benchmark]: Boogie Preprocessor took 157.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -187.6 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. [2019-01-12 09:09:01,228 INFO L168 Benchmark]: RCFGBuilder took 765.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-01-12 09:09:01,229 INFO L168 Benchmark]: TraceAbstraction took 4539.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 848.5 MB in the end (delta: 252.3 MB). Peak memory consumption was 252.3 MB. Max. memory is 11.5 GB. [2019-01-12 09:09:01,230 INFO L168 Benchmark]: Witness Printer took 103.30 ms. Allocated memory is still 1.2 GB. Free memory was 848.5 MB in the beginning and 841.7 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-12 09:09:01,239 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 412.24 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 57.82 ms. Allocated memory is still 1.0 GB. Free memory was 936.6 MB in the beginning and 931.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 157.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -187.6 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 765.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4539.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 848.5 MB in the end (delta: 252.3 MB). Peak memory consumption was 252.3 MB. Max. memory is 11.5 GB. * Witness Printer took 103.30 ms. Allocated memory is still 1.2 GB. Free memory was 848.5 MB in the beginning and 841.7 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 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: 66]: 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: 44]: Loop Invariant [2019-01-12 09:09:01,248 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:09:01,249 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:09:01,249 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:09:01,254 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && \result == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 16]: Loop Invariant [2019-01-12 09:09:01,254 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:09:01,255 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:09:01,255 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:09:01,256 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && ~bvadd64(\result, 4294967295bv32) == 0bv32) && \result == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 53]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 20]: Loop Invariant [2019-01-12 09:09:01,256 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:09:01,256 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:09:01,257 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:09:01,257 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 17]: Loop Invariant [2019-01-12 09:09:01,257 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:09:01,257 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:09:01,257 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:09:01,266 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:09:01,266 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:09:01,266 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:09:01,268 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:09:01,268 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:09:01,269 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:09:01,269 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:09:01,269 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:09:01,269 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((((y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && ~bvadd64(\result, 4294967292bv32) == 0bv32) || (y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && ~bvadd64(\result, 4294967295bv32) == 0bv32)) || (y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && ~bvadd64(\result, 4294967294bv32) == 0bv32)) || (y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && ~bvadd64(\result, 4294967293bv32) == 0bv32)) || (y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) - InvariantResult [Line: 20]: Loop Invariant [2019-01-12 09:09:01,270 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:09:01,270 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:09:01,270 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:09:01,270 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 17]: Loop Invariant [2019-01-12 09:09:01,276 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:09:01,277 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:09:01,277 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:09:01,277 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 28 locations, 1 error locations. SAFE Result, 4.4s OverallTime, 12 OverallIterations, 1 TraceHistogramMax, 2.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 413 SDtfs, 132 SDslu, 682 SDs, 0 SdLazy, 219 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 187 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 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.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 181 NumberOfCodeBlocks, 181 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 169 ConstructedInterpolants, 0 QuantifiedInterpolants, 6567 SizeOfPredicates, 32 NumberOfNonLiveVariables, 678 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...