./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/float-newlib/double_req_bl_1251b_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/float-newlib/double_req_bl_1251b_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 26bba4d307ba1cab1a3fe043c826d85928a7cf56 ......................................................................................................................................................................................................................................................................................................................................................... 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_1251b_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 26bba4d307ba1cab1a3fe043c826d85928a7cf56 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 03:58:52,655 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 03:58:52,657 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 03:58:52,670 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 03:58:52,670 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 03:58:52,671 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 03:58:52,673 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 03:58:52,675 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 03:58:52,676 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 03:58:52,678 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 03:58:52,678 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 03:58:52,679 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 03:58:52,680 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 03:58:52,681 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 03:58:52,682 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 03:58:52,683 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 03:58:52,684 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 03:58:52,686 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 03:58:52,688 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 03:58:52,690 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 03:58:52,691 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 03:58:52,692 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 03:58:52,695 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 03:58:52,695 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 03:58:52,695 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 03:58:52,696 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 03:58:52,697 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 03:58:52,698 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 03:58:52,699 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 03:58:52,700 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 03:58:52,701 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 03:58:52,701 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 03:58:52,702 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 03:58:52,702 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 03:58:52,703 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 03:58:52,704 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 03:58:52,705 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 03:58:52,722 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 03:58:52,724 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 03:58:52,725 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 03:58:52,726 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 03:58:52,726 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 03:58:52,726 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 03:58:52,726 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 03:58:52,726 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 03:58:52,727 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 03:58:52,727 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 03:58:52,727 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 03:58:52,727 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 03:58:52,727 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 03:58:52,727 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 03:58:52,728 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 03:58:52,728 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 03:58:52,728 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 03:58:52,728 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 03:58:52,728 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 03:58:52,729 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 03:58:52,729 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 03:58:52,729 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 03:58:52,729 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 03:58:52,729 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 03:58:52,729 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 03:58:52,730 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 03:58:52,730 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 03:58:52,730 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 03:58:52,730 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 -> 26bba4d307ba1cab1a3fe043c826d85928a7cf56 [2018-12-31 03:58:52,765 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 03:58:52,780 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 03:58:52,784 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 03:58:52,785 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 03:58:52,786 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 03:58:52,786 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/double_req_bl_1251b_true-unreach-call.c [2018-12-31 03:58:52,848 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52bc535c6/bf50f872495143bda941be01356456bd/FLAGcdb814c6d [2018-12-31 03:58:53,270 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 03:58:53,270 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/double_req_bl_1251b_true-unreach-call.c [2018-12-31 03:58:53,277 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52bc535c6/bf50f872495143bda941be01356456bd/FLAGcdb814c6d [2018-12-31 03:58:53,651 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52bc535c6/bf50f872495143bda941be01356456bd [2018-12-31 03:58:53,656 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 03:58:53,658 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 03:58:53,659 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 03:58:53,659 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 03:58:53,664 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 03:58:53,666 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 03:58:53" (1/1) ... [2018-12-31 03:58:53,669 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a4ffb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:53, skipping insertion in model container [2018-12-31 03:58:53,669 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 03:58:53" (1/1) ... [2018-12-31 03:58:53,680 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 03:58:53,702 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 03:58:53,918 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 03:58:53,922 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 03:58:53,951 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 03:58:53,975 INFO L195 MainTranslator]: Completed translation [2018-12-31 03:58:53,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:53 WrapperNode [2018-12-31 03:58:53,976 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 03:58:53,977 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 03:58:53,977 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 03:58:53,977 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 03:58:53,987 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:53" (1/1) ... [2018-12-31 03:58:53,999 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:53" (1/1) ... [2018-12-31 03:58:54,031 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 03:58:54,031 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 03:58:54,032 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 03:58:54,032 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 03:58:54,114 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:53" (1/1) ... [2018-12-31 03:58:54,115 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:53" (1/1) ... [2018-12-31 03:58:54,118 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:53" (1/1) ... [2018-12-31 03:58:54,124 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:53" (1/1) ... [2018-12-31 03:58:54,146 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:53" (1/1) ... [2018-12-31 03:58:54,155 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:53" (1/1) ... [2018-12-31 03:58:54,157 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:53" (1/1) ... [2018-12-31 03:58:54,160 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 03:58:54,161 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 03:58:54,161 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 03:58:54,161 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 03:58:54,163 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 03:58:54,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 03:58:54,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-12-31 03:58:54,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 03:58:54,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 03:58:54,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-31 03:58:54,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 03:58:55,068 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 03:58:55,068 INFO L280 CfgBuilder]: Removed 16 assue(true) statements. [2018-12-31 03:58:55,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:58:55 BoogieIcfgContainer [2018-12-31 03:58:55,069 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 03:58:55,070 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 03:58:55,070 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 03:58:55,073 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 03:58:55,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 03:58:53" (1/3) ... [2018-12-31 03:58:55,074 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e62d7bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 03:58:55, skipping insertion in model container [2018-12-31 03:58:55,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:53" (2/3) ... [2018-12-31 03:58:55,075 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e62d7bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 03:58:55, skipping insertion in model container [2018-12-31 03:58:55,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:58:55" (3/3) ... [2018-12-31 03:58:55,077 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1251b_true-unreach-call.c [2018-12-31 03:58:55,088 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 03:58:55,097 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 03:58:55,116 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 03:58:55,146 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 03:58:55,147 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 03:58:55,147 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 03:58:55,147 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 03:58:55,147 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 03:58:55,148 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 03:58:55,148 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 03:58:55,148 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 03:58:55,148 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 03:58:55,164 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-12-31 03:58:55,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-31 03:58:55,171 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:58:55,172 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:58:55,174 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:58:55,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:58:55,179 INFO L82 PathProgramCache]: Analyzing trace with hash -124750094, now seen corresponding path program 1 times [2018-12-31 03:58:55,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 03:58:55,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 03:58:55,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:58:55,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:58:55,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:58:55,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:58:55,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:58:55,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:58:55,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 03:58:55,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 03:58:55,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 03:58:55,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 03:58:55,333 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2018-12-31 03:58:55,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:58:55,352 INFO L93 Difference]: Finished difference Result 56 states and 87 transitions. [2018-12-31 03:58:55,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 03:58:55,353 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-12-31 03:58:55,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:58:55,364 INFO L225 Difference]: With dead ends: 56 [2018-12-31 03:58:55,364 INFO L226 Difference]: Without dead ends: 26 [2018-12-31 03:58:55,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 03:58:55,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-31 03:58:55,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-31 03:58:55,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-31 03:58:55,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2018-12-31 03:58:55,403 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 11 [2018-12-31 03:58:55,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:58:55,403 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 36 transitions. [2018-12-31 03:58:55,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 03:58:55,403 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2018-12-31 03:58:55,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-31 03:58:55,404 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:58:55,404 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:58:55,405 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:58:55,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:58:55,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1352831344, now seen corresponding path program 1 times [2018-12-31 03:58:55,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 03:58:55,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 03:58:55,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:58:55,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:58:55,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:58:55,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:58:55,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:58:55,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:58:55,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 03:58:55,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 03:58:55,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 03:58:55,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 03:58:55,553 INFO L87 Difference]: Start difference. First operand 26 states and 36 transitions. Second operand 4 states. [2018-12-31 03:58:55,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:58:55,787 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2018-12-31 03:58:55,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 03:58:55,788 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-12-31 03:58:55,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:58:55,789 INFO L225 Difference]: With dead ends: 40 [2018-12-31 03:58:55,790 INFO L226 Difference]: Without dead ends: 36 [2018-12-31 03:58:55,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 03:58:55,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-31 03:58:55,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2018-12-31 03:58:55,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-31 03:58:55,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2018-12-31 03:58:55,797 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 12 [2018-12-31 03:58:55,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:58:55,798 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2018-12-31 03:58:55,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 03:58:55,798 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2018-12-31 03:58:55,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-31 03:58:55,799 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:58:55,799 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:58:55,799 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:58:55,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:58:55,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1045511114, now seen corresponding path program 1 times [2018-12-31 03:58:55,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 03:58:55,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 03:58:55,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:58:55,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:58:55,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:58:55,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:58:55,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:58:55,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:58:55,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 03:58:55,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 03:58:55,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 03:58:55,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 03:58:55,897 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand 4 states. [2018-12-31 03:58:56,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:58:56,004 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2018-12-31 03:58:56,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 03:58:56,005 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-12-31 03:58:56,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:58:56,006 INFO L225 Difference]: With dead ends: 42 [2018-12-31 03:58:56,006 INFO L226 Difference]: Without dead ends: 38 [2018-12-31 03:58:56,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 03:58:56,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-31 03:58:56,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2018-12-31 03:58:56,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-31 03:58:56,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2018-12-31 03:58:56,015 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 15 [2018-12-31 03:58:56,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:58:56,015 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2018-12-31 03:58:56,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 03:58:56,016 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2018-12-31 03:58:56,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-31 03:58:56,016 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:58:56,017 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:58:56,018 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:58:56,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:58:56,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1102769416, now seen corresponding path program 1 times [2018-12-31 03:58:56,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 03:58:56,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 03:58:56,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:58:56,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:58:56,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:58:56,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 03:58:56,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 03:58:56,102 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 03:58:56,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 03:58:56 BoogieIcfgContainer [2018-12-31 03:58:56,131 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 03:58:56,132 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 03:58:56,132 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 03:58:56,132 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 03:58:56,133 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:58:55" (3/4) ... [2018-12-31 03:58:56,136 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-31 03:58:56,136 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 03:58:56,137 INFO L168 Benchmark]: Toolchain (without parser) took 2480.54 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.1 MB). Free memory was 947.3 MB in the beginning and 1.0 GB in the end (delta: -83.2 MB). Peak memory consumption was 26.9 MB. Max. memory is 11.5 GB. [2018-12-31 03:58:56,139 INFO L168 Benchmark]: CDTParser took 0.17 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. [2018-12-31 03:58:56,140 INFO L168 Benchmark]: CACSL2BoogieTranslator took 317.32 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. [2018-12-31 03:58:56,141 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.26 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. [2018-12-31 03:58:56,142 INFO L168 Benchmark]: Boogie Preprocessor took 129.21 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.1 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -166.9 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. [2018-12-31 03:58:56,143 INFO L168 Benchmark]: RCFGBuilder took 907.77 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. [2018-12-31 03:58:56,144 INFO L168 Benchmark]: TraceAbstraction took 1061.55 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.7 MB). Peak memory consumption was 47.7 MB. Max. memory is 11.5 GB. [2018-12-31 03:58:56,145 INFO L168 Benchmark]: Witness Printer took 4.53 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 03:58:56,150 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 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 317.32 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 54.26 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 129.21 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.1 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -166.9 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 907.77 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1061.55 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.7 MB). Peak memory consumption was 47.7 MB. Max. memory is 11.5 GB. * Witness Printer took 4.53 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 78]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 77, overapproximation of someBinaryArithmeticDOUBLEoperation at line 65. Possible FailurePath: [L64] double x = __VERIFIER_nondet_double(); [L65] double y = 0.0 / 0.0; [L16] return x != x; [L72] COND TRUE !isnan_double(x) [L27] __uint32_t msw, lsw; [L30] ieee_double_shape_type ew_u; [L31] ew_u.value = (x) [L32] EXPR ew_u.parts.msw [L32] (msw) = ew_u.parts.msw [L33] EXPR ew_u.parts.lsw [L33] (lsw) = ew_u.parts.lsw [L36-L37] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) [L39-L40] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) [L42-L43] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) [L46-L47] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L50] return 0; [L55] COND TRUE __fpclassify_double(x) == 0 [L56] return y; [L74] double res = fmax_double(x, y); [L77] COND TRUE res != x [L78] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 30 locations, 1 error locations. UNSAFE Result, 0.9s OverallTime, 4 OverallIterations, 1 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 121 SDtfs, 20 SDslu, 118 SDs, 0 SdLazy, 38 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred 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, 18 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 53 NumberOfCodeBlocks, 53 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 35 ConstructedInterpolants, 0 QuantifiedInterpolants, 517 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-2e94e6a [2018-12-31 03:58:58,614 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 03:58:58,616 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 03:58:58,634 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 03:58:58,634 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 03:58:58,635 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 03:58:58,637 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 03:58:58,639 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 03:58:58,641 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 03:58:58,642 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 03:58:58,643 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 03:58:58,644 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 03:58:58,645 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 03:58:58,646 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 03:58:58,648 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 03:58:58,648 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 03:58:58,649 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 03:58:58,652 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 03:58:58,654 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 03:58:58,656 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 03:58:58,658 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 03:58:58,659 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 03:58:58,662 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 03:58:58,662 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 03:58:58,663 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 03:58:58,664 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 03:58:58,665 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 03:58:58,666 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 03:58:58,667 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 03:58:58,669 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 03:58:58,669 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 03:58:58,670 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 03:58:58,670 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 03:58:58,670 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 03:58:58,672 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 03:58:58,673 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 03:58:58,673 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-12-31 03:58:58,701 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 03:58:58,702 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 03:58:58,704 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 03:58:58,704 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 03:58:58,704 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 03:58:58,704 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 03:58:58,705 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 03:58:58,707 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 03:58:58,707 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 03:58:58,707 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 03:58:58,707 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 03:58:58,707 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 03:58:58,708 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-31 03:58:58,708 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-31 03:58:58,709 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 03:58:58,709 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 03:58:58,709 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 03:58:58,709 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 03:58:58,710 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 03:58:58,710 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 03:58:58,710 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 03:58:58,710 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 03:58:58,710 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 03:58:58,711 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 03:58:58,713 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 03:58:58,714 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 03:58:58,714 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-12-31 03:58:58,714 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 03:58:58,714 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-31 03:58:58,715 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-31 03:58:58,715 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 -> 26bba4d307ba1cab1a3fe043c826d85928a7cf56 [2018-12-31 03:58:58,778 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 03:58:58,796 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 03:58:58,803 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 03:58:58,805 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 03:58:58,805 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 03:58:58,806 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/double_req_bl_1251b_true-unreach-call.c [2018-12-31 03:58:58,881 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d78236e4c/744c2cd6e539495fa323e7fb66632139/FLAG448b0de09 [2018-12-31 03:58:59,369 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 03:58:59,370 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/double_req_bl_1251b_true-unreach-call.c [2018-12-31 03:58:59,377 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d78236e4c/744c2cd6e539495fa323e7fb66632139/FLAG448b0de09 [2018-12-31 03:58:59,722 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d78236e4c/744c2cd6e539495fa323e7fb66632139 [2018-12-31 03:58:59,726 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 03:58:59,728 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 03:58:59,729 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 03:58:59,729 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 03:58:59,733 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 03:58:59,734 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 03:58:59" (1/1) ... [2018-12-31 03:58:59,737 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a863a5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:59, skipping insertion in model container [2018-12-31 03:58:59,737 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 03:58:59" (1/1) ... [2018-12-31 03:58:59,746 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 03:58:59,771 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 03:59:00,011 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 03:59:00,018 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 03:59:00,063 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 03:59:00,103 INFO L195 MainTranslator]: Completed translation [2018-12-31 03:59:00,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:59:00 WrapperNode [2018-12-31 03:59:00,103 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 03:59:00,105 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 03:59:00,105 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 03:59:00,105 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 03:59:00,115 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:59:00" (1/1) ... [2018-12-31 03:59:00,126 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:59:00" (1/1) ... [2018-12-31 03:59:00,154 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 03:59:00,155 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 03:59:00,155 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 03:59:00,155 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 03:59:00,238 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:59:00" (1/1) ... [2018-12-31 03:59:00,239 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:59:00" (1/1) ... [2018-12-31 03:59:00,244 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:59:00" (1/1) ... [2018-12-31 03:59:00,244 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:59:00" (1/1) ... [2018-12-31 03:59:00,265 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:59:00" (1/1) ... [2018-12-31 03:59:00,271 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:59:00" (1/1) ... [2018-12-31 03:59:00,274 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:59:00" (1/1) ... [2018-12-31 03:59:00,279 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 03:59:00,280 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 03:59:00,280 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 03:59:00,280 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 03:59:00,282 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:59:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 03:59:00,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-12-31 03:59:00,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 03:59:00,346 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-12-31 03:59:00,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 03:59:00,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 03:59:00,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 03:59:00,686 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:59:00,985 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:59:01,019 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 03:59:01,020 INFO L280 CfgBuilder]: Removed 16 assue(true) statements. [2018-12-31 03:59:01,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:59:01 BoogieIcfgContainer [2018-12-31 03:59:01,020 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 03:59:01,021 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 03:59:01,022 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 03:59:01,025 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 03:59:01,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 03:58:59" (1/3) ... [2018-12-31 03:59:01,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15ed9bbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 03:59:01, skipping insertion in model container [2018-12-31 03:59:01,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:59:00" (2/3) ... [2018-12-31 03:59:01,027 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15ed9bbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 03:59:01, skipping insertion in model container [2018-12-31 03:59:01,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:59:01" (3/3) ... [2018-12-31 03:59:01,030 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1251b_true-unreach-call.c [2018-12-31 03:59:01,039 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 03:59:01,049 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 03:59:01,069 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 03:59:01,104 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 03:59:01,104 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 03:59:01,105 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 03:59:01,105 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 03:59:01,105 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 03:59:01,105 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 03:59:01,105 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 03:59:01,106 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 03:59:01,106 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 03:59:01,120 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-12-31 03:59:01,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-31 03:59:01,126 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:59:01,128 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:59:01,130 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:59:01,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:59:01,136 INFO L82 PathProgramCache]: Analyzing trace with hash -124750094, now seen corresponding path program 1 times [2018-12-31 03:59:01,140 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:59:01,141 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-12-31 03:59:01,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:59:01,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:59:01,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:59:01,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:59:01,233 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:59:01,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:59:01,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 03:59:01,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 03:59:01,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 03:59:01,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 03:59:01,276 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2018-12-31 03:59:01,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:59:01,295 INFO L93 Difference]: Finished difference Result 56 states and 87 transitions. [2018-12-31 03:59:01,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 03:59:01,297 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-12-31 03:59:01,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:59:01,309 INFO L225 Difference]: With dead ends: 56 [2018-12-31 03:59:01,309 INFO L226 Difference]: Without dead ends: 26 [2018-12-31 03:59:01,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 03:59:01,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-31 03:59:01,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-31 03:59:01,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-31 03:59:01,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2018-12-31 03:59:01,348 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 11 [2018-12-31 03:59:01,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:59:01,349 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 36 transitions. [2018-12-31 03:59:01,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 03:59:01,349 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2018-12-31 03:59:01,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-31 03:59:01,350 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:59:01,350 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:59:01,350 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:59:01,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:59:01,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1352831344, now seen corresponding path program 1 times [2018-12-31 03:59:01,353 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:59:01,353 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-12-31 03:59:01,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:59:01,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:59:01,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:59:01,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:59:01,496 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:59:01,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:59:01,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 03:59:01,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 03:59:01,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 03:59:01,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 03:59:01,520 INFO L87 Difference]: Start difference. First operand 26 states and 36 transitions. Second operand 4 states. [2018-12-31 03:59:01,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:59:01,814 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2018-12-31 03:59:01,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 03:59:01,815 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-12-31 03:59:01,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:59:01,817 INFO L225 Difference]: With dead ends: 40 [2018-12-31 03:59:01,817 INFO L226 Difference]: Without dead ends: 36 [2018-12-31 03:59:01,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 03:59:01,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-31 03:59:01,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2018-12-31 03:59:01,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-31 03:59:01,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2018-12-31 03:59:01,831 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 12 [2018-12-31 03:59:01,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:59:01,831 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2018-12-31 03:59:01,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 03:59:01,831 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2018-12-31 03:59:01,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-31 03:59:01,833 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:59:01,833 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:59:01,833 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:59:01,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:59:01,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1913129681, now seen corresponding path program 1 times [2018-12-31 03:59:01,834 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:59:01,834 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-12-31 03:59:01,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:59:01,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:59:01,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:59:01,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:59:01,929 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:59:01,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:59:01,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 03:59:01,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 03:59:01,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 03:59:01,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 03:59:01,943 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand 4 states. [2018-12-31 03:59:02,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:59:02,172 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2018-12-31 03:59:02,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 03:59:02,174 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-12-31 03:59:02,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:59:02,176 INFO L225 Difference]: With dead ends: 42 [2018-12-31 03:59:02,176 INFO L226 Difference]: Without dead ends: 38 [2018-12-31 03:59:02,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 03:59:02,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-31 03:59:02,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2018-12-31 03:59:02,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-31 03:59:02,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2018-12-31 03:59:02,190 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 13 [2018-12-31 03:59:02,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:59:02,190 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2018-12-31 03:59:02,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 03:59:02,191 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2018-12-31 03:59:02,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-31 03:59:02,191 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:59:02,191 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:59:02,193 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:59:02,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:59:02,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1959363189, now seen corresponding path program 1 times [2018-12-31 03:59:02,193 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:59:02,195 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2018-12-31 03:59:02,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:59:02,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:59:02,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:59:02,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:59:02,281 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:59:02,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:59:02,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 03:59:02,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 03:59:02,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 03:59:02,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 03:59:02,294 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand 4 states. [2018-12-31 03:59:02,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:59:02,618 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2018-12-31 03:59:02,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 03:59:02,621 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-12-31 03:59:02,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:59:02,622 INFO L225 Difference]: With dead ends: 42 [2018-12-31 03:59:02,623 INFO L226 Difference]: Without dead ends: 38 [2018-12-31 03:59:02,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 03:59:02,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-31 03:59:02,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2018-12-31 03:59:02,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-31 03:59:02,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2018-12-31 03:59:02,634 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 14 [2018-12-31 03:59:02,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:59:02,634 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2018-12-31 03:59:02,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 03:59:02,637 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2018-12-31 03:59:02,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-31 03:59:02,638 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:59:02,638 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:59:02,638 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:59:02,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:59:02,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1045511114, now seen corresponding path program 1 times [2018-12-31 03:59:02,643 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:59:02,643 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) [2018-12-31 03:59:02,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-12-31 03:59:02,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:59:02,715 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:59:02,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:59:02,731 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:59:02,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:59:02,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 03:59:02,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 03:59:02,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 03:59:02,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 03:59:02,744 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand 4 states. [2018-12-31 03:59:02,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:59:02,863 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2018-12-31 03:59:02,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 03:59:02,864 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-12-31 03:59:02,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:59:02,866 INFO L225 Difference]: With dead ends: 42 [2018-12-31 03:59:02,866 INFO L226 Difference]: Without dead ends: 38 [2018-12-31 03:59:02,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 03:59:02,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-31 03:59:02,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2018-12-31 03:59:02,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-31 03:59:02,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2018-12-31 03:59:02,873 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 15 [2018-12-31 03:59:02,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:59:02,874 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2018-12-31 03:59:02,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 03:59:02,874 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2018-12-31 03:59:02,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-31 03:59:02,875 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:59:02,875 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:59:02,875 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:59:02,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:59:02,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1102769416, now seen corresponding path program 1 times [2018-12-31 03:59:02,876 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:59:02,877 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-12-31 03:59:02,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:59:02,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:59:02,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:59:03,136 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-12-31 03:59:03,223 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 03:59:03,234 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 03:59:03,249 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 03:59:03,259 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 03:59:03,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 98 [2018-12-31 03:59:03,653 WARN L181 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2018-12-31 03:59:03,763 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 03:59:03,764 INFO L303 Elim1Store]: Index analysis took 108 ms [2018-12-31 03:59:03,766 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 59 [2018-12-31 03:59:03,768 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 03:59:03,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2018-12-31 03:59:03,905 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2018-12-31 03:59:03,906 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-31 03:59:03,948 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 03:59:04,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-12-31 03:59:04,015 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 4 [2018-12-31 03:59:04,016 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-31 03:59:04,022 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 03:59:04,038 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 03:59:04,059 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-31 03:59:04,059 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:88, output treesize:29 [2018-12-31 03:59:06,074 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_q#valueAsBitvector_3| (_ BitVec 64)) (v_prenex_9 (_ BitVec 64))) (let ((.cse1 ((_ extract 31 0) |v_q#valueAsBitvector_3|))) (and (let ((.cse0 (fp ((_ extract 63 63) v_prenex_9) ((_ extract 62 52) v_prenex_9) ((_ extract 51 0) v_prenex_9)))) (fp.eq .cse0 .cse0)) (= c_ULTIMATE.start___fpclassify_double_~lsw~0 .cse1) (= ((_ extract 63 32) v_prenex_9) c_ULTIMATE.start___fpclassify_double_~msw~0) (= ((_ extract 31 0) v_prenex_9) .cse1)))) is different from true [2018-12-31 03:59:14,548 WARN L181 SmtUtils]: Spent 8.37 s on a formula simplification. DAG size of input: 34 DAG size of output: 33 [2018-12-31 03:59:16,840 WARN L181 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 75 DAG size of output: 44 [2018-12-31 03:59:16,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:59:16,850 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:59:16,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:59:16,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 03:59:16,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 03:59:16,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 03:59:16,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=31, Unknown=1, NotChecked=10, Total=56 [2018-12-31 03:59:16,862 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand 8 states. [2018-12-31 03:59:21,371 WARN L181 SmtUtils]: Spent 2.07 s on a formula simplification that was a NOOP. DAG size: 32 [2018-12-31 03:59:27,604 WARN L181 SmtUtils]: Spent 6.19 s on a formula simplification that was a NOOP. DAG size: 48 [2018-12-31 03:59:27,964 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2018-12-31 03:59:34,269 WARN L181 SmtUtils]: Spent 6.11 s on a formula simplification that was a NOOP. DAG size: 46 [2018-12-31 03:59:36,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:59:36,934 INFO L93 Difference]: Finished difference Result 62 states and 79 transitions. [2018-12-31 03:59:36,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-31 03:59:36,935 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-12-31 03:59:36,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:59:36,936 INFO L225 Difference]: With dead ends: 62 [2018-12-31 03:59:36,936 INFO L226 Difference]: Without dead ends: 46 [2018-12-31 03:59:36,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 29.8s TimeCoverageRelationStatistics Valid=56, Invalid=128, Unknown=2, NotChecked=24, Total=210 [2018-12-31 03:59:36,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-31 03:59:36,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 26. [2018-12-31 03:59:36,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-31 03:59:36,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2018-12-31 03:59:36,946 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 15 [2018-12-31 03:59:36,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:59:36,948 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2018-12-31 03:59:36,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 03:59:36,948 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2018-12-31 03:59:36,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-31 03:59:36,949 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:59:36,949 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:59:36,949 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:59:36,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:59:36,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1042649172, now seen corresponding path program 1 times [2018-12-31 03:59:36,951 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:59:36,951 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2018-12-31 03:59:36,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:59:37,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:59:37,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:59:37,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:59:37,054 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:59:37,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:59:37,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 03:59:37,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 03:59:37,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 03:59:37,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 03:59:37,067 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand 4 states. [2018-12-31 03:59:37,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:59:37,168 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2018-12-31 03:59:37,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 03:59:37,169 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-12-31 03:59:37,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:59:37,170 INFO L225 Difference]: With dead ends: 40 [2018-12-31 03:59:37,170 INFO L226 Difference]: Without dead ends: 36 [2018-12-31 03:59:37,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 03:59:37,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-31 03:59:37,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2018-12-31 03:59:37,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-31 03:59:37,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2018-12-31 03:59:37,182 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 17 [2018-12-31 03:59:37,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:59:37,182 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2018-12-31 03:59:37,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 03:59:37,183 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2018-12-31 03:59:37,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-31 03:59:37,183 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:59:37,183 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:59:37,186 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:59:37,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:59:37,186 INFO L82 PathProgramCache]: Analyzing trace with hash -666515868, now seen corresponding path program 1 times [2018-12-31 03:59:37,186 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:59:37,187 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2018-12-31 03:59:37,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:59:37,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:59:37,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:59:37,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:59:37,305 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:59:37,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:59:37,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 03:59:37,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 03:59:37,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 03:59:37,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 03:59:37,325 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand 4 states. [2018-12-31 03:59:37,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:59:37,474 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2018-12-31 03:59:37,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 03:59:37,475 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-12-31 03:59:37,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:59:37,475 INFO L225 Difference]: With dead ends: 42 [2018-12-31 03:59:37,476 INFO L226 Difference]: Without dead ends: 38 [2018-12-31 03:59:37,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 03:59:37,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-31 03:59:37,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2018-12-31 03:59:37,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-31 03:59:37,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2018-12-31 03:59:37,485 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 18 [2018-12-31 03:59:37,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:59:37,485 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2018-12-31 03:59:37,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 03:59:37,485 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2018-12-31 03:59:37,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-31 03:59:37,486 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:59:37,486 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:59:37,486 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:59:37,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:59:37,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1310041806, now seen corresponding path program 1 times [2018-12-31 03:59:37,487 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:59:37,487 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2018-12-31 03:59:37,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:59:37,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:59:37,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:59:37,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:59:37,605 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:59:37,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:59:37,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 03:59:37,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 03:59:37,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 03:59:37,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 03:59:37,617 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand 4 states. [2018-12-31 03:59:37,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:59:37,676 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2018-12-31 03:59:37,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 03:59:37,678 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-12-31 03:59:37,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:59:37,679 INFO L225 Difference]: With dead ends: 33 [2018-12-31 03:59:37,679 INFO L226 Difference]: Without dead ends: 28 [2018-12-31 03:59:37,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 03:59:37,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-31 03:59:37,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-31 03:59:37,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-31 03:59:37,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2018-12-31 03:59:37,695 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 19 [2018-12-31 03:59:37,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:59:37,695 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2018-12-31 03:59:37,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 03:59:37,697 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2018-12-31 03:59:37,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-31 03:59:37,698 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:59:37,698 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:59:37,698 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:59:37,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:59:37,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1311888848, now seen corresponding path program 1 times [2018-12-31 03:59:37,701 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:59:37,701 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2018-12-31 03:59:37,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:59:37,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:59:37,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:59:37,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:59:37,867 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:59:37,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:59:37,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 03:59:37,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 03:59:37,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 03:59:37,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 03:59:37,884 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 6 states. [2018-12-31 03:59:38,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:59:38,278 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2018-12-31 03:59:38,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 03:59:38,284 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-12-31 03:59:38,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:59:38,285 INFO L225 Difference]: With dead ends: 38 [2018-12-31 03:59:38,285 INFO L226 Difference]: Without dead ends: 28 [2018-12-31 03:59:38,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-12-31 03:59:38,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-31 03:59:38,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2018-12-31 03:59:38,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-31 03:59:38,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2018-12-31 03:59:38,297 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 19 [2018-12-31 03:59:38,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:59:38,297 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-12-31 03:59:38,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 03:59:38,297 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-12-31 03:59:38,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-31 03:59:38,298 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:59:38,298 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:59:38,298 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:59:38,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:59:38,301 INFO L82 PathProgramCache]: Analyzing trace with hash 782688991, now seen corresponding path program 1 times [2018-12-31 03:59:38,301 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:59:38,302 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2018-12-31 03:59:38,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:59:38,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:59:38,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:59:38,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:59:38,430 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:59:38,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:59:38,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 03:59:38,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 03:59:38,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 03:59:38,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 03:59:38,442 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 4 states. [2018-12-31 03:59:38,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:59:38,568 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2018-12-31 03:59:38,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 03:59:38,569 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-12-31 03:59:38,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:59:38,570 INFO L225 Difference]: With dead ends: 40 [2018-12-31 03:59:38,570 INFO L226 Difference]: Without dead ends: 36 [2018-12-31 03:59:38,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 03:59:38,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-31 03:59:38,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2018-12-31 03:59:38,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-31 03:59:38,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-12-31 03:59:38,585 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 20 [2018-12-31 03:59:38,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:59:38,585 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-12-31 03:59:38,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 03:59:38,585 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-12-31 03:59:38,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-31 03:59:38,588 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:59:38,588 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:59:38,588 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:59:38,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:59:38,588 INFO L82 PathProgramCache]: Analyzing trace with hash 839947293, now seen corresponding path program 1 times [2018-12-31 03:59:38,589 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:59:38,589 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2018-12-31 03:59:38,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:59:38,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:59:38,675 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:59:38,996 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-12-31 03:59:39,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:59:39,312 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:59:39,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:59:39,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 03:59:39,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 03:59:39,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 03:59:39,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 03:59:39,330 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 7 states. [2018-12-31 03:59:40,085 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2018-12-31 03:59:40,796 WARN L181 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 32 [2018-12-31 03:59:41,215 WARN L181 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 34 [2018-12-31 03:59:41,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:59:41,394 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-12-31 03:59:41,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 03:59:41,395 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-12-31 03:59:41,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:59:41,396 INFO L225 Difference]: With dead ends: 50 [2018-12-31 03:59:41,396 INFO L226 Difference]: Without dead ends: 46 [2018-12-31 03:59:41,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-12-31 03:59:41,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-31 03:59:41,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 36. [2018-12-31 03:59:41,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-31 03:59:41,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2018-12-31 03:59:41,410 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 20 [2018-12-31 03:59:41,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:59:41,410 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2018-12-31 03:59:41,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 03:59:41,411 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2018-12-31 03:59:41,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-31 03:59:41,411 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:59:41,411 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:59:41,414 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:59:41,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:59:41,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1085928516, now seen corresponding path program 1 times [2018-12-31 03:59:41,415 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:59:41,415 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-12-31 03:59:41,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2018-12-31 03:59:41,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:59:41,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:59:41,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:59:41,715 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:59:41,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:59:41,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 03:59:41,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 03:59:41,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 03:59:41,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 03:59:41,726 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 7 states. [2018-12-31 03:59:42,165 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 10 [2018-12-31 03:59:42,428 WARN L181 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 12 [2018-12-31 03:59:43,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:59:43,082 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-12-31 03:59:43,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 03:59:43,083 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-12-31 03:59:43,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:59:43,084 INFO L225 Difference]: With dead ends: 40 [2018-12-31 03:59:43,084 INFO L226 Difference]: Without dead ends: 36 [2018-12-31 03:59:43,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-12-31 03:59:43,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-31 03:59:43,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 26. [2018-12-31 03:59:43,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-31 03:59:43,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2018-12-31 03:59:43,097 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 21 [2018-12-31 03:59:43,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:59:43,097 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2018-12-31 03:59:43,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 03:59:43,097 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-12-31 03:59:43,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-31 03:59:43,098 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:59:43,098 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:59:43,098 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:59:43,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:59:43,098 INFO L82 PathProgramCache]: Analyzing trace with hash 598258075, now seen corresponding path program 1 times [2018-12-31 03:59:43,102 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:59:43,102 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2018-12-31 03:59:43,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:59:43,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:59:43,248 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:59:43,362 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 03:59:43,363 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 03:59:43,364 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 03:59:43,365 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 03:59:43,367 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 76 [2018-12-31 03:59:43,418 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 60 [2018-12-31 03:59:43,419 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 03:59:43,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-31 03:59:43,469 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-31 03:59:43,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-12-31 03:59:43,501 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 5 [2018-12-31 03:59:43,502 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-31 03:59:43,506 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 03:59:43,515 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 03:59:43,541 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-31 03:59:43,542 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:67, output treesize:31 [2018-12-31 03:59:43,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:59:43,605 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:59:43,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:59:43,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 03:59:43,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 03:59:43,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 03:59:43,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 03:59:43,617 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 6 states. [2018-12-31 03:59:44,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:59:44,135 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-12-31 03:59:44,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 03:59:44,138 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-12-31 03:59:44,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:59:44,138 INFO L225 Difference]: With dead ends: 34 [2018-12-31 03:59:44,138 INFO L226 Difference]: Without dead ends: 26 [2018-12-31 03:59:44,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 03:59:44,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-31 03:59:44,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-31 03:59:44,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-31 03:59:44,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-12-31 03:59:44,151 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 22 [2018-12-31 03:59:44,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:59:44,153 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-12-31 03:59:44,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 03:59:44,153 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-12-31 03:59:44,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-31 03:59:44,155 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:59:44,155 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:59:44,155 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:59:44,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:59:44,155 INFO L82 PathProgramCache]: Analyzing trace with hash -211088551, now seen corresponding path program 1 times [2018-12-31 03:59:44,156 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:59:44,156 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2018-12-31 03:59:44,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:59:44,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:59:44,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:59:44,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:59:44,335 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:59:44,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:59:44,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 03:59:44,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 03:59:44,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 03:59:44,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 03:59:44,353 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 4 states. [2018-12-31 03:59:44,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:59:44,567 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2018-12-31 03:59:44,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 03:59:44,567 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-12-31 03:59:44,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:59:44,567 INFO L225 Difference]: With dead ends: 26 [2018-12-31 03:59:44,567 INFO L226 Difference]: Without dead ends: 0 [2018-12-31 03:59:44,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 03:59:44,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-31 03:59:44,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-31 03:59:44,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-31 03:59:44,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-31 03:59:44,570 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2018-12-31 03:59:44,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:59:44,570 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-31 03:59:44,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 03:59:44,572 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-31 03:59:44,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-31 03:59:44,579 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-31 03:59:45,126 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2018-12-31 03:59:45,939 WARN L181 SmtUtils]: Spent 811.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 39 [2018-12-31 03:59:46,073 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 17 [2018-12-31 03:59:55,378 WARN L181 SmtUtils]: Spent 9.30 s on a formula simplification. DAG size of input: 143 DAG size of output: 44 [2018-12-31 03:59:56,180 WARN L181 SmtUtils]: Spent 799.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 31 [2018-12-31 03:59:56,183 INFO L448 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2018-12-31 03:59:56,183 INFO L448 ceAbstractionStarter]: For program point L60-2(line 60) no Hoare annotation was computed. [2018-12-31 03:59:56,184 INFO L444 ceAbstractionStarter]: At program point L60-3(lines 53 61) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))) (and (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) (= |ULTIMATE.start_isnan_double_#res| (_ bv0 32)) (= ULTIMATE.start_fmax_double_~x ULTIMATE.start_main_~x~0) (= |ULTIMATE.start_fmax_double_#res| ULTIMATE.start_main_~x~0) (= ULTIMATE.start___fpclassify_double_~x .cse0) (= ULTIMATE.start_fmax_double_~y .cse0) (exists ((|v_q#valueAsBitvector_4| (_ BitVec 64))) (and (= ULTIMATE.start___fpclassify_double_~msw~0 ((_ extract 63 32) |v_q#valueAsBitvector_4|)) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_4|) ((_ extract 62 52) |v_q#valueAsBitvector_4|) ((_ extract 51 0) |v_q#valueAsBitvector_4|)) (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53))))) (= ULTIMATE.start_main_~y~0 .cse0))) [2018-12-31 03:59:56,184 INFO L448 ceAbstractionStarter]: For program point L77(lines 77 80) no Hoare annotation was computed. [2018-12-31 03:59:56,184 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-12-31 03:59:56,184 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-31 03:59:56,184 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-31 03:59:56,184 INFO L448 ceAbstractionStarter]: For program point L57(lines 57 58) no Hoare annotation was computed. [2018-12-31 03:59:56,185 INFO L444 ceAbstractionStarter]: At program point L16(line 16) the Hoare annotation is: (and (let ((.cse0 (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (or (and (= (bvadd |ULTIMATE.start_isnan_double_#res| (_ bv4294967295 32)) (_ bv0 32)) (not .cse0)) (and (= |ULTIMATE.start_isnan_double_#res| (_ bv0 32)) .cse0))) (= ULTIMATE.start_main_~y~0 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))) [2018-12-31 03:59:56,185 INFO L448 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2018-12-31 03:59:56,185 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-31 03:59:56,185 INFO L448 ceAbstractionStarter]: For program point L29-1(lines 29 34) no Hoare annotation was computed. [2018-12-31 03:59:56,185 INFO L444 ceAbstractionStarter]: At program point L29-2(lines 29 34) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))) (and (= |ULTIMATE.start_isnan_double_#res| (_ bv0 32)) (= ULTIMATE.start_fmax_double_~x ULTIMATE.start_main_~x~0) (= ULTIMATE.start_fmax_double_~x ULTIMATE.start___fpclassify_double_~x) (= ULTIMATE.start_fmax_double_~y .cse0) (fp.eq ULTIMATE.start___fpclassify_double_~x ULTIMATE.start___fpclassify_double_~x) (= ULTIMATE.start_main_~y~0 .cse0))) [2018-12-31 03:59:56,185 INFO L448 ceAbstractionStarter]: For program point L29-3(lines 26 51) no Hoare annotation was computed. [2018-12-31 03:59:56,185 INFO L448 ceAbstractionStarter]: For program point L29-5(lines 29 34) no Hoare annotation was computed. [2018-12-31 03:59:56,186 INFO L444 ceAbstractionStarter]: At program point L29-6(lines 29 34) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))) (and (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) (= |ULTIMATE.start_isnan_double_#res| (_ bv0 32)) (= ULTIMATE.start_fmax_double_~x ULTIMATE.start_main_~x~0) (= ULTIMATE.start___fpclassify_double_~x .cse0) (= ULTIMATE.start_fmax_double_~y .cse0) (= ULTIMATE.start_main_~y~0 .cse0))) [2018-12-31 03:59:56,186 INFO L448 ceAbstractionStarter]: For program point L29-7(lines 26 51) no Hoare annotation was computed. [2018-12-31 03:59:56,186 INFO L451 ceAbstractionStarter]: At program point L83(lines 63 84) the Hoare annotation is: true [2018-12-31 03:59:56,186 INFO L444 ceAbstractionStarter]: At program point L50(lines 26 51) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))) (and (= |ULTIMATE.start_isnan_double_#res| (_ bv0 32)) (or (= (bvadd |ULTIMATE.start___fpclassify_double_#res| (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd |ULTIMATE.start___fpclassify_double_#res| (_ bv4294967292 32)) (_ bv0 32)) (= (bvadd |ULTIMATE.start___fpclassify_double_#res| (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd |ULTIMATE.start___fpclassify_double_#res| (_ bv4294967293 32)) (_ bv0 32))) (exists ((v_prenex_14 (_ BitVec 64))) (and (= ULTIMATE.start_fmax_double_~x (fp ((_ extract 63 63) v_prenex_14) ((_ extract 62 52) v_prenex_14) ((_ extract 51 0) v_prenex_14))) (= ((_ extract 63 32) v_prenex_14) ULTIMATE.start___fpclassify_double_~msw~0))) (= ULTIMATE.start_fmax_double_~x ULTIMATE.start_main_~x~0) (= ULTIMATE.start_fmax_double_~x ULTIMATE.start___fpclassify_double_~x) (= ULTIMATE.start_fmax_double_~y .cse0) (fp.eq ULTIMATE.start___fpclassify_double_~x ULTIMATE.start___fpclassify_double_~x) (= ULTIMATE.start_main_~y~0 .cse0))) [2018-12-31 03:59:56,186 INFO L444 ceAbstractionStarter]: At program point L50-1(lines 26 51) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))) (and (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) (= |ULTIMATE.start_isnan_double_#res| (_ bv0 32)) (= ULTIMATE.start_fmax_double_~x ULTIMATE.start_main_~x~0) (= ULTIMATE.start___fpclassify_double_~x .cse0) (= ULTIMATE.start_fmax_double_~y .cse0) (= |ULTIMATE.start___fpclassify_double_#res| (_ bv0 32)) (exists ((|v_q#valueAsBitvector_5| (_ BitVec 64)) (v_prenex_16 (_ BitVec 64))) (let ((.cse2 ((_ extract 63 32) |v_q#valueAsBitvector_5|)) (.cse1 ((_ extract 31 0) v_prenex_16))) (and (= .cse1 ((_ extract 31 0) |v_q#valueAsBitvector_5|)) (= ((_ extract 63 32) v_prenex_16) .cse2) (= .cse2 ULTIMATE.start___fpclassify_double_~msw~0) (= .cse1 ULTIMATE.start___fpclassify_double_~lsw~0) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_5|) ((_ extract 62 52) |v_q#valueAsBitvector_5|) ((_ extract 51 0) |v_q#valueAsBitvector_5|)) (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))))) (= ULTIMATE.start_main_~y~0 .cse0))) [2018-12-31 03:59:56,187 INFO L448 ceAbstractionStarter]: For program point L46(lines 46 50) no Hoare annotation was computed. [2018-12-31 03:59:56,187 INFO L448 ceAbstractionStarter]: For program point L46-1(lines 46 50) no Hoare annotation was computed. [2018-12-31 03:59:56,187 INFO L448 ceAbstractionStarter]: For program point L42(lines 42 50) no Hoare annotation was computed. [2018-12-31 03:59:56,187 INFO L448 ceAbstractionStarter]: For program point L42-1(lines 42 50) no Hoare annotation was computed. [2018-12-31 03:59:56,187 INFO L448 ceAbstractionStarter]: For program point L55(lines 55 56) no Hoare annotation was computed. [2018-12-31 03:59:56,187 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 78) no Hoare annotation was computed. [2018-12-31 03:59:56,187 INFO L448 ceAbstractionStarter]: For program point L72(lines 72 81) no Hoare annotation was computed. [2018-12-31 03:59:56,187 INFO L448 ceAbstractionStarter]: For program point L39(lines 39 50) no Hoare annotation was computed. [2018-12-31 03:59:56,188 INFO L448 ceAbstractionStarter]: For program point L39-1(lines 39 50) no Hoare annotation was computed. [2018-12-31 03:59:56,188 INFO L448 ceAbstractionStarter]: For program point L72-2(lines 72 81) no Hoare annotation was computed. [2018-12-31 03:59:56,197 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:56,203 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:56,205 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:56,205 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:56,206 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:56,206 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:56,208 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:56,208 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:56,209 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] [2018-12-31 03:59:56,209 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:56,209 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] [2018-12-31 03:59:56,209 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:56,210 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:56,210 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] [2018-12-31 03:59:56,210 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:56,210 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:56,210 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:56,213 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:56,213 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:56,214 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:56,215 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:56,215 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] [2018-12-31 03:59:56,215 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:56,215 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] [2018-12-31 03:59:56,215 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:56,221 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:56,221 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] [2018-12-31 03:59:56,221 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:56,222 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:56,222 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:56,222 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:56,222 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:56,223 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:56,223 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:56,226 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:56,226 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:56,227 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:56,227 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:56,228 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2018-12-31 03:59:56,228 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2018-12-31 03:59:56,231 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2018-12-31 03:59:56,231 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2018-12-31 03:59:56,231 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:56,232 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:56,232 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2018-12-31 03:59:56,236 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2018-12-31 03:59:56,236 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2018-12-31 03:59:56,236 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2018-12-31 03:59:56,239 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:56,239 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:56,241 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:56,241 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:56,241 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:59:56,244 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:59:56,244 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:59:56,244 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:59:56,245 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:56,245 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:56,246 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:56,246 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:56,246 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:59:56,246 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:59:56,247 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:59:56,250 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:59:56,250 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:56,250 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:56,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 03:59:56 BoogieIcfgContainer [2018-12-31 03:59:56,259 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 03:59:56,260 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 03:59:56,260 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 03:59:56,261 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 03:59:56,261 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:59:01" (3/4) ... [2018-12-31 03:59:56,267 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-31 03:59:56,283 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2018-12-31 03:59:56,283 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-31 03:59:56,283 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-31 03:59:56,313 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((~bvadd64(\result, 4294967295bv32) == 0bv32 && !~fp.eq~DOUBLE(x, x)) || (\result == 0bv32 && ~fp.eq~DOUBLE(x, x))) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) [2018-12-31 03:59:56,314 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\result == 0bv32 && x == x) && x == x) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && ~fp.eq~DOUBLE(x, x)) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) [2018-12-31 03:59:56,314 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((\result == 0bv32 && (((~bvadd64(\result, 4294967294bv32) == 0bv32 || ~bvadd64(\result, 4294967292bv32) == 0bv32) || ~bvadd64(\result, 4294967295bv32) == 0bv32) || ~bvadd64(\result, 4294967293bv32) == 0bv32)) && (\exists v_prenex_14 : bv64 :: x == ~fp~LONGDOUBLE(v_prenex_14[63:63], v_prenex_14[62:52], v_prenex_14[51:0]) && v_prenex_14[63:32] == msw)) && x == x) && x == x) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && ~fp.eq~DOUBLE(x, x)) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) [2018-12-31 03:59:56,315 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((~fp.eq~DOUBLE(x, x) && \result == 0bv32) && x == x) && \result == x) && x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && (\exists v_q#valueAsBitvector_4 : bv64 :: msw == v_q#valueAsBitvector_4[63:32] && ~fp~LONGDOUBLE(v_q#valueAsBitvector_4[63:63], v_q#valueAsBitvector_4[62:52], v_q#valueAsBitvector_4[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()))) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) [2018-12-31 03:59:56,316 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((~fp.eq~DOUBLE(x, x) && \result == 0bv32) && x == x) && x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) [2018-12-31 03:59:56,316 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((~fp.eq~DOUBLE(x, x) && \result == 0bv32) && x == x) && x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && \result == 0bv32) && (\exists v_q#valueAsBitvector_5 : bv64, v_prenex_16 : bv64 :: (((v_prenex_16[31:0] == v_q#valueAsBitvector_5[31:0] && v_prenex_16[63:32] == v_q#valueAsBitvector_5[63:32]) && v_q#valueAsBitvector_5[63:32] == msw) && v_prenex_16[31:0] == lsw) && ~fp~LONGDOUBLE(v_q#valueAsBitvector_5[63:63], v_q#valueAsBitvector_5[62:52], v_q#valueAsBitvector_5[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()))) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) [2018-12-31 03:59:56,377 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 03:59:56,377 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 03:59:56,378 INFO L168 Benchmark]: Toolchain (without parser) took 56651.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 190.8 MB). Free memory was 947.3 MB in the beginning and 839.0 MB in the end (delta: 108.4 MB). Peak memory consumption was 299.2 MB. Max. memory is 11.5 GB. [2018-12-31 03:59:56,382 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. [2018-12-31 03:59:56,383 INFO L168 Benchmark]: CACSL2BoogieTranslator took 375.48 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. [2018-12-31 03:59:56,383 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.64 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. [2018-12-31 03:59:56,385 INFO L168 Benchmark]: Boogie Preprocessor took 124.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -184.8 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. [2018-12-31 03:59:56,386 INFO L168 Benchmark]: RCFGBuilder took 740.71 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: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-12-31 03:59:56,386 INFO L168 Benchmark]: TraceAbstraction took 55238.02 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 62.9 MB). Free memory was 1.1 GB in the beginning and 846.2 MB in the end (delta: 250.1 MB). Peak memory consumption was 313.0 MB. Max. memory is 11.5 GB. [2018-12-31 03:59:56,388 INFO L168 Benchmark]: Witness Printer took 117.05 ms. Allocated memory is still 1.2 GB. Free memory was 846.2 MB in the beginning and 839.0 MB in the end (delta: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 11.5 GB. [2018-12-31 03:59:56,393 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 375.48 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 49.64 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 124.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -184.8 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 740.71 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: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 55238.02 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 62.9 MB). Free memory was 1.1 GB in the beginning and 846.2 MB in the end (delta: 250.1 MB). Peak memory consumption was 313.0 MB. Max. memory is 11.5 GB. * Witness Printer took 117.05 ms. Allocated memory is still 1.2 GB. Free memory was 846.2 MB in the beginning and 839.0 MB in the end (delta: 7.3 MB). Peak memory consumption was 7.3 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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - 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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - 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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - 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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - 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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - 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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - 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: 78]: 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: 16]: Loop Invariant [2018-12-31 03:59:56,408 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:56,409 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((~bvadd64(\result, 4294967295bv32) == 0bv32 && !~fp.eq~DOUBLE(x, x)) || (\result == 0bv32 && ~fp.eq~DOUBLE(x, x))) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 29]: Loop Invariant [2018-12-31 03:59:56,409 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:56,409 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:56,410 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:56,410 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((((\result == 0bv32 && x == x) && x == x) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && ~fp.eq~DOUBLE(x, x)) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 26]: Loop Invariant [2018-12-31 03:59:56,410 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:56,410 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:56,411 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] [2018-12-31 03:59:56,411 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:56,411 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] [2018-12-31 03:59:56,411 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:56,411 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:56,412 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] [2018-12-31 03:59:56,412 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:56,412 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:56,412 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:56,412 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:56,412 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:56,413 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:56,413 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:56,413 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] [2018-12-31 03:59:56,414 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:56,414 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] [2018-12-31 03:59:56,414 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:56,414 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:56,414 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] [2018-12-31 03:59:56,414 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:56,423 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:56,423 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:56,423 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:56,423 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((((((~fp.eq~DOUBLE(x, x) && \result == 0bv32) && x == x) && x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && \result == 0bv32) && (\exists v_q#valueAsBitvector_5 : bv64, v_prenex_16 : bv64 :: (((v_prenex_16[31:0] == v_q#valueAsBitvector_5[31:0] && v_prenex_16[63:32] == v_q#valueAsBitvector_5[63:32]) && v_q#valueAsBitvector_5[63:32] == msw) && v_prenex_16[31:0] == lsw) && ~fp~LONGDOUBLE(v_q#valueAsBitvector_5[63:63], v_q#valueAsBitvector_5[62:52], v_q#valueAsBitvector_5[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()))) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 29]: Loop Invariant [2018-12-31 03:59:56,424 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:56,424 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:56,425 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:56,425 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:56,425 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:56,425 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((((~fp.eq~DOUBLE(x, x) && \result == 0bv32) && x == x) && x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 26]: Loop Invariant [2018-12-31 03:59:56,428 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2018-12-31 03:59:56,428 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2018-12-31 03:59:56,428 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2018-12-31 03:59:56,428 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2018-12-31 03:59:56,429 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:56,429 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:56,429 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2018-12-31 03:59:56,430 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2018-12-31 03:59:56,430 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2018-12-31 03:59:56,430 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2018-12-31 03:59:56,430 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:56,430 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((((((\result == 0bv32 && (((~bvadd64(\result, 4294967294bv32) == 0bv32 || ~bvadd64(\result, 4294967292bv32) == 0bv32) || ~bvadd64(\result, 4294967295bv32) == 0bv32) || ~bvadd64(\result, 4294967293bv32) == 0bv32)) && (\exists v_prenex_14 : bv64 :: x == ~fp~LONGDOUBLE(v_prenex_14[63:63], v_prenex_14[62:52], v_prenex_14[51:0]) && v_prenex_14[63:32] == msw)) && x == x) && x == x) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && ~fp.eq~DOUBLE(x, x)) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 63]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 53]: Loop Invariant [2018-12-31 03:59:56,436 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:56,437 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:56,437 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:59:56,437 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:59:56,437 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:59:56,437 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:59:56,438 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:56,438 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:56,438 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:56,438 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:56,442 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:59:56,442 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:59:56,443 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:59:56,443 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:59:56,443 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:56,443 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((((((~fp.eq~DOUBLE(x, x) && \result == 0bv32) && x == x) && \result == x) && x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && (\exists v_q#valueAsBitvector_4 : bv64 :: msw == v_q#valueAsBitvector_4[63:32] && ~fp~LONGDOUBLE(v_q#valueAsBitvector_4[63:63], v_q#valueAsBitvector_4[62:52], v_q#valueAsBitvector_4[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()))) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 30 locations, 1 error locations. SAFE Result, 55.0s OverallTime, 15 OverallIterations, 1 TraceHistogramMax, 26.1s AutomataDifference, 0.0s DeadEndRemovalTime, 11.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 486 SDtfs, 406 SDslu, 710 SDs, 0 SdLazy, 367 SolverSat, 18 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 6.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 274 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 33.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=12, 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.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 106 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 14 NumberOfFragments, 256 HoareAnnotationTreeSize, 7 FomulaSimplifications, 1786 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 7 FomulaSimplificationsInter, 16217 FormulaSimplificationTreeSizeReductionInter, 11.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 15.6s InterpolantComputationTime, 258 NumberOfCodeBlocks, 258 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 243 ConstructedInterpolants, 26 QuantifiedInterpolants, 28150 SizeOfPredicates, 53 NumberOfNonLiveVariables, 900 ConjunctsInSsa, 94 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...