./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/float-newlib/double_req_bl_0910a_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/float-newlib/double_req_bl_0910a_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 ad1d3a5941ec50f48eb7bcc3f41470c0fe523f0b ........................................................................................................................................................................................................................................................................................................ 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_0910a_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 ad1d3a5941ec50f48eb7bcc3f41470c0fe523f0b ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 09:05:53,982 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 09:05:53,984 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 09:05:53,997 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 09:05:53,998 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 09:05:53,999 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 09:05:54,001 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 09:05:54,003 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 09:05:54,005 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 09:05:54,006 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 09:05:54,007 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 09:05:54,007 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 09:05:54,008 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 09:05:54,010 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 09:05:54,011 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 09:05:54,012 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 09:05:54,013 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 09:05:54,015 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 09:05:54,017 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 09:05:54,019 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 09:05:54,020 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 09:05:54,022 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 09:05:54,025 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 09:05:54,025 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 09:05:54,026 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 09:05:54,027 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 09:05:54,028 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 09:05:54,029 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 09:05:54,030 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 09:05:54,031 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 09:05:54,032 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 09:05:54,033 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 09:05:54,033 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 09:05:54,033 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 09:05:54,034 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 09:05:54,036 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 09:05:54,036 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 09:05:54,052 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 09:05:54,052 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 09:05:54,054 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 09:05:54,054 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 09:05:54,054 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 09:05:54,054 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 09:05:54,055 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 09:05:54,055 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 09:05:54,055 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 09:05:54,055 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 09:05:54,055 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 09:05:54,055 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 09:05:54,056 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 09:05:54,057 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 09:05:54,057 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 09:05:54,057 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 09:05:54,058 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 09:05:54,058 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 09:05:54,058 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 09:05:54,058 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 09:05:54,058 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 09:05:54,058 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 09:05:54,060 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 09:05:54,060 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 09:05:54,060 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 09:05:54,060 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 09:05:54,060 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 09:05:54,061 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 09:05:54,061 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 -> ad1d3a5941ec50f48eb7bcc3f41470c0fe523f0b [2019-01-12 09:05:54,099 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 09:05:54,115 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 09:05:54,119 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 09:05:54,121 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 09:05:54,121 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 09:05:54,122 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/double_req_bl_0910a_true-unreach-call.c [2019-01-12 09:05:54,183 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/017d767f8/e604ee11ca8f482ea5ccb758cd687341/FLAG85cf552ef [2019-01-12 09:05:54,695 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 09:05:54,696 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/double_req_bl_0910a_true-unreach-call.c [2019-01-12 09:05:54,704 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/017d767f8/e604ee11ca8f482ea5ccb758cd687341/FLAG85cf552ef [2019-01-12 09:05:55,009 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/017d767f8/e604ee11ca8f482ea5ccb758cd687341 [2019-01-12 09:05:55,013 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 09:05:55,015 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 09:05:55,016 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 09:05:55,016 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 09:05:55,019 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 09:05:55,020 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:05:55" (1/1) ... [2019-01-12 09:05:55,024 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@332d35f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:05:55, skipping insertion in model container [2019-01-12 09:05:55,024 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:05:55" (1/1) ... [2019-01-12 09:05:55,032 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 09:05:55,065 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 09:05:55,278 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:05:55,283 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 09:05:55,329 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:05:55,364 INFO L195 MainTranslator]: Completed translation [2019-01-12 09:05:55,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:05:55 WrapperNode [2019-01-12 09:05:55,366 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 09:05:55,367 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 09:05:55,368 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 09:05:55,368 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 09:05:55,378 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:05:55" (1/1) ... [2019-01-12 09:05:55,390 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:05:55" (1/1) ... [2019-01-12 09:05:55,514 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 09:05:55,514 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 09:05:55,514 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 09:05:55,515 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 09:05:55,525 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:05:55" (1/1) ... [2019-01-12 09:05:55,525 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:05:55" (1/1) ... [2019-01-12 09:05:55,528 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:05:55" (1/1) ... [2019-01-12 09:05:55,529 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:05:55" (1/1) ... [2019-01-12 09:05:55,544 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:05:55" (1/1) ... [2019-01-12 09:05:55,551 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:05:55" (1/1) ... [2019-01-12 09:05:55,561 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:05:55" (1/1) ... [2019-01-12 09:05:55,567 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 09:05:55,567 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 09:05:55,568 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 09:05:55,568 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 09:05:55,569 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:05:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 09:05:55,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 09:05:55,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2019-01-12 09:05:55,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-12 09:05:55,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-01-12 09:05:55,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 09:05:55,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 09:05:55,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-12 09:05:55,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 09:05:56,185 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 09:05:56,186 INFO L286 CfgBuilder]: Removed 16 assue(true) statements. [2019-01-12 09:05:56,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:05:56 BoogieIcfgContainer [2019-01-12 09:05:56,188 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 09:05:56,189 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 09:05:56,189 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 09:05:56,192 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 09:05:56,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 09:05:55" (1/3) ... [2019-01-12 09:05:56,194 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2987fb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:05:56, skipping insertion in model container [2019-01-12 09:05:56,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:05:55" (2/3) ... [2019-01-12 09:05:56,195 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2987fb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:05:56, skipping insertion in model container [2019-01-12 09:05:56,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:05:56" (3/3) ... [2019-01-12 09:05:56,198 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0910a_true-unreach-call.c [2019-01-12 09:05:56,209 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 09:05:56,218 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 09:05:56,235 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 09:05:56,264 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 09:05:56,265 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 09:05:56,265 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 09:05:56,265 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 09:05:56,266 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 09:05:56,266 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 09:05:56,266 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 09:05:56,266 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 09:05:56,266 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 09:05:56,282 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2019-01-12 09:05:56,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-12 09:05:56,288 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:05:56,289 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:05:56,291 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:05:56,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:05:56,297 INFO L82 PathProgramCache]: Analyzing trace with hash -2110731690, now seen corresponding path program 1 times [2019-01-12 09:05:56,299 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:05:56,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:05:56,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:05:56,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:05:56,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:05:56,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:05:56,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:05:56,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:05:56,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 09:05:56,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 09:05:56,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 09:05:56,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 09:05:56,450 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2019-01-12 09:05:56,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:05:56,470 INFO L93 Difference]: Finished difference Result 62 states and 100 transitions. [2019-01-12 09:05:56,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 09:05:56,471 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2019-01-12 09:05:56,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:05:56,483 INFO L225 Difference]: With dead ends: 62 [2019-01-12 09:05:56,483 INFO L226 Difference]: Without dead ends: 29 [2019-01-12 09:05:56,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 09:05:56,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-12 09:05:56,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-01-12 09:05:56,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-12 09:05:56,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2019-01-12 09:05:56,520 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 12 [2019-01-12 09:05:56,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:05:56,520 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 39 transitions. [2019-01-12 09:05:56,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 09:05:56,521 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2019-01-12 09:05:56,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-12 09:05:56,521 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:05:56,522 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:05:56,522 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:05:56,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:05:56,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1825265086, now seen corresponding path program 1 times [2019-01-12 09:05:56,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:05:56,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:05:56,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:05:56,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:05:56,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:05:56,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 09:05:56,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 09:05:56,767 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 09:05:56,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 09:05:56 BoogieIcfgContainer [2019-01-12 09:05:56,813 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 09:05:56,814 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 09:05:56,814 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 09:05:56,814 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 09:05:56,814 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:05:56" (3/4) ... [2019-01-12 09:05:56,819 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-12 09:05:56,819 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 09:05:56,820 INFO L168 Benchmark]: Toolchain (without parser) took 1806.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -116.8 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-01-12 09:05:56,822 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:05:56,822 INFO L168 Benchmark]: CACSL2BoogieTranslator took 350.53 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 935.2 MB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. [2019-01-12 09:05:56,823 INFO L168 Benchmark]: Boogie Procedure Inliner took 146.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -195.2 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2019-01-12 09:05:56,824 INFO L168 Benchmark]: Boogie Preprocessor took 52.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-12 09:05:56,825 INFO L168 Benchmark]: RCFGBuilder took 620.85 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: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. [2019-01-12 09:05:56,826 INFO L168 Benchmark]: TraceAbstraction took 624.32 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: 26.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 11.5 GB. [2019-01-12 09:05:56,827 INFO L168 Benchmark]: Witness Printer took 5.63 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:05:56,833 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 350.53 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 935.2 MB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 146.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -195.2 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 52.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 620.85 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: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 624.32 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: 26.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 11.5 GB. * Witness Printer took 5.63 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 137]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseOr at line 27, overapproximation of someBinaryArithmeticDOUBLEoperation at line 60, overapproximation of bitwiseAnd at line 26. Possible FailurePath: [L32-L41] static const double ln2_hi_log = 6.93147180369123816490e-01, ln2_lo_log = 1.90821492927058770002e-10, two54_log = 1.80143985094819840000e+16, Lg1_log = 6.666666666666735130e-01, Lg2_log = 3.999999999940941908e-01, Lg3_log = 2.857142874366239149e-01, Lg4_log = 2.222219843214978396e-01, Lg5_log = 1.818357216161805012e-01, Lg6_log = 1.531383769920937332e-01, Lg7_log = 1.479819860511658591e-01; [L43] static const double zero = 0.0; VAL [Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, two54_log=18014398509481984, zero=0] [L132] double x = 0.0; [L46] double hfsq, f, s, z, R, w, t1, t2, dk; [L47] __int32_t k, hx, i, j; [L48] __uint32_t lx; VAL [Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, two54_log=18014398509481984, zero=0] [L51] ieee_double_shape_type ew_u; [L52] ew_u.value = (x) [L53] EXPR ew_u.parts.msw [L53] (hx) = ew_u.parts.msw [L54] EXPR ew_u.parts.lsw [L54] (lx) = ew_u.parts.lsw [L57] k = 0 VAL [Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, two54_log=18014398509481984, zero=0] [L58] COND TRUE hx < 0x00100000 VAL [Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, two54_log=18014398509481984, zero=0] [L59] COND TRUE ((hx & 0x7fffffff) | lx) == 0 [L60] return -two54_log / zero; VAL [Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, two54_log=18014398509481984, zero=0] [L133] double res = __ieee754_log(x); [L19] __int32_t hx, lx; VAL [Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, two54_log=18014398509481984, zero=0] [L21] ieee_double_shape_type ew_u; [L22] ew_u.value = (x) [L23] EXPR ew_u.parts.msw [L23] (hx) = ew_u.parts.msw [L24] EXPR ew_u.parts.lsw [L24] (lx) = ew_u.parts.lsw [L26] hx &= 0x7fffffff [L27] hx |= (__uint32_t)(lx | (-lx)) >> 31 [L28] hx = 0x7ff00000 - hx [L29] return 1 - (int)((__uint32_t)(hx | (-hx)) >> 31); VAL [Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, two54_log=18014398509481984, zero=0] [L136] COND TRUE !isinf_double(res) [L137] __VERIFIER_error() VAL [Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, two54_log=18014398509481984, zero=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 32 locations, 1 error locations. UNSAFE Result, 0.5s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 42 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 26 NumberOfCodeBlocks, 26 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 11 ConstructedInterpolants, 0 QuantifiedInterpolants, 121 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-0ed9222-m [2019-01-12 09:05:59,284 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 09:05:59,286 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 09:05:59,302 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 09:05:59,302 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 09:05:59,305 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 09:05:59,307 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 09:05:59,309 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 09:05:59,312 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 09:05:59,314 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 09:05:59,316 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 09:05:59,316 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 09:05:59,318 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 09:05:59,319 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 09:05:59,327 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 09:05:59,328 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 09:05:59,331 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 09:05:59,333 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 09:05:59,335 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 09:05:59,337 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 09:05:59,338 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 09:05:59,341 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 09:05:59,345 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 09:05:59,345 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 09:05:59,345 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 09:05:59,348 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 09:05:59,349 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 09:05:59,349 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 09:05:59,350 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 09:05:59,353 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 09:05:59,354 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 09:05:59,355 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 09:05:59,355 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 09:05:59,355 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 09:05:59,356 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 09:05:59,357 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 09:05:59,358 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-01-12 09:05:59,382 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 09:05:59,382 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 09:05:59,383 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 09:05:59,383 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 09:05:59,384 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 09:05:59,385 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 09:05:59,385 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 09:05:59,385 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 09:05:59,385 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 09:05:59,386 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 09:05:59,386 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 09:05:59,386 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 09:05:59,386 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2019-01-12 09:05:59,386 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-01-12 09:05:59,386 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 09:05:59,387 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 09:05:59,387 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 09:05:59,387 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 09:05:59,387 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 09:05:59,387 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 09:05:59,388 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 09:05:59,389 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 09:05:59,389 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 09:05:59,389 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 09:05:59,389 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 09:05:59,390 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 09:05:59,390 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2019-01-12 09:05:59,390 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 09:05:59,390 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-01-12 09:05:59,390 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2019-01-12 09:05:59,391 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 -> ad1d3a5941ec50f48eb7bcc3f41470c0fe523f0b [2019-01-12 09:05:59,447 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 09:05:59,464 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 09:05:59,469 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 09:05:59,472 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 09:05:59,472 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 09:05:59,473 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/double_req_bl_0910a_true-unreach-call.c [2019-01-12 09:05:59,530 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/976fe877b/506edea47c5e4efd9c18172966cf859b/FLAG48685e43a [2019-01-12 09:06:00,006 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 09:06:00,007 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/double_req_bl_0910a_true-unreach-call.c [2019-01-12 09:06:00,021 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/976fe877b/506edea47c5e4efd9c18172966cf859b/FLAG48685e43a [2019-01-12 09:06:00,340 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/976fe877b/506edea47c5e4efd9c18172966cf859b [2019-01-12 09:06:00,343 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 09:06:00,345 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 09:06:00,346 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 09:06:00,346 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 09:06:00,349 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 09:06:00,350 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:06:00" (1/1) ... [2019-01-12 09:06:00,353 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@348d6f3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:06:00, skipping insertion in model container [2019-01-12 09:06:00,354 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:06:00" (1/1) ... [2019-01-12 09:06:00,361 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 09:06:00,402 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 09:06:00,658 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:06:00,671 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 09:06:00,733 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:06:00,785 INFO L195 MainTranslator]: Completed translation [2019-01-12 09:06:00,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:06:00 WrapperNode [2019-01-12 09:06:00,785 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 09:06:00,786 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 09:06:00,786 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 09:06:00,786 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 09:06:00,865 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:06:00" (1/1) ... [2019-01-12 09:06:00,880 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:06:00" (1/1) ... [2019-01-12 09:06:00,913 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 09:06:00,914 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 09:06:00,914 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 09:06:00,914 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 09:06:00,931 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:06:00" (1/1) ... [2019-01-12 09:06:00,932 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:06:00" (1/1) ... [2019-01-12 09:06:00,936 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:06:00" (1/1) ... [2019-01-12 09:06:00,937 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:06:00" (1/1) ... [2019-01-12 09:06:00,956 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:06:00" (1/1) ... [2019-01-12 09:06:00,962 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:06:00" (1/1) ... [2019-01-12 09:06:00,968 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:06:00" (1/1) ... [2019-01-12 09:06:00,973 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 09:06:00,974 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 09:06:00,974 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 09:06:00,974 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 09:06:00,981 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:06: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 [2019-01-12 09:06:01,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2019-01-12 09:06:01,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2019-01-12 09:06:01,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 09:06:01,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-01-12 09:06:01,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 09:06:01,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 09:06:01,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-01-12 09:06:01,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 09:06:01,418 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:06:06,738 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:06:06,895 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:06:26,954 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:06:26,985 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 09:06:26,986 INFO L286 CfgBuilder]: Removed 16 assue(true) statements. [2019-01-12 09:06:26,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:06:26 BoogieIcfgContainer [2019-01-12 09:06:26,987 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 09:06:26,989 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 09:06:26,989 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 09:06:26,991 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 09:06:26,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 09:06:00" (1/3) ... [2019-01-12 09:06:26,992 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b5703a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:06:26, skipping insertion in model container [2019-01-12 09:06:26,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:06:00" (2/3) ... [2019-01-12 09:06:26,993 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b5703a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:06:26, skipping insertion in model container [2019-01-12 09:06:26,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:06:26" (3/3) ... [2019-01-12 09:06:26,995 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0910a_true-unreach-call.c [2019-01-12 09:06:27,003 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 09:06:27,011 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 09:06:27,028 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 09:06:27,061 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 09:06:27,062 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 09:06:27,062 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 09:06:27,062 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 09:06:27,062 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 09:06:27,062 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 09:06:27,062 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 09:06:27,063 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 09:06:27,063 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 09:06:27,078 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2019-01-12 09:06:27,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-12 09:06:27,086 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:06:27,087 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:06:27,090 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:06:27,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:06:27,097 INFO L82 PathProgramCache]: Analyzing trace with hash -2110731690, now seen corresponding path program 1 times [2019-01-12 09:06:27,102 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:06:27,103 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) [2019-01-12 09:06:27,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-01-12 09:06:27,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:06:28,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:06:28,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:06:28,058 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:06:28,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:06:28,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 09:06:28,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 09:06:28,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 09:06:28,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 09:06:28,098 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2019-01-12 09:06:28,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:06:28,116 INFO L93 Difference]: Finished difference Result 62 states and 100 transitions. [2019-01-12 09:06:28,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 09:06:28,118 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2019-01-12 09:06:28,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:06:28,132 INFO L225 Difference]: With dead ends: 62 [2019-01-12 09:06:28,132 INFO L226 Difference]: Without dead ends: 29 [2019-01-12 09:06:28,136 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 09:06:28,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-12 09:06:28,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-01-12 09:06:28,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-12 09:06:28,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2019-01-12 09:06:28,177 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 12 [2019-01-12 09:06:28,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:06:28,178 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 39 transitions. [2019-01-12 09:06:28,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 09:06:28,178 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2019-01-12 09:06:28,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-12 09:06:28,179 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:06:28,179 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:06:28,180 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:06:28,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:06:28,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1825265086, now seen corresponding path program 1 times [2019-01-12 09:06:28,182 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:06:28,182 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-01-12 09:06:28,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:06:29,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:06:29,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:06:29,495 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:06:29,512 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:06:29,529 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2019-01-12 09:06:29,832 WARN L181 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 23 [2019-01-12 09:06:29,856 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:06:29,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:06:29,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 44 [2019-01-12 09:06:29,862 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:06:29,955 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 35 treesize of output 27 [2019-01-12 09:06:29,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:06:29,990 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2019-01-12 09:06:29,991 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-12 09:06:30,010 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:06:30,020 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:06:30,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:06:30,037 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:63, output treesize:24 [2019-01-12 09:06:30,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:06:30,340 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:06:30,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:06:30,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 09:06:30,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 09:06:30,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 09:06:30,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-12 09:06:30,373 INFO L87 Difference]: Start difference. First operand 29 states and 39 transitions. Second operand 8 states. [2019-01-12 09:06:37,938 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-01-12 09:06:54,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:06:54,817 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2019-01-12 09:06:54,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 09:06:54,818 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-01-12 09:06:54,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:06:54,820 INFO L225 Difference]: With dead ends: 45 [2019-01-12 09:06:54,820 INFO L226 Difference]: Without dead ends: 37 [2019-01-12 09:06:54,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2019-01-12 09:06:54,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-12 09:06:54,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 29. [2019-01-12 09:06:54,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-12 09:06:54,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2019-01-12 09:06:54,829 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 14 [2019-01-12 09:06:54,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:06:54,829 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2019-01-12 09:06:54,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 09:06:54,830 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2019-01-12 09:06:54,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-12 09:06:54,830 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:06:54,831 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:06:54,831 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:06:54,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:06:54,832 INFO L82 PathProgramCache]: Analyzing trace with hash 2016616349, now seen corresponding path program 1 times [2019-01-12 09:06:54,833 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:06:54,833 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-01-12 09:06:54,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:06:54,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:06:54,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:06:55,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:06:55,025 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:06:55,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:06:55,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:06:55,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:06:55,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:06:55,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:06:55,039 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand 4 states. [2019-01-12 09:07:00,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:07:00,497 INFO L93 Difference]: Finished difference Result 48 states and 64 transitions. [2019-01-12 09:07:01,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 09:07:01,326 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-01-12 09:07:01,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:07:01,327 INFO L225 Difference]: With dead ends: 48 [2019-01-12 09:07:01,327 INFO L226 Difference]: Without dead ends: 29 [2019-01-12 09:07:01,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:07:01,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-12 09:07:01,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-01-12 09:07:01,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-12 09:07:01,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2019-01-12 09:07:01,334 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 14 [2019-01-12 09:07:01,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:07:01,335 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2019-01-12 09:07:01,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:07:01,336 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2019-01-12 09:07:01,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-12 09:07:01,337 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:07:01,337 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:07:01,338 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:07:01,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:07:01,338 INFO L82 PathProgramCache]: Analyzing trace with hash 933813038, now seen corresponding path program 1 times [2019-01-12 09:07:01,338 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:07:01,339 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-01-12 09:07:01,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:07:01,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:07:01,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:07:01,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:07:01,833 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:07:01,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:07:01,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 09:07:01,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 09:07:01,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 09:07:01,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-12 09:07:01,857 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand 6 states. [2019-01-12 09:07:04,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:07:04,147 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2019-01-12 09:07:04,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 09:07:04,947 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-01-12 09:07:04,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:07:04,948 INFO L225 Difference]: With dead ends: 37 [2019-01-12 09:07:04,948 INFO L226 Difference]: Without dead ends: 26 [2019-01-12 09:07:04,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-12 09:07:04,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-12 09:07:04,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-01-12 09:07:04,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-12 09:07:04,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-01-12 09:07:04,955 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 18 [2019-01-12 09:07:04,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:07:04,955 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-01-12 09:07:04,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 09:07:04,956 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2019-01-12 09:07:04,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-12 09:07:04,956 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:07:04,957 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, 1, 1] [2019-01-12 09:07:04,957 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:07:04,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:07:04,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1217171362, now seen corresponding path program 1 times [2019-01-12 09:07:04,959 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:07:04,959 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-01-12 09:07:04,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:07:05,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:07:05,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:07:05,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:07:05,702 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:07:05,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:07:05,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-12 09:07:05,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 09:07:05,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 09:07:05,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-01-12 09:07:05,718 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 9 states. [2019-01-12 09:07:11,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:07:11,935 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2019-01-12 09:07:12,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 09:07:12,062 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2019-01-12 09:07:12,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:07:12,064 INFO L225 Difference]: With dead ends: 34 [2019-01-12 09:07:12,064 INFO L226 Difference]: Without dead ends: 26 [2019-01-12 09:07:12,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-01-12 09:07:12,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-12 09:07:12,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-01-12 09:07:12,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-12 09:07:12,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-01-12 09:07:12,072 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-01-12 09:07:12,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:07:12,073 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-01-12 09:07:12,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 09:07:12,073 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-01-12 09:07:12,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-12 09:07:12,074 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:07:12,074 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, 1, 1] [2019-01-12 09:07:12,074 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:07:12,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:07:12,075 INFO L82 PathProgramCache]: Analyzing trace with hash 407824736, now seen corresponding path program 1 times [2019-01-12 09:07:12,076 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:07:12,076 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-01-12 09:07:12,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:07:13,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:07:13,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:07:13,308 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:07:13,309 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:07:13,310 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:07:13,312 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:07:13,314 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 58 treesize of output 85 [2019-01-12 09:07:13,445 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 28 [2019-01-12 09:07:13,454 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:07:13,455 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:07:13,457 INFO L478 Elim1Store]: Elim1 did not use 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 66 [2019-01-12 09:07:13,467 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:07:13,474 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 42 treesize of output 51 [2019-01-12 09:07:13,475 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-12 09:07:13,514 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:07:13,553 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 32 treesize of output 24 [2019-01-12 09:07:13,562 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 24 treesize of output 10 [2019-01-12 09:07:13,562 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-12 09:07:13,574 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:07:13,615 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 17 treesize of output 13 [2019-01-12 09:07:13,624 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 13 treesize of output 1 [2019-01-12 09:07:13,624 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-12 09:07:13,627 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:07:13,634 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:07:13,650 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. [2019-01-12 09:07:13,651 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:71, output treesize:23 [2019-01-12 09:07:13,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:07:13,687 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:07:13,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:07:13,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:07:13,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:07:13,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:07:13,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:07:13,713 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 4 states. [2019-01-12 09:07:13,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:07:13,779 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-01-12 09:07:13,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:07:13,782 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-01-12 09:07:13,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:07:13,784 INFO L225 Difference]: With dead ends: 26 [2019-01-12 09:07:13,784 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 09:07:13,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:07:13,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 09:07:13,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 09:07:13,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 09:07:13,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 09:07:13,785 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2019-01-12 09:07:13,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:07:13,786 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 09:07:13,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:07:13,788 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 09:07:13,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 09:07:13,792 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 09:07:13,975 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-12 09:07:14,101 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-12 09:07:14,266 INFO L448 ceAbstractionStarter]: For program point L85(lines 85 92) no Hoare annotation was computed. [2019-01-12 09:07:14,266 INFO L448 ceAbstractionStarter]: For program point L94(lines 94 99) no Hoare annotation was computed. [2019-01-12 09:07:14,266 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 09:07:14,266 INFO L448 ceAbstractionStarter]: For program point L61(lines 61 62) no Hoare annotation was computed. [2019-01-12 09:07:14,267 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 09:07:14,267 INFO L448 ceAbstractionStarter]: For program point L119(lines 119 122) no Hoare annotation was computed. [2019-01-12 09:07:14,267 INFO L448 ceAbstractionStarter]: For program point L86(lines 86 91) no Hoare annotation was computed. [2019-01-12 09:07:14,267 INFO L448 ceAbstractionStarter]: For program point L20-1(lines 20 25) no Hoare annotation was computed. [2019-01-12 09:07:14,268 INFO L444 ceAbstractionStarter]: At program point L20-2(lines 20 25) the Hoare annotation is: (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 18014398509481984.0))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.neg .cse1) (_ +zero 11 53)))) (and (= |ULTIMATE.start___ieee754_log_#res| .cse0) (= ULTIMATE.start_isinf_double_~x .cse0) (= ~two54_log~0 .cse1) (= (_ +zero 11 53) ~zero~0)))) [2019-01-12 09:07:14,268 INFO L448 ceAbstractionStarter]: For program point L20-3(lines 20 25) no Hoare annotation was computed. [2019-01-12 09:07:14,268 INFO L448 ceAbstractionStarter]: For program point L111(lines 111 123) no Hoare annotation was computed. [2019-01-12 09:07:14,268 INFO L448 ceAbstractionStarter]: For program point L136(lines 136 139) no Hoare annotation was computed. [2019-01-12 09:07:14,268 INFO L444 ceAbstractionStarter]: At program point L29(lines 18 30) the Hoare annotation is: (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 18014398509481984.0))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.neg .cse3) (_ +zero 11 53)))) (and (= |ULTIMATE.start___ieee754_log_#res| .cse0) (= ULTIMATE.start_isinf_double_~x .cse0) (exists ((|v_q#valueAsBitvector_5| (_ BitVec 64))) (and (= (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 18014398509481984.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) |v_q#valueAsBitvector_5|) ((_ extract 62 52) |v_q#valueAsBitvector_5|) ((_ extract 51 0) |v_q#valueAsBitvector_5|))) (= (bvadd |ULTIMATE.start_isinf_double_#res| (_ bv4294967295 32)) (bvneg (bvlshr (let ((.cse1 (bvadd (bvneg (bvor (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_q#valueAsBitvector_5|)) (bvlshr (let ((.cse2 ((_ extract 31 0) |v_q#valueAsBitvector_5|))) (bvor .cse2 (bvneg .cse2))) (_ bv31 32)))) (_ bv2146435072 32)))) (bvor .cse1 (bvneg .cse1))) (_ bv31 32)))))) (= ~two54_log~0 .cse3) (= (_ +zero 11 53) ~zero~0)))) [2019-01-12 09:07:14,269 INFO L448 ceAbstractionStarter]: For program point L137(line 137) no Hoare annotation was computed. [2019-01-12 09:07:14,269 INFO L448 ceAbstractionStarter]: For program point L113(lines 113 117) no Hoare annotation was computed. [2019-01-12 09:07:14,269 INFO L444 ceAbstractionStarter]: At program point L122(lines 45 124) the Hoare annotation is: (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 18014398509481984.0))) (and (= |ULTIMATE.start___ieee754_log_#res| (fp.div roundNearestTiesToEven (fp.neg .cse0) (_ +zero 11 53))) (= ~two54_log~0 .cse0) (= (_ +zero 11 53) ~zero~0))) [2019-01-12 09:07:14,269 INFO L448 ceAbstractionStarter]: For program point L65-1(lines 65 69) no Hoare annotation was computed. [2019-01-12 09:07:14,269 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 09:07:14,269 INFO L444 ceAbstractionStarter]: At program point L65-2(lines 65 69) the Hoare annotation is: false [2019-01-12 09:07:14,269 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 137) no Hoare annotation was computed. [2019-01-12 09:07:14,270 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 09:07:14,270 INFO L448 ceAbstractionStarter]: For program point L58(lines 58 70) no Hoare annotation was computed. [2019-01-12 09:07:14,270 INFO L448 ceAbstractionStarter]: For program point L58-1(lines 45 124) no Hoare annotation was computed. [2019-01-12 09:07:14,270 INFO L448 ceAbstractionStarter]: For program point L50-1(lines 50 55) no Hoare annotation was computed. [2019-01-12 09:07:14,270 INFO L444 ceAbstractionStarter]: At program point L50-2(lines 50 55) the Hoare annotation is: (and (= ULTIMATE.start___ieee754_log_~x (_ +zero 11 53)) (= ~two54_log~0 ((_ to_fp 11 53) roundNearestTiesToEven 18014398509481984.0)) (= (_ +zero 11 53) ~zero~0)) [2019-01-12 09:07:14,270 INFO L448 ceAbstractionStarter]: For program point L50-3(lines 50 55) no Hoare annotation was computed. [2019-01-12 09:07:14,271 INFO L451 ceAbstractionStarter]: At program point L141(lines 126 142) the Hoare annotation is: true [2019-01-12 09:07:14,271 INFO L448 ceAbstractionStarter]: For program point L59(lines 59 60) no Hoare annotation was computed. [2019-01-12 09:07:14,271 INFO L448 ceAbstractionStarter]: For program point L84(lines 84 100) no Hoare annotation was computed. [2019-01-12 09:07:14,271 INFO L448 ceAbstractionStarter]: For program point L76-1(lines 76 81) no Hoare annotation was computed. [2019-01-12 09:07:14,271 INFO L444 ceAbstractionStarter]: At program point L76-2(lines 76 81) the Hoare annotation is: false [2019-01-12 09:07:14,271 INFO L448 ceAbstractionStarter]: For program point L76-3(lines 76 81) no Hoare annotation was computed. [2019-01-12 09:07:14,282 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:14,283 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:14,283 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:14,286 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:14,286 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:14,287 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:14,288 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:14,289 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:14,290 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:14,290 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:14,290 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:14,290 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:14,291 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:14,291 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:14,292 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:14,294 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:14,294 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:14,294 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:14,297 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:14,298 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:14,298 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:14,298 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:14,298 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:14,299 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:14,299 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:07:14,299 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:07:14,299 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:07:14,301 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:07:14,302 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:07:14,302 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:07:14,302 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:07:14,302 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:07:14,304 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:07:14,304 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:14,306 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:14,307 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:14,307 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:14,307 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:14,307 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:14,308 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:14,309 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:07:14,309 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:07:14,309 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:07:14,310 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:07:14,311 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:07:14,311 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:07:14,311 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:07:14,312 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:07:14,312 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:07:14,313 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:14,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 09:07:14 BoogieIcfgContainer [2019-01-12 09:07:14,317 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 09:07:14,318 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 09:07:14,318 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 09:07:14,318 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 09:07:14,320 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:06:26" (3/4) ... [2019-01-12 09:07:14,324 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 09:07:14,339 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2019-01-12 09:07:14,340 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-01-12 09:07:14,340 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-12 09:07:14,369 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\result == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.8014398509481984E16)), ~Pluszero~LONGDOUBLE()) && two54_log == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.8014398509481984E16)) && ~Pluszero~LONGDOUBLE() == zero [2019-01-12 09:07:14,370 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\result == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.8014398509481984E16)), ~Pluszero~LONGDOUBLE()) && x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.8014398509481984E16)), ~Pluszero~LONGDOUBLE())) && two54_log == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.8014398509481984E16)) && ~Pluszero~LONGDOUBLE() == zero [2019-01-12 09:07:14,371 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.8014398509481984E16)), ~Pluszero~LONGDOUBLE()) && x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.8014398509481984E16)), ~Pluszero~LONGDOUBLE())) && (\exists v_q#valueAsBitvector_5 : bv64 :: ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.8014398509481984E16)), ~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_5[63:63], v_q#valueAsBitvector_5[62:52], v_q#valueAsBitvector_5[51:0]) && ~bvadd64(\result, 4294967295bv32) == ~bvneg32(~bvlshr32(~bvor32(~bvadd64(~bvneg32(~bvor32(~bvand32(2147483647bv32, v_q#valueAsBitvector_5[63:32]), ~bvlshr32(~bvor32(v_q#valueAsBitvector_5[31:0], ~bvneg32(v_q#valueAsBitvector_5[31:0])), 31bv32))), 2146435072bv32), ~bvneg32(~bvadd64(~bvneg32(~bvor32(~bvand32(2147483647bv32, v_q#valueAsBitvector_5[63:32]), ~bvlshr32(~bvor32(v_q#valueAsBitvector_5[31:0], ~bvneg32(v_q#valueAsBitvector_5[31:0])), 31bv32))), 2146435072bv32))), 31bv32)))) && two54_log == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.8014398509481984E16)) && ~Pluszero~LONGDOUBLE() == zero [2019-01-12 09:07:14,427 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 09:07:14,427 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 09:07:14,428 INFO L168 Benchmark]: Toolchain (without parser) took 74084.40 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 952.7 MB in the beginning and 800.4 MB in the end (delta: 152.3 MB). Peak memory consumption was 253.5 MB. Max. memory is 11.5 GB. [2019-01-12 09:07:14,429 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:07:14,430 INFO L168 Benchmark]: CACSL2BoogieTranslator took 439.93 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 936.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-01-12 09:07:14,430 INFO L168 Benchmark]: Boogie Procedure Inliner took 127.58 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -146.1 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. [2019-01-12 09:07:14,433 INFO L168 Benchmark]: Boogie Preprocessor took 59.01 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:07:14,433 INFO L168 Benchmark]: RCFGBuilder took 26013.82 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: 34.5 MB). Peak memory consumption was 34.5 MB. Max. memory is 11.5 GB. [2019-01-12 09:07:14,434 INFO L168 Benchmark]: TraceAbstraction took 47328.65 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 807.2 MB in the end (delta: 240.9 MB). Peak memory consumption was 240.9 MB. Max. memory is 11.5 GB. [2019-01-12 09:07:14,434 INFO L168 Benchmark]: Witness Printer took 109.77 ms. Allocated memory is still 1.1 GB. Free memory was 807.2 MB in the beginning and 800.4 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-12 09:07:14,441 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.20 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 439.93 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 936.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 127.58 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -146.1 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 59.01 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 26013.82 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: 34.5 MB). Peak memory consumption was 34.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 47328.65 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 807.2 MB in the end (delta: 240.9 MB). Peak memory consumption was 240.9 MB. Max. memory is 11.5 GB. * Witness Printer took 109.77 ms. Allocated memory is still 1.1 GB. Free memory was 807.2 MB in the beginning and 800.4 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation 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 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 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 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 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 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 137]: 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: 65]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 45]: Loop Invariant [2019-01-12 09:07:14,456 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:14,465 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:14,465 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:14,466 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:14,466 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:14,466 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (\result == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.8014398509481984E16)), ~Pluszero~LONGDOUBLE()) && two54_log == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.8014398509481984E16)) && ~Pluszero~LONGDOUBLE() == zero - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 50]: Loop Invariant [2019-01-12 09:07:14,467 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:14,467 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (x == ~Pluszero~LONGDOUBLE() && two54_log == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.8014398509481984E16)) && ~Pluszero~LONGDOUBLE() == zero - InvariantResult [Line: 20]: Loop Invariant [2019-01-12 09:07:14,468 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:14,472 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:14,472 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:14,472 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:14,473 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:14,473 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:14,473 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:14,474 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:14,474 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:14,474 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((\result == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.8014398509481984E16)), ~Pluszero~LONGDOUBLE()) && x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.8014398509481984E16)), ~Pluszero~LONGDOUBLE())) && two54_log == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.8014398509481984E16)) && ~Pluszero~LONGDOUBLE() == zero - InvariantResult [Line: 18]: Loop Invariant [2019-01-12 09:07:14,475 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:14,475 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:14,475 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:14,475 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:14,476 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:14,476 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:14,476 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:07:14,476 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:07:14,476 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:07:14,477 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:07:14,477 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:07:14,477 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:07:14,477 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:07:14,478 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:07:14,478 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:07:14,478 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:14,480 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:14,480 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:14,480 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:14,480 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:14,480 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:14,481 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:07:14,485 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:07:14,485 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:07:14,486 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:07:14,486 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:07:14,486 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:07:14,486 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:07:14,487 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:07:14,487 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:07:14,487 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:07:14,488 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (((\result == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.8014398509481984E16)), ~Pluszero~LONGDOUBLE()) && x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.8014398509481984E16)), ~Pluszero~LONGDOUBLE())) && (\exists v_q#valueAsBitvector_5 : bv64 :: ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.8014398509481984E16)), ~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_5[63:63], v_q#valueAsBitvector_5[62:52], v_q#valueAsBitvector_5[51:0]) && ~bvadd64(\result, 4294967295bv32) == ~bvneg32(~bvlshr32(~bvor32(~bvadd64(~bvneg32(~bvor32(~bvand32(2147483647bv32, v_q#valueAsBitvector_5[63:32]), ~bvlshr32(~bvor32(v_q#valueAsBitvector_5[31:0], ~bvneg32(v_q#valueAsBitvector_5[31:0])), 31bv32))), 2146435072bv32), ~bvneg32(~bvadd64(~bvneg32(~bvor32(~bvand32(2147483647bv32, v_q#valueAsBitvector_5[63:32]), ~bvlshr32(~bvor32(v_q#valueAsBitvector_5[31:0], ~bvneg32(v_q#valueAsBitvector_5[31:0])), 31bv32))), 2146435072bv32))), 31bv32)))) && two54_log == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.8014398509481984E16)) && ~Pluszero~LONGDOUBLE() == zero - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 32 locations, 1 error locations. SAFE Result, 47.2s OverallTime, 6 OverallIterations, 1 TraceHistogramMax, 40.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 145 SDtfs, 126 SDslu, 277 SDs, 0 SdLazy, 115 SolverSat, 30 SolverUnsat, 11 SolverUnknown, 0 SolverNotchecked, 34.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 113 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred 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, 6 MinimizatonAttempts, 8 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 12 NumberOfFragments, 145 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 3.6s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 106 NumberOfCodeBlocks, 106 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 100 ConstructedInterpolants, 21 QuantifiedInterpolants, 16602 SizeOfPredicates, 30 NumberOfNonLiveVariables, 454 ConjunctsInSsa, 59 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...