/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/Ultimate.py --spec ../../../trunk/examples/svcomp/ReachSafety.prp --file ../../../trunk/examples/svcomp/float-newlib/double_req_bl_1072b_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 40ef5092 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 ../../../trunk/examples/svcomp/float-newlib/double_req_bl_1072b_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 e202c391e3bb616d6f4a88904e6d2705a4dd90a9 ......................................................................................................................................................................................................................................................................................................... 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 ../../../trunk/examples/svcomp/float-newlib/double_req_bl_1072b_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 e202c391e3bb616d6f4a88904e6d2705a4dd90a9 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-40ef509 [2018-09-20 15:03:02,033 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-20 15:03:02,035 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-20 15:03:02,051 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-20 15:03:02,051 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-20 15:03:02,052 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-20 15:03:02,053 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-20 15:03:02,055 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-20 15:03:02,057 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-20 15:03:02,058 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-20 15:03:02,059 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-20 15:03:02,059 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-20 15:03:02,060 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-20 15:03:02,061 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-20 15:03:02,062 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-20 15:03:02,063 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-20 15:03:02,064 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-20 15:03:02,066 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-20 15:03:02,068 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-20 15:03:02,069 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-20 15:03:02,071 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-20 15:03:02,072 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-20 15:03:02,075 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-20 15:03:02,075 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-20 15:03:02,075 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-20 15:03:02,076 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-20 15:03:02,077 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-20 15:03:02,078 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-20 15:03:02,079 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-20 15:03:02,080 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-20 15:03:02,081 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-20 15:03:02,082 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-20 15:03:02,082 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-20 15:03:02,082 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-20 15:03:02,083 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-20 15:03:02,084 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-20 15:03:02,084 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-20 15:03:02,115 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-20 15:03:02,117 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-20 15:03:02,118 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-20 15:03:02,121 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-20 15:03:02,121 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-20 15:03:02,122 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-20 15:03:02,122 INFO L133 SettingsManager]: * Use SBE=true [2018-09-20 15:03:02,122 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-20 15:03:02,122 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-20 15:03:02,122 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-20 15:03:02,123 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-20 15:03:02,123 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-20 15:03:02,123 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-20 15:03:02,123 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-20 15:03:02,123 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-20 15:03:02,125 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-20 15:03:02,125 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-20 15:03:02,126 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-20 15:03:02,126 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-20 15:03:02,126 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-20 15:03:02,126 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-20 15:03:02,128 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-20 15:03:02,128 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-20 15:03:02,128 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-20 15:03:02,128 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-20 15:03:02,129 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-20 15:03:02,129 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-20 15:03:02,129 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-20 15:03:02,129 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-20 15:03:02,129 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 -> e202c391e3bb616d6f4a88904e6d2705a4dd90a9 [2018-09-20 15:03:02,199 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-20 15:03:02,213 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-20 15:03:02,217 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-20 15:03:02,219 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-20 15:03:02,219 INFO L276 PluginConnector]: CDTParser initialized [2018-09-20 15:03:02,220 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_1072b_true-unreach-call.c [2018-09-20 15:03:02,567 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d73f6373c/86aec5f06e3441e4b76926a047da8552/FLAG2a37bdbab [2018-09-20 15:03:02,689 INFO L277 CDTParser]: Found 1 translation units. [2018-09-20 15:03:02,690 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1072b_true-unreach-call.c [2018-09-20 15:03:02,698 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d73f6373c/86aec5f06e3441e4b76926a047da8552/FLAG2a37bdbab [2018-09-20 15:03:02,715 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d73f6373c/86aec5f06e3441e4b76926a047da8552 [2018-09-20 15:03:02,719 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-20 15:03:02,722 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-20 15:03:02,724 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-20 15:03:02,724 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-20 15:03:02,730 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-20 15:03:02,731 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 03:03:02" (1/1) ... [2018-09-20 15:03:02,734 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56806bc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:03:02, skipping insertion in model container [2018-09-20 15:03:02,734 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 03:03:02" (1/1) ... [2018-09-20 15:03:02,746 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-20 15:03:02,973 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 15:03:02,991 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-20 15:03:03,018 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 15:03:03,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:03:03 WrapperNode [2018-09-20 15:03:03,048 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-20 15:03:03,048 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-20 15:03:03,049 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-20 15:03:03,049 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-20 15:03:03,066 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:03:03" (1/1) ... [2018-09-20 15:03:03,066 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:03:03" (1/1) ... [2018-09-20 15:03:03,080 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:03:03" (1/1) ... [2018-09-20 15:03:03,080 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:03:03" (1/1) ... [2018-09-20 15:03:03,090 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:03:03" (1/1) ... [2018-09-20 15:03:03,103 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:03:03" (1/1) ... [2018-09-20 15:03:03,105 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:03:03" (1/1) ... [2018-09-20 15:03:03,115 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-20 15:03:03,118 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-20 15:03:03,118 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-20 15:03:03,118 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-20 15:03:03,121 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:03:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-20 15:03:03,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-20 15:03:03,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-20 15:03:03,278 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_double [2018-09-20 15:03:03,278 INFO L138 BoogieDeclarations]: Found implementation of procedure trunc_double [2018-09-20 15:03:03,278 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_double [2018-09-20 15:03:03,278 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-20 15:03:03,280 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-20 15:03:03,281 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_double [2018-09-20 15:03:03,281 INFO L130 BoogieDeclarations]: Found specification of procedure trunc_double [2018-09-20 15:03:03,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-09-20 15:03:03,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-09-20 15:03:03,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-09-20 15:03:03,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-09-20 15:03:03,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-09-20 15:03:03,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-09-20 15:03:03,283 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_double [2018-09-20 15:03:03,283 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-20 15:03:03,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-20 15:03:03,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-20 15:03:03,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-09-20 15:03:03,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2018-09-20 15:03:04,001 INFO L365 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-20 15:03:04,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:03:04 BoogieIcfgContainer [2018-09-20 15:03:04,002 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-20 15:03:04,003 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-20 15:03:04,004 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-20 15:03:04,008 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-20 15:03:04,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 03:03:02" (1/3) ... [2018-09-20 15:03:04,009 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e41714c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 03:03:04, skipping insertion in model container [2018-09-20 15:03:04,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:03:03" (2/3) ... [2018-09-20 15:03:04,010 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e41714c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 03:03:04, skipping insertion in model container [2018-09-20 15:03:04,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:03:04" (3/3) ... [2018-09-20 15:03:04,014 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1072b_true-unreach-call.c [2018-09-20 15:03:04,025 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-20 15:03:04,035 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-20 15:03:04,092 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-20 15:03:04,093 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-20 15:03:04,093 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-20 15:03:04,093 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-20 15:03:04,094 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-20 15:03:04,094 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-20 15:03:04,095 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-20 15:03:04,095 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-20 15:03:04,095 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-20 15:03:04,120 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states. [2018-09-20 15:03:04,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-20 15:03:04,133 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:03:04,135 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:03:04,139 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:03:04,150 INFO L82 PathProgramCache]: Analyzing trace with hash 702241209, now seen corresponding path program 1 times [2018-09-20 15:03:04,152 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-20 15:03:04,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-20 15:03:04,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:03:04,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:03:04,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:03:04,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:03:04,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:03:04,303 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:03:04,304 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-20 15:03:04,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-20 15:03:04,323 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-20 15:03:04,324 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-20 15:03:04,326 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 2 states. [2018-09-20 15:03:04,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:03:04,357 INFO L93 Difference]: Finished difference Result 174 states and 205 transitions. [2018-09-20 15:03:04,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-20 15:03:04,359 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-09-20 15:03:04,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:03:04,371 INFO L225 Difference]: With dead ends: 174 [2018-09-20 15:03:04,371 INFO L226 Difference]: Without dead ends: 87 [2018-09-20 15:03:04,375 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-20 15:03:04,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-09-20 15:03:04,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-09-20 15:03:04,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-09-20 15:03:04,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2018-09-20 15:03:04,428 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 19 [2018-09-20 15:03:04,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:03:04,429 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2018-09-20 15:03:04,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-20 15:03:04,429 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2018-09-20 15:03:04,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-09-20 15:03:04,431 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:03:04,431 INFO L376 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:03:04,431 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:03:04,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1356287241, now seen corresponding path program 1 times [2018-09-20 15:03:04,432 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-20 15:03:04,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-20 15:03:04,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:03:04,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:03:04,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:03:04,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-20 15:03:04,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-20 15:03:04,558 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-20 15:03:04,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 03:03:04 BoogieIcfgContainer [2018-09-20 15:03:04,601 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-20 15:03:04,602 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-09-20 15:03:04,602 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-09-20 15:03:04,602 INFO L276 PluginConnector]: Witness Printer initialized [2018-09-20 15:03:04,603 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:03:04" (3/4) ... [2018-09-20 15:03:04,606 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-09-20 15:03:04,606 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-09-20 15:03:04,607 INFO L168 Benchmark]: Toolchain (without parser) took 1887.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 951.9 MB in the beginning and 1.1 GB in the end (delta: -117.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2018-09-20 15:03:04,609 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 15:03:04,610 INFO L168 Benchmark]: CACSL2BoogieTranslator took 324.45 ms. Allocated memory is still 1.0 GB. Free memory was 951.9 MB in the beginning and 941.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-09-20 15:03:04,610 INFO L168 Benchmark]: Boogie Preprocessor took 66.70 ms. Allocated memory is still 1.0 GB. Free memory was 941.1 MB in the beginning and 935.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-09-20 15:03:04,611 INFO L168 Benchmark]: RCFGBuilder took 884.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 935.8 MB in the beginning and 1.1 GB in the end (delta: -161.6 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. [2018-09-20 15:03:04,612 INFO L168 Benchmark]: TraceAbstraction took 597.99 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: 28.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. [2018-09-20 15:03:04,613 INFO L168 Benchmark]: Witness Printer took 4.81 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. [2018-09-20 15:03:04,617 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 324.45 ms. Allocated memory is still 1.0 GB. Free memory was 951.9 MB in the beginning and 941.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 66.70 ms. Allocated memory is still 1.0 GB. Free memory was 941.1 MB in the beginning and 935.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 884.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 935.8 MB in the beginning and 1.1 GB in the end (delta: -161.6 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 597.99 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: 28.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. * Witness Printer took 4.81 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: 86]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 85, overapproximation of bitwiseAnd at line 28, overapproximation of someBinaryArithmeticDOUBLEoperation at line 49. Possible FailurePath: [L81] double x = 0.0; VAL [x=0] [L82] CALL, EXPR trunc_double(x) VAL [\old(x)=0] [L18] int signbit; [L19] int msw; [L20] unsigned int lsw; [L21] int exponent_less_1023; VAL [\old(x)=0, x=0] [L23] FCALL ieee_double_shape_type ew_u; VAL [\old(x)=0, ew_u={6442450945:0}, x=0] [L24] FCALL ew_u.value = (x) VAL [\old(x)=0, ew_u={6442450945:0}, x=0] [L25] EXPR, FCALL ew_u.parts.msw VAL [\old(x)=0, ew_u={6442450945:0}, ew_u.parts.msw=6442450943, x=0] [L25] (msw) = ew_u.parts.msw VAL [\old(x)=0, ew_u={6442450945:0}, ew_u.parts.msw=6442450943, msw=2147483647, x=0] [L25] FCALL (msw) = ew_u.parts.msw VAL [(msw) = ew_u.parts.msw=6442450949, \old(x)=0, ew_u={6442450945:0}, ew_u.parts.msw=6442450943, msw=2147483647, x=0] [L26] EXPR, FCALL ew_u.parts.lsw VAL [\old(x)=0, ew_u={6442450945:0}, ew_u.parts.lsw=6442450946, msw=2147483647, x=0] [L26] (lsw) = ew_u.parts.lsw VAL [\old(x)=0, ew_u={6442450945:0}, ew_u.parts.lsw=6442450946, lsw=2147483650, msw=2147483647, x=0] [L26] FCALL (lsw) = ew_u.parts.lsw VAL [(lsw) = ew_u.parts.lsw=6442450947, \old(x)=0, ew_u={6442450945:0}, ew_u.parts.lsw=6442450946, lsw=2147483650, msw=2147483647, x=0] [L27] COND FALSE !(0) VAL [\old(x)=0, lsw=2147483650, msw=2147483647, x=0] [L28] signbit = msw & 0x80000000 [L29] exponent_less_1023 = ((msw & 0x7ff00000) >> 20) - 1023 VAL [\old(x)=0, exponent_less_1023=1024, lsw=2147483650, msw=2147483647, signbit=-1, x=0] [L30] COND FALSE !(exponent_less_1023 < 20) VAL [\old(x)=0, exponent_less_1023=1024, lsw=2147483650, msw=2147483647, signbit=-1, x=0] [L47] COND TRUE exponent_less_1023 > 51 VAL [\old(x)=0, exponent_less_1023=1024, lsw=2147483650, msw=2147483647, signbit=-1, x=0] [L48] COND TRUE exponent_less_1023 == 1024 [L49] RET return x + x; VAL [\old(x)=0, exponent_less_1023=1024, lsw=2147483650, msw=2147483647, signbit=-1, x=0] [L82] EXPR trunc_double(x) VAL [trunc_double(x)=6442450948, x=0] [L82] double res = trunc_double(x); [L85] EXPR res == 0.0 && __signbit_double(res) == 0 VAL [res=6442450948, res == 0.0 && __signbit_double(res) == 0=0, x=0] [L85] COND FALSE, EXPR !(res == 0.0 && __signbit_double(res) == 0) VAL [res=6442450948, res == 0.0 && __signbit_double(res) == 0=0, x=0] [L85] COND TRUE !(res == 0.0 && __signbit_double(res) == 0) [L86] __VERIFIER_error() VAL [res=6442450948, x=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 94 locations, 1 error locations. UNSAFE Result, 0.5s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 95 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=91occurred 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.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 51 NumberOfCodeBlocks, 51 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 18 ConstructedInterpolants, 0 QuantifiedInterpolants, 324 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.23-40ef509 [2018-09-20 15:03:07,053 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-20 15:03:07,055 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-20 15:03:07,068 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-20 15:03:07,068 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-20 15:03:07,070 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-20 15:03:07,071 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-20 15:03:07,073 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-20 15:03:07,075 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-20 15:03:07,076 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-20 15:03:07,077 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-20 15:03:07,078 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-20 15:03:07,079 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-20 15:03:07,080 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-20 15:03:07,082 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-20 15:03:07,082 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-20 15:03:07,084 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-20 15:03:07,086 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-20 15:03:07,088 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-20 15:03:07,090 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-20 15:03:07,091 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-20 15:03:07,093 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-20 15:03:07,096 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-20 15:03:07,097 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-20 15:03:07,097 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-20 15:03:07,098 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-20 15:03:07,100 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-20 15:03:07,101 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-20 15:03:07,102 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-20 15:03:07,103 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-20 15:03:07,104 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-20 15:03:07,105 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-20 15:03:07,105 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-20 15:03:07,105 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-20 15:03:07,107 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-20 15:03:07,108 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-20 15:03:07,108 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-09-20 15:03:07,125 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-20 15:03:07,126 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-20 15:03:07,126 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-20 15:03:07,127 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-20 15:03:07,128 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-20 15:03:07,128 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-20 15:03:07,128 INFO L133 SettingsManager]: * Use SBE=true [2018-09-20 15:03:07,128 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-20 15:03:07,129 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-20 15:03:07,129 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-20 15:03:07,129 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-20 15:03:07,129 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-20 15:03:07,129 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-20 15:03:07,130 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-20 15:03:07,130 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-09-20 15:03:07,130 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-09-20 15:03:07,130 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-20 15:03:07,130 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-20 15:03:07,132 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-20 15:03:07,132 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-20 15:03:07,133 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-20 15:03:07,133 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-20 15:03:07,133 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-20 15:03:07,133 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-20 15:03:07,133 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-20 15:03:07,134 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-20 15:03:07,134 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-20 15:03:07,134 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-09-20 15:03:07,134 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-20 15:03:07,134 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-09-20 15:03:07,134 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-09-20 15:03:07,135 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 -> e202c391e3bb616d6f4a88904e6d2705a4dd90a9 [2018-09-20 15:03:07,189 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-20 15:03:07,203 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-20 15:03:07,207 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-20 15:03:07,209 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-20 15:03:07,210 INFO L276 PluginConnector]: CDTParser initialized [2018-09-20 15:03:07,211 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_1072b_true-unreach-call.c [2018-09-20 15:03:07,590 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0fdae507/998159723efc4aafb707fe202d2a5b40/FLAGe9643a438 [2018-09-20 15:03:07,760 INFO L277 CDTParser]: Found 1 translation units. [2018-09-20 15:03:07,761 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1072b_true-unreach-call.c [2018-09-20 15:03:07,768 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0fdae507/998159723efc4aafb707fe202d2a5b40/FLAGe9643a438 [2018-09-20 15:03:07,785 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0fdae507/998159723efc4aafb707fe202d2a5b40 [2018-09-20 15:03:07,790 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-20 15:03:07,794 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-20 15:03:07,795 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-20 15:03:07,796 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-20 15:03:07,803 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-20 15:03:07,804 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 03:03:07" (1/1) ... [2018-09-20 15:03:07,808 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55ade425 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:03:07, skipping insertion in model container [2018-09-20 15:03:07,808 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 03:03:07" (1/1) ... [2018-09-20 15:03:07,820 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-20 15:03:08,038 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 15:03:08,063 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-20 15:03:08,090 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 15:03:08,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:03:08 WrapperNode [2018-09-20 15:03:08,137 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-20 15:03:08,138 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-20 15:03:08,139 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-20 15:03:08,139 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-20 15:03:08,154 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:03:08" (1/1) ... [2018-09-20 15:03:08,154 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:03:08" (1/1) ... [2018-09-20 15:03:08,167 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:03:08" (1/1) ... [2018-09-20 15:03:08,168 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:03:08" (1/1) ... [2018-09-20 15:03:08,190 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:03:08" (1/1) ... [2018-09-20 15:03:08,201 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:03:08" (1/1) ... [2018-09-20 15:03:08,205 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:03:08" (1/1) ... [2018-09-20 15:03:08,209 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-20 15:03:08,210 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-20 15:03:08,210 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-20 15:03:08,210 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-20 15:03:08,212 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:03:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-20 15:03:08,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-20 15:03:08,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-20 15:03:08,363 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_double [2018-09-20 15:03:08,363 INFO L138 BoogieDeclarations]: Found implementation of procedure trunc_double [2018-09-20 15:03:08,363 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_double [2018-09-20 15:03:08,363 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-20 15:03:08,366 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-20 15:03:08,367 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_double [2018-09-20 15:03:08,367 INFO L130 BoogieDeclarations]: Found specification of procedure trunc_double [2018-09-20 15:03:08,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-09-20 15:03:08,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-09-20 15:03:08,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-09-20 15:03:08,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-09-20 15:03:08,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-09-20 15:03:08,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-09-20 15:03:08,368 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_double [2018-09-20 15:03:08,368 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-20 15:03:08,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-20 15:03:08,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-20 15:03:08,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8 [2018-09-20 15:03:08,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-09-20 15:03:08,575 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:03:08,597 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:03:08,932 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:03:08,948 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:03:08,959 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:03:09,230 INFO L365 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-20 15:03:09,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:03:09 BoogieIcfgContainer [2018-09-20 15:03:09,231 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-20 15:03:09,232 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-20 15:03:09,232 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-20 15:03:09,236 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-20 15:03:09,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 03:03:07" (1/3) ... [2018-09-20 15:03:09,237 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@677d9fc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 03:03:09, skipping insertion in model container [2018-09-20 15:03:09,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:03:08" (2/3) ... [2018-09-20 15:03:09,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@677d9fc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 03:03:09, skipping insertion in model container [2018-09-20 15:03:09,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:03:09" (3/3) ... [2018-09-20 15:03:09,240 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1072b_true-unreach-call.c [2018-09-20 15:03:09,251 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-20 15:03:09,260 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-20 15:03:09,314 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-20 15:03:09,315 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-20 15:03:09,315 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-20 15:03:09,315 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-20 15:03:09,315 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-20 15:03:09,315 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-20 15:03:09,316 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-20 15:03:09,316 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-20 15:03:09,317 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-20 15:03:09,338 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states. [2018-09-20 15:03:09,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-20 15:03:09,347 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:03:09,348 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:03:09,351 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:03:09,357 INFO L82 PathProgramCache]: Analyzing trace with hash 702241209, now seen corresponding path program 1 times [2018-09-20 15:03:09,362 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:03:09,362 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-09-20 15:03:09,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:03:09,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:03:09,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:03:09,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:03:09,488 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:03:09,506 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:03:09,507 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-20 15:03:09,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-20 15:03:09,526 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-20 15:03:09,527 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-20 15:03:09,530 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 2 states. [2018-09-20 15:03:09,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:03:09,561 INFO L93 Difference]: Finished difference Result 174 states and 205 transitions. [2018-09-20 15:03:09,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-20 15:03:09,563 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-09-20 15:03:09,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:03:09,574 INFO L225 Difference]: With dead ends: 174 [2018-09-20 15:03:09,574 INFO L226 Difference]: Without dead ends: 87 [2018-09-20 15:03:09,578 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-20 15:03:09,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-09-20 15:03:09,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-09-20 15:03:09,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-09-20 15:03:09,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2018-09-20 15:03:09,626 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 19 [2018-09-20 15:03:09,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:03:09,626 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2018-09-20 15:03:09,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-20 15:03:09,627 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2018-09-20 15:03:09,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-09-20 15:03:09,632 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:03:09,632 INFO L376 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:03:09,633 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:03:09,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1356287241, now seen corresponding path program 1 times [2018-09-20 15:03:09,634 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:03:09,634 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) [2018-09-20 15:03:09,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-09-20 15:03:09,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:03:09,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:03:09,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 14 treesize of output 11 [2018-09-20 15:03:09,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-20 15:03:09,857 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:03:09,866 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:03:09,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:03:09,920 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-20 15:03:09,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-20 15:03:09,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-20 15:03:09,979 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:03:09,990 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:03:10,002 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. [2018-09-20 15:03:10,002 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-20 15:03:10,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:03:10,517 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:03:10,531 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:03:10,532 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-20 15:03:10,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-20 15:03:10,534 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-20 15:03:10,535 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-20 15:03:10,535 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand 9 states. [2018-09-20 15:03:12,013 WARN L178 SmtUtils]: Spent 323.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-09-20 15:03:13,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:03:13,016 INFO L93 Difference]: Finished difference Result 114 states and 118 transitions. [2018-09-20 15:03:13,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-20 15:03:13,018 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-09-20 15:03:13,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:03:13,021 INFO L225 Difference]: With dead ends: 114 [2018-09-20 15:03:13,021 INFO L226 Difference]: Without dead ends: 73 [2018-09-20 15:03:13,023 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2018-09-20 15:03:13,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-09-20 15:03:13,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-09-20 15:03:13,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-09-20 15:03:13,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2018-09-20 15:03:13,037 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 32 [2018-09-20 15:03:13,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:03:13,037 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2018-09-20 15:03:13,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-20 15:03:13,037 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2018-09-20 15:03:13,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-09-20 15:03:13,039 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:03:13,039 INFO L376 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:03:13,040 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:03:13,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1947951390, now seen corresponding path program 1 times [2018-09-20 15:03:13,041 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:03:13,041 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-09-20 15:03:13,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:03:13,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:03:13,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:03:13,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 14 treesize of output 11 [2018-09-20 15:03:13,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-20 15:03:13,164 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:03:13,194 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:03:13,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:03:13,216 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-20 15:03:13,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-20 15:03:13,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-20 15:03:13,263 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:03:13,267 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:03:13,278 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. [2018-09-20 15:03:13,278 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-20 15:03:13,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:03:13,542 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:03:13,556 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:03:13,556 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-20 15:03:13,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-20 15:03:13,557 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-20 15:03:13,557 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-20 15:03:13,558 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 9 states. [2018-09-20 15:03:14,633 WARN L178 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-09-20 15:03:15,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:03:15,258 INFO L93 Difference]: Finished difference Result 97 states and 98 transitions. [2018-09-20 15:03:15,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-20 15:03:15,267 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 44 [2018-09-20 15:03:15,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:03:15,268 INFO L225 Difference]: With dead ends: 97 [2018-09-20 15:03:15,269 INFO L226 Difference]: Without dead ends: 61 [2018-09-20 15:03:15,270 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2018-09-20 15:03:15,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-09-20 15:03:15,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-09-20 15:03:15,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-09-20 15:03:15,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-09-20 15:03:15,278 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 44 [2018-09-20 15:03:15,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:03:15,278 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-09-20 15:03:15,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-20 15:03:15,279 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-09-20 15:03:15,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-09-20 15:03:15,280 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:03:15,280 INFO L376 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:03:15,280 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:03:15,281 INFO L82 PathProgramCache]: Analyzing trace with hash -671735205, now seen corresponding path program 1 times [2018-09-20 15:03:15,281 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:03:15,281 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) [2018-09-20 15:03:15,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2018-09-20 15:03:15,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:03:15,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:03:15,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 15 treesize of output 12 [2018-09-20 15:03:15,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-09-20 15:03:15,422 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:03:15,426 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:03:15,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:03:15,431 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-09-20 15:03:15,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 23 treesize of output 18 [2018-09-20 15:03:15,466 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:03:15,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 25 [2018-09-20 15:03:15,472 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:03:15,490 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:03:15,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:03:15,503 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2018-09-20 15:03:15,538 INFO L477 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 64 treesize of output 48 [2018-09-20 15:03:15,581 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:03:15,592 INFO L477 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 48 treesize of output 28 [2018-09-20 15:03:15,593 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:03:15,602 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:03:15,606 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. [2018-09-20 15:03:15,606 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:64, output treesize:21 [2018-09-20 15:03:15,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:03:15,867 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:03:15,878 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:03:15,879 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-20 15:03:15,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-20 15:03:15,880 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-20 15:03:15,880 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-09-20 15:03:15,881 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 10 states. [2018-09-20 15:03:16,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:03:16,712 INFO L93 Difference]: Finished difference Result 64 states and 63 transitions. [2018-09-20 15:03:16,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-20 15:03:16,713 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 44 [2018-09-20 15:03:16,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:03:16,714 INFO L225 Difference]: With dead ends: 64 [2018-09-20 15:03:16,714 INFO L226 Difference]: Without dead ends: 61 [2018-09-20 15:03:16,715 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-20 15:03:16,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-09-20 15:03:16,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-09-20 15:03:16,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-09-20 15:03:16,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 60 transitions. [2018-09-20 15:03:16,723 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 60 transitions. Word has length 44 [2018-09-20 15:03:16,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:03:16,724 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 60 transitions. [2018-09-20 15:03:16,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-20 15:03:16,724 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 60 transitions. [2018-09-20 15:03:16,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-20 15:03:16,725 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:03:16,726 INFO L376 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 15:03:16,726 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:03:16,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1271085422, now seen corresponding path program 1 times [2018-09-20 15:03:16,727 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:03:16,727 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-09-20 15:03:16,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:03:16,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:03:16,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:03:16,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 14 treesize of output 11 [2018-09-20 15:03:16,918 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-20 15:03:16,919 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:03:16,926 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:03:16,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:03:16,945 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-20 15:03:16,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-20 15:03:16,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-20 15:03:16,984 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:03:16,988 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:03:17,001 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. [2018-09-20 15:03:17,001 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-20 15:03:17,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 16 treesize of output 13 [2018-09-20 15:03:17,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-09-20 15:03:17,157 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:03:17,162 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:03:17,179 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:03:17,179 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:22 [2018-09-20 15:03:17,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2018-09-20 15:03:17,261 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:03:17,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 26 [2018-09-20 15:03:17,268 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:03:17,286 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:03:17,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:03:17,309 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:29 [2018-09-20 15:03:17,475 INFO L477 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 65 treesize of output 49 [2018-09-20 15:03:17,485 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:03:17,491 INFO L477 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 49 treesize of output 31 [2018-09-20 15:03:17,492 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:03:17,504 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:03:17,522 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. [2018-09-20 15:03:17,523 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:74, output treesize:34 [2018-09-20 15:03:18,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 14 treesize of output 11 [2018-09-20 15:03:18,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-09-20 15:03:18,159 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:03:18,165 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:03:18,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:03:18,187 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-20 15:03:18,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-09-20 15:03:18,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-09-20 15:03:18,381 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:03:18,385 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:03:18,400 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. [2018-09-20 15:03:18,400 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-20 15:03:19,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:03:19,120 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:03:19,138 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:03:19,138 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-09-20 15:03:19,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-20 15:03:19,139 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-20 15:03:19,140 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2018-09-20 15:03:19,140 INFO L87 Difference]: Start difference. First operand 61 states and 60 transitions. Second operand 22 states. [2018-09-20 15:03:20,029 WARN L178 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-09-20 15:03:21,349 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-09-20 15:03:22,329 WARN L178 SmtUtils]: Spent 453.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-09-20 15:03:25,829 WARN L178 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-09-20 15:03:26,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:03:26,020 INFO L93 Difference]: Finished difference Result 61 states and 60 transitions. [2018-09-20 15:03:26,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-20 15:03:26,021 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 60 [2018-09-20 15:03:26,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:03:26,023 INFO L225 Difference]: With dead ends: 61 [2018-09-20 15:03:26,023 INFO L226 Difference]: Without dead ends: 0 [2018-09-20 15:03:26,025 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=201, Invalid=1779, Unknown=0, NotChecked=0, Total=1980 [2018-09-20 15:03:26,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-20 15:03:26,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-20 15:03:26,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-20 15:03:26,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-20 15:03:26,026 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 60 [2018-09-20 15:03:26,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:03:26,026 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-20 15:03:26,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-20 15:03:26,026 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-20 15:03:26,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-20 15:03:26,031 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-20 15:03:26,338 WARN L178 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-09-20 15:03:26,526 WARN L178 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 45 [2018-09-20 15:03:27,154 WARN L178 SmtUtils]: Spent 606.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2018-09-20 15:03:27,157 INFO L426 ceAbstractionStarter]: For program point isnan_doubleENTRY(line 15) no Hoare annotation was computed. [2018-09-20 15:03:27,157 INFO L426 ceAbstractionStarter]: For program point isnan_doubleEXIT(line 15) no Hoare annotation was computed. [2018-09-20 15:03:27,157 INFO L426 ceAbstractionStarter]: For program point isnan_doubleFINAL(line 15) no Hoare annotation was computed. [2018-09-20 15:03:27,158 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-09-20 15:03:27,158 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-09-20 15:03:27,158 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-09-20 15:03:27,158 INFO L426 ceAbstractionStarter]: For program point L66-1(line 66) no Hoare annotation was computed. [2018-09-20 15:03:27,158 INFO L426 ceAbstractionStarter]: For program point L66-2(line 66) no Hoare annotation was computed. [2018-09-20 15:03:27,158 INFO L426 ceAbstractionStarter]: For program point L65-1(lines 65 69) no Hoare annotation was computed. [2018-09-20 15:03:27,158 INFO L426 ceAbstractionStarter]: For program point L66-3(line 66) no Hoare annotation was computed. [2018-09-20 15:03:27,158 INFO L422 ceAbstractionStarter]: At program point L65-3(lines 65 69) the Hoare annotation is: (= |__signbit_double_#in~x| __signbit_double_~x) [2018-09-20 15:03:27,159 INFO L426 ceAbstractionStarter]: For program point L65-4(lines 65 69) no Hoare annotation was computed. [2018-09-20 15:03:27,159 INFO L426 ceAbstractionStarter]: For program point __signbit_doubleFINAL(lines 62 72) no Hoare annotation was computed. [2018-09-20 15:03:27,159 INFO L426 ceAbstractionStarter]: For program point __signbit_doubleEXIT(lines 62 72) no Hoare annotation was computed. [2018-09-20 15:03:27,159 INFO L429 ceAbstractionStarter]: At program point __signbit_doubleENTRY(lines 62 72) the Hoare annotation is: true [2018-09-20 15:03:27,159 INFO L426 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2018-09-20 15:03:27,159 INFO L426 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-09-20 15:03:27,159 INFO L426 ceAbstractionStarter]: For program point L68-1(line 68) no Hoare annotation was computed. [2018-09-20 15:03:27,159 INFO L426 ceAbstractionStarter]: For program point L66(line 66) no Hoare annotation was computed. [2018-09-20 15:03:27,159 INFO L426 ceAbstractionStarter]: For program point L68-2(line 68) no Hoare annotation was computed. [2018-09-20 15:03:27,159 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-09-20 15:03:27,160 INFO L429 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-09-20 15:03:27,160 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-09-20 15:03:27,160 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-09-20 15:03:27,160 INFO L429 ceAbstractionStarter]: At program point mainENTRY(lines 74 91) the Hoare annotation is: true [2018-09-20 15:03:27,160 INFO L426 ceAbstractionStarter]: For program point mainEXIT(lines 74 91) no Hoare annotation was computed. [2018-09-20 15:03:27,160 INFO L426 ceAbstractionStarter]: For program point L86(line 86) no Hoare annotation was computed. [2018-09-20 15:03:27,160 INFO L426 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-09-20 15:03:27,160 INFO L422 ceAbstractionStarter]: At program point L85-1(line 85) the Hoare annotation is: (and |main_#t~short14| (= (_ +zero 11 53) main_~x~0) (exists ((|v_q#valueAsBitvector_8| (_ BitVec 64))) (and (= (let ((.cse0 (concat (bvand ((_ extract 63 32) |v_q#valueAsBitvector_8|) (_ bv2147483648 32)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) main_~res~0) (= (_ +zero 11 53) (fp ((_ extract 63 63) |v_q#valueAsBitvector_8|) ((_ extract 62 52) |v_q#valueAsBitvector_8|) ((_ extract 51 0) |v_q#valueAsBitvector_8|)))))) [2018-09-20 15:03:27,161 INFO L426 ceAbstractionStarter]: For program point L85-2(line 85) no Hoare annotation was computed. [2018-09-20 15:03:27,161 INFO L422 ceAbstractionStarter]: At program point L82(line 82) the Hoare annotation is: (= (_ +zero 11 53) main_~x~0) [2018-09-20 15:03:27,161 INFO L426 ceAbstractionStarter]: For program point L82-1(line 82) no Hoare annotation was computed. [2018-09-20 15:03:27,161 INFO L426 ceAbstractionStarter]: For program point L85-4(lines 85 88) no Hoare annotation was computed. [2018-09-20 15:03:27,161 INFO L426 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 86) no Hoare annotation was computed. [2018-09-20 15:03:27,161 INFO L426 ceAbstractionStarter]: For program point mainFINAL(lines 74 91) no Hoare annotation was computed. [2018-09-20 15:03:27,161 INFO L426 ceAbstractionStarter]: For program point L52-1(lines 52 57) no Hoare annotation was computed. [2018-09-20 15:03:27,162 INFO L422 ceAbstractionStarter]: At program point L52-3(lines 52 57) the Hoare annotation is: (and (exists ((|v_q#valueAsBitvector_6| (_ BitVec 64))) (and (= ((_ extract 63 32) |v_q#valueAsBitvector_6|) trunc_double_~msw~0) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_6|) ((_ extract 62 52) |v_q#valueAsBitvector_6|) ((_ extract 51 0) |v_q#valueAsBitvector_6|)) |trunc_double_#in~x|))) (exists ((|v_q#valueAsBitvector_6| (_ BitVec 64))) (and (not (bvslt (bvadd (bvashr (bvand ((_ extract 63 32) |v_q#valueAsBitvector_6|) (_ bv2146435072 32)) (_ bv20 32)) (_ bv4294966273 32)) (_ bv20 32))) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_6|) ((_ extract 62 52) |v_q#valueAsBitvector_6|) ((_ extract 51 0) |v_q#valueAsBitvector_6|)) |trunc_double_#in~x|))) (exists ((|v_q#valueAsBitvector_6| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_6|) ((_ extract 62 52) |v_q#valueAsBitvector_6|) ((_ extract 51 0) |v_q#valueAsBitvector_6|)) |trunc_double_#in~x|) (= (bvadd (bvashr (bvand ((_ extract 63 32) |v_q#valueAsBitvector_6|) (_ bv2146435072 32)) (_ bv20 32)) (_ bv4294966273 32)) trunc_double_~exponent_less_1023~0))) (= trunc_double_~x |trunc_double_#in~x|)) [2018-09-20 15:03:27,162 INFO L426 ceAbstractionStarter]: For program point L52-4(lines 30 58) no Hoare annotation was computed. [2018-09-20 15:03:27,162 INFO L426 ceAbstractionStarter]: For program point L44(line 44) no Hoare annotation was computed. [2018-09-20 15:03:27,162 INFO L426 ceAbstractionStarter]: For program point L44-1(line 44) no Hoare annotation was computed. [2018-09-20 15:03:27,162 INFO L426 ceAbstractionStarter]: For program point L44-2(line 44) no Hoare annotation was computed. [2018-09-20 15:03:27,162 INFO L426 ceAbstractionStarter]: For program point L44-3(line 44) no Hoare annotation was computed. [2018-09-20 15:03:27,162 INFO L426 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2018-09-20 15:03:27,162 INFO L426 ceAbstractionStarter]: For program point L36-1(line 36) no Hoare annotation was computed. [2018-09-20 15:03:27,162 INFO L426 ceAbstractionStarter]: For program point L36-2(line 36) no Hoare annotation was computed. [2018-09-20 15:03:27,163 INFO L426 ceAbstractionStarter]: For program point L36-3(line 36) no Hoare annotation was computed. [2018-09-20 15:03:27,163 INFO L426 ceAbstractionStarter]: For program point L53(line 53) no Hoare annotation was computed. [2018-09-20 15:03:27,163 INFO L426 ceAbstractionStarter]: For program point L53-1(line 53) no Hoare annotation was computed. [2018-09-20 15:03:27,163 INFO L426 ceAbstractionStarter]: For program point L53-2(line 53) no Hoare annotation was computed. [2018-09-20 15:03:27,163 INFO L426 ceAbstractionStarter]: For program point L53-3(line 53) no Hoare annotation was computed. [2018-09-20 15:03:27,163 INFO L426 ceAbstractionStarter]: For program point trunc_doubleEXIT(lines 17 60) no Hoare annotation was computed. [2018-09-20 15:03:27,163 INFO L426 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2018-09-20 15:03:27,163 INFO L426 ceAbstractionStarter]: For program point trunc_doubleFINAL(lines 17 60) no Hoare annotation was computed. [2018-09-20 15:03:27,163 INFO L426 ceAbstractionStarter]: For program point L30(lines 30 58) no Hoare annotation was computed. [2018-09-20 15:03:27,164 INFO L426 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-09-20 15:03:27,164 INFO L426 ceAbstractionStarter]: For program point L22-1(lines 22 27) no Hoare annotation was computed. [2018-09-20 15:03:27,164 INFO L422 ceAbstractionStarter]: At program point L22-3(lines 22 27) the Hoare annotation is: (= trunc_double_~x |trunc_double_#in~x|) [2018-09-20 15:03:27,164 INFO L426 ceAbstractionStarter]: For program point L22-4(lines 22 27) no Hoare annotation was computed. [2018-09-20 15:03:27,164 INFO L426 ceAbstractionStarter]: For program point L47(lines 47 58) no Hoare annotation was computed. [2018-09-20 15:03:27,164 INFO L426 ceAbstractionStarter]: For program point L39-1(lines 39 45) no Hoare annotation was computed. [2018-09-20 15:03:27,164 INFO L422 ceAbstractionStarter]: At program point L39-3(lines 39 45) the Hoare annotation is: (and (exists ((|v_q#valueAsBitvector_7| (_ BitVec 64))) (and (not (bvslt (bvadd (bvashr (bvand ((_ extract 63 32) |v_q#valueAsBitvector_7|) (_ bv2146435072 32)) (_ bv20 32)) (_ bv4294966273 32)) (_ bv0 32))) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_7|) ((_ extract 62 52) |v_q#valueAsBitvector_7|) ((_ extract 51 0) |v_q#valueAsBitvector_7|)) |trunc_double_#in~x|))) (exists ((|v_q#valueAsBitvector_6| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_6|) ((_ extract 62 52) |v_q#valueAsBitvector_6|) ((_ extract 51 0) |v_q#valueAsBitvector_6|)) |trunc_double_#in~x|) (= (bvadd (bvashr (bvand ((_ extract 63 32) |v_q#valueAsBitvector_6|) (_ bv2146435072 32)) (_ bv20 32)) (_ bv4294966273 32)) trunc_double_~exponent_less_1023~0))) (exists ((|v_q#valueAsBitvector_7| (_ BitVec 64))) (and (= ((_ extract 63 32) |v_q#valueAsBitvector_7|) trunc_double_~msw~0) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_7|) ((_ extract 62 52) |v_q#valueAsBitvector_7|) ((_ extract 51 0) |v_q#valueAsBitvector_7|)) |trunc_double_#in~x|))) (= trunc_double_~x |trunc_double_#in~x|)) [2018-09-20 15:03:27,164 INFO L426 ceAbstractionStarter]: For program point L31(lines 31 46) no Hoare annotation was computed. [2018-09-20 15:03:27,165 INFO L426 ceAbstractionStarter]: For program point L56(line 56) no Hoare annotation was computed. [2018-09-20 15:03:27,165 INFO L426 ceAbstractionStarter]: For program point L23(line 23) no Hoare annotation was computed. [2018-09-20 15:03:27,165 INFO L426 ceAbstractionStarter]: For program point L56-1(line 56) no Hoare annotation was computed. [2018-09-20 15:03:27,165 INFO L426 ceAbstractionStarter]: For program point L23-1(line 23) no Hoare annotation was computed. [2018-09-20 15:03:27,165 INFO L426 ceAbstractionStarter]: For program point L56-2(line 56) no Hoare annotation was computed. [2018-09-20 15:03:27,165 INFO L426 ceAbstractionStarter]: For program point L23-2(line 23) no Hoare annotation was computed. [2018-09-20 15:03:27,165 INFO L426 ceAbstractionStarter]: For program point L56-3(line 56) no Hoare annotation was computed. [2018-09-20 15:03:27,165 INFO L426 ceAbstractionStarter]: For program point L23-3(line 23) no Hoare annotation was computed. [2018-09-20 15:03:27,165 INFO L426 ceAbstractionStarter]: For program point L48(lines 48 50) no Hoare annotation was computed. [2018-09-20 15:03:27,165 INFO L426 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-09-20 15:03:27,166 INFO L426 ceAbstractionStarter]: For program point L40-1(line 40) no Hoare annotation was computed. [2018-09-20 15:03:27,166 INFO L426 ceAbstractionStarter]: For program point L40-2(line 40) no Hoare annotation was computed. [2018-09-20 15:03:27,166 INFO L426 ceAbstractionStarter]: For program point L40-3(line 40) no Hoare annotation was computed. [2018-09-20 15:03:27,166 INFO L426 ceAbstractionStarter]: For program point L32-1(lines 32 37) no Hoare annotation was computed. [2018-09-20 15:03:27,166 INFO L422 ceAbstractionStarter]: At program point L32-3(lines 32 37) the Hoare annotation is: (and (exists ((|v_q#valueAsBitvector_8| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_8|) ((_ extract 62 52) |v_q#valueAsBitvector_8|) ((_ extract 51 0) |v_q#valueAsBitvector_8|)) |trunc_double_#in~x|) (= trunc_double_~signbit~0 (bvand ((_ extract 63 32) |v_q#valueAsBitvector_8|) (_ bv2147483648 32))))) (exists ((|v_q#valueAsBitvector_6| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_6|) ((_ extract 62 52) |v_q#valueAsBitvector_6|) ((_ extract 51 0) |v_q#valueAsBitvector_6|)) |trunc_double_#in~x|) (= (bvadd (bvashr (bvand ((_ extract 63 32) |v_q#valueAsBitvector_6|) (_ bv2146435072 32)) (_ bv20 32)) (_ bv4294966273 32)) trunc_double_~exponent_less_1023~0))) (exists ((|v_q#valueAsBitvector_7| (_ BitVec 64))) (and (= ((_ extract 63 32) |v_q#valueAsBitvector_7|) trunc_double_~msw~0) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_7|) ((_ extract 62 52) |v_q#valueAsBitvector_7|) ((_ extract 51 0) |v_q#valueAsBitvector_7|)) |trunc_double_#in~x|))) (= trunc_double_~x |trunc_double_#in~x|)) [2018-09-20 15:03:27,166 INFO L426 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-09-20 15:03:27,166 INFO L429 ceAbstractionStarter]: At program point trunc_doubleENTRY(lines 17 60) the Hoare annotation is: true [2018-09-20 15:03:27,166 INFO L426 ceAbstractionStarter]: For program point L41(lines 41 42) no Hoare annotation was computed. [2018-09-20 15:03:27,167 INFO L426 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2018-09-20 15:03:27,167 INFO L426 ceAbstractionStarter]: For program point L33-1(line 33) no Hoare annotation was computed. [2018-09-20 15:03:27,167 INFO L426 ceAbstractionStarter]: For program point L33-2(line 33) no Hoare annotation was computed. [2018-09-20 15:03:27,167 INFO L426 ceAbstractionStarter]: For program point L33-3(line 33) no Hoare annotation was computed. [2018-09-20 15:03:27,167 INFO L426 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-09-20 15:03:27,167 INFO L426 ceAbstractionStarter]: For program point L25-1(line 25) no Hoare annotation was computed. [2018-09-20 15:03:27,167 INFO L426 ceAbstractionStarter]: For program point L25-2(line 25) no Hoare annotation was computed. [2018-09-20 15:03:27,167 INFO L426 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-09-20 15:03:27,167 INFO L426 ceAbstractionStarter]: For program point L26(line 26) no Hoare annotation was computed. [2018-09-20 15:03:27,168 INFO L426 ceAbstractionStarter]: For program point L26-1(line 26) no Hoare annotation was computed. [2018-09-20 15:03:27,168 INFO L426 ceAbstractionStarter]: For program point L26-2(line 26) no Hoare annotation was computed. [2018-09-20 15:03:27,168 INFO L426 ceAbstractionStarter]: For program point L26-3(line 26) no Hoare annotation was computed. [2018-09-20 15:03:27,168 INFO L426 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-09-20 15:03:27,168 INFO L426 ceAbstractionStarter]: For program point L35(line 35) no Hoare annotation was computed. [2018-09-20 15:03:27,173 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-09-20 15:03:27,175 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-09-20 15:03:27,175 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-09-20 15:03:27,175 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-09-20 15:03:27,175 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-09-20 15:03:27,176 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-09-20 15:03:27,176 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-09-20 15:03:27,176 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-09-20 15:03:27,176 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-09-20 15:03:27,176 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-09-20 15:03:27,177 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-09-20 15:03:27,177 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-09-20 15:03:27,186 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-09-20 15:03:27,186 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-09-20 15:03:27,186 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-09-20 15:03:27,186 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-09-20 15:03:27,187 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-09-20 15:03:27,187 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-09-20 15:03:27,187 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-09-20 15:03:27,187 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-09-20 15:03:27,187 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-09-20 15:03:27,187 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-09-20 15:03:27,188 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-09-20 15:03:27,188 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-09-20 15:03:27,190 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_8,QUANTIFIED] [2018-09-20 15:03:27,191 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_8,QUANTIFIED] [2018-09-20 15:03:27,191 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_8,QUANTIFIED] [2018-09-20 15:03:27,191 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_8,QUANTIFIED] [2018-09-20 15:03:27,191 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-09-20 15:03:27,191 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-09-20 15:03:27,192 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-09-20 15:03:27,192 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-09-20 15:03:27,192 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-09-20 15:03:27,192 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-09-20 15:03:27,192 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-09-20 15:03:27,192 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-09-20 15:03:27,194 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_8,QUANTIFIED] [2018-09-20 15:03:27,194 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_8,QUANTIFIED] [2018-09-20 15:03:27,194 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_8,QUANTIFIED] [2018-09-20 15:03:27,195 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_8,QUANTIFIED] [2018-09-20 15:03:27,195 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-09-20 15:03:27,195 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-09-20 15:03:27,195 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-09-20 15:03:27,195 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-09-20 15:03:27,196 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-09-20 15:03:27,196 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-09-20 15:03:27,196 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-09-20 15:03:27,196 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-09-20 15:03:27,198 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-09-20 15:03:27,198 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-09-20 15:03:27,198 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-09-20 15:03:27,198 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-09-20 15:03:27,198 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-09-20 15:03:27,199 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-09-20 15:03:27,199 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-09-20 15:03:27,199 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-09-20 15:03:27,199 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-09-20 15:03:27,199 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-09-20 15:03:27,200 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-09-20 15:03:27,200 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-09-20 15:03:27,201 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-09-20 15:03:27,201 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-09-20 15:03:27,201 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-09-20 15:03:27,201 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-09-20 15:03:27,202 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-09-20 15:03:27,202 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-09-20 15:03:27,202 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-09-20 15:03:27,202 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-09-20 15:03:27,202 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-09-20 15:03:27,203 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-09-20 15:03:27,203 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-09-20 15:03:27,203 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-09-20 15:03:27,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 03:03:27 BoogieIcfgContainer [2018-09-20 15:03:27,205 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-20 15:03:27,206 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-09-20 15:03:27,206 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-09-20 15:03:27,206 INFO L276 PluginConnector]: Witness Printer initialized [2018-09-20 15:03:27,207 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:03:09" (3/4) ... [2018-09-20 15:03:27,211 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-09-20 15:03:27,219 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure isnan_double [2018-09-20 15:03:27,219 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-09-20 15:03:27,220 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure __signbit_double [2018-09-20 15:03:27,220 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-09-20 15:03:27,220 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure trunc_double [2018-09-20 15:03:27,227 INFO L850 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2018-09-20 15:03:27,227 INFO L850 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-09-20 15:03:27,228 INFO L850 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-09-20 15:03:27,270 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: x == \old(x) [2018-09-20 15:03:27,270 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(x) == x [2018-09-20 15:03:27,273 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\exists v_q#valueAsBitvector_8 : bv64 :: ~fp~LONGDOUBLE(v_q#valueAsBitvector_8[63:63], v_q#valueAsBitvector_8[62:52], v_q#valueAsBitvector_8[51:0]) == \old(x) && signbit == ~bvand32(v_q#valueAsBitvector_8[63:32], 2147483648bv32)) && (\exists v_q#valueAsBitvector_6 : bv64 :: ~fp~LONGDOUBLE(v_q#valueAsBitvector_6[63:63], v_q#valueAsBitvector_6[62:52], v_q#valueAsBitvector_6[51:0]) == \old(x) && ~bvadd64(~bvashr32(~bvand32(v_q#valueAsBitvector_6[63:32], 2146435072bv32), 20bv32), 4294966273bv32) == exponent_less_1023)) && (\exists v_q#valueAsBitvector_7 : bv64 :: v_q#valueAsBitvector_7[63:32] == msw && ~fp~LONGDOUBLE(v_q#valueAsBitvector_7[63:63], v_q#valueAsBitvector_7[62:52], v_q#valueAsBitvector_7[51:0]) == \old(x))) && x == \old(x) [2018-09-20 15:03:27,273 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\exists v_q#valueAsBitvector_7 : bv64 :: !~bvslt32(~bvadd64(~bvashr32(~bvand32(v_q#valueAsBitvector_7[63:32], 2146435072bv32), 20bv32), 4294966273bv32), 0bv32) && ~fp~LONGDOUBLE(v_q#valueAsBitvector_7[63:63], v_q#valueAsBitvector_7[62:52], v_q#valueAsBitvector_7[51:0]) == \old(x)) && (\exists v_q#valueAsBitvector_6 : bv64 :: ~fp~LONGDOUBLE(v_q#valueAsBitvector_6[63:63], v_q#valueAsBitvector_6[62:52], v_q#valueAsBitvector_6[51:0]) == \old(x) && ~bvadd64(~bvashr32(~bvand32(v_q#valueAsBitvector_6[63:32], 2146435072bv32), 20bv32), 4294966273bv32) == exponent_less_1023)) && (\exists v_q#valueAsBitvector_7 : bv64 :: v_q#valueAsBitvector_7[63:32] == msw && ~fp~LONGDOUBLE(v_q#valueAsBitvector_7[63:63], v_q#valueAsBitvector_7[62:52], v_q#valueAsBitvector_7[51:0]) == \old(x))) && x == \old(x) [2018-09-20 15:03:27,273 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\exists v_q#valueAsBitvector_6 : bv64 :: v_q#valueAsBitvector_6[63:32] == msw && ~fp~LONGDOUBLE(v_q#valueAsBitvector_6[63:63], v_q#valueAsBitvector_6[62:52], v_q#valueAsBitvector_6[51:0]) == \old(x)) && (\exists v_q#valueAsBitvector_6 : bv64 :: !~bvslt32(~bvadd64(~bvashr32(~bvand32(v_q#valueAsBitvector_6[63:32], 2146435072bv32), 20bv32), 4294966273bv32), 20bv32) && ~fp~LONGDOUBLE(v_q#valueAsBitvector_6[63:63], v_q#valueAsBitvector_6[62:52], v_q#valueAsBitvector_6[51:0]) == \old(x))) && (\exists v_q#valueAsBitvector_6 : bv64 :: ~fp~LONGDOUBLE(v_q#valueAsBitvector_6[63:63], v_q#valueAsBitvector_6[62:52], v_q#valueAsBitvector_6[51:0]) == \old(x) && ~bvadd64(~bvashr32(~bvand32(v_q#valueAsBitvector_6[63:32], 2146435072bv32), 20bv32), 4294966273bv32) == exponent_less_1023)) && x == \old(x) [2018-09-20 15:03:27,312 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-09-20 15:03:27,312 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-09-20 15:03:27,313 INFO L168 Benchmark]: Toolchain (without parser) took 19522.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 203.4 MB). Free memory was 951.9 MB in the beginning and 930.6 MB in the end (delta: 21.3 MB). Peak memory consumption was 224.7 MB. Max. memory is 11.5 GB. [2018-09-20 15:03:27,315 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 15:03:27,315 INFO L168 Benchmark]: CACSL2BoogieTranslator took 342.63 ms. Allocated memory is still 1.0 GB. Free memory was 951.9 MB in the beginning and 941.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-09-20 15:03:27,316 INFO L168 Benchmark]: Boogie Preprocessor took 70.91 ms. Allocated memory is still 1.0 GB. Free memory was 941.1 MB in the beginning and 935.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-09-20 15:03:27,317 INFO L168 Benchmark]: RCFGBuilder took 1021.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 935.7 MB in the beginning and 1.1 GB in the end (delta: -164.5 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2018-09-20 15:03:27,317 INFO L168 Benchmark]: TraceAbstraction took 17973.28 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 64.0 MB). Free memory was 1.1 GB in the beginning and 938.3 MB in the end (delta: 161.9 MB). Peak memory consumption was 225.9 MB. Max. memory is 11.5 GB. [2018-09-20 15:03:27,318 INFO L168 Benchmark]: Witness Printer took 105.90 ms. Allocated memory is still 1.2 GB. Free memory was 938.3 MB in the beginning and 930.6 MB in the end (delta: 7.7 MB). Peak memory consumption was 7.7 MB. Max. memory is 11.5 GB. [2018-09-20 15:03:27,324 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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 342.63 ms. Allocated memory is still 1.0 GB. Free memory was 951.9 MB in the beginning and 941.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 70.91 ms. Allocated memory is still 1.0 GB. Free memory was 941.1 MB in the beginning and 935.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1021.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 935.7 MB in the beginning and 1.1 GB in the end (delta: -164.5 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17973.28 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 64.0 MB). Free memory was 1.1 GB in the beginning and 938.3 MB in the end (delta: 161.9 MB). Peak memory consumption was 225.9 MB. Max. memory is 11.5 GB. * Witness Printer took 105.90 ms. Allocated memory is still 1.2 GB. Free memory was 938.3 MB in the beginning and 930.6 MB in the end (delta: 7.7 MB). Peak memory consumption was 7.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 86]: 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: 52]: Loop Invariant [2018-09-20 15:03:27,343 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-09-20 15:03:27,343 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-09-20 15:03:27,343 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-09-20 15:03:27,344 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-09-20 15:03:27,344 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-09-20 15:03:27,344 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-09-20 15:03:27,344 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-09-20 15:03:27,344 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-09-20 15:03:27,347 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-09-20 15:03:27,347 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-09-20 15:03:27,347 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-09-20 15:03:27,347 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-09-20 15:03:27,348 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-09-20 15:03:27,351 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-09-20 15:03:27,352 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-09-20 15:03:27,352 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-09-20 15:03:27,352 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-09-20 15:03:27,352 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-09-20 15:03:27,352 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-09-20 15:03:27,352 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-09-20 15:03:27,353 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-09-20 15:03:27,353 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-09-20 15:03:27,353 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-09-20 15:03:27,353 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] Derived loop invariant: (((\exists v_q#valueAsBitvector_6 : bv64 :: v_q#valueAsBitvector_6[63:32] == msw && ~fp~LONGDOUBLE(v_q#valueAsBitvector_6[63:63], v_q#valueAsBitvector_6[62:52], v_q#valueAsBitvector_6[51:0]) == \old(x)) && (\exists v_q#valueAsBitvector_6 : bv64 :: !~bvslt32(~bvadd64(~bvashr32(~bvand32(v_q#valueAsBitvector_6[63:32], 2146435072bv32), 20bv32), 4294966273bv32), 20bv32) && ~fp~LONGDOUBLE(v_q#valueAsBitvector_6[63:63], v_q#valueAsBitvector_6[62:52], v_q#valueAsBitvector_6[51:0]) == \old(x))) && (\exists v_q#valueAsBitvector_6 : bv64 :: ~fp~LONGDOUBLE(v_q#valueAsBitvector_6[63:63], v_q#valueAsBitvector_6[62:52], v_q#valueAsBitvector_6[51:0]) == \old(x) && ~bvadd64(~bvashr32(~bvand32(v_q#valueAsBitvector_6[63:32], 2146435072bv32), 20bv32), 4294966273bv32) == exponent_less_1023)) && x == \old(x) - InvariantResult [Line: 32]: Loop Invariant [2018-09-20 15:03:27,355 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_8,QUANTIFIED] [2018-09-20 15:03:27,355 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_8,QUANTIFIED] [2018-09-20 15:03:27,355 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_8,QUANTIFIED] [2018-09-20 15:03:27,355 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_8,QUANTIFIED] [2018-09-20 15:03:27,355 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-09-20 15:03:27,358 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-09-20 15:03:27,359 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-09-20 15:03:27,359 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-09-20 15:03:27,359 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-09-20 15:03:27,359 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-09-20 15:03:27,359 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-09-20 15:03:27,360 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-09-20 15:03:27,361 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_8,QUANTIFIED] [2018-09-20 15:03:27,361 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_8,QUANTIFIED] [2018-09-20 15:03:27,361 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_8,QUANTIFIED] [2018-09-20 15:03:27,361 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_8,QUANTIFIED] [2018-09-20 15:03:27,361 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-09-20 15:03:27,364 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-09-20 15:03:27,365 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-09-20 15:03:27,365 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-09-20 15:03:27,365 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-09-20 15:03:27,365 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-09-20 15:03:27,365 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-09-20 15:03:27,365 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] Derived loop invariant: (((\exists v_q#valueAsBitvector_8 : bv64 :: ~fp~LONGDOUBLE(v_q#valueAsBitvector_8[63:63], v_q#valueAsBitvector_8[62:52], v_q#valueAsBitvector_8[51:0]) == \old(x) && signbit == ~bvand32(v_q#valueAsBitvector_8[63:32], 2147483648bv32)) && (\exists v_q#valueAsBitvector_6 : bv64 :: ~fp~LONGDOUBLE(v_q#valueAsBitvector_6[63:63], v_q#valueAsBitvector_6[62:52], v_q#valueAsBitvector_6[51:0]) == \old(x) && ~bvadd64(~bvashr32(~bvand32(v_q#valueAsBitvector_6[63:32], 2146435072bv32), 20bv32), 4294966273bv32) == exponent_less_1023)) && (\exists v_q#valueAsBitvector_7 : bv64 :: v_q#valueAsBitvector_7[63:32] == msw && ~fp~LONGDOUBLE(v_q#valueAsBitvector_7[63:63], v_q#valueAsBitvector_7[62:52], v_q#valueAsBitvector_7[51:0]) == \old(x))) && x == \old(x) - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: \old(x) == x - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: x == \old(x) - InvariantResult [Line: 39]: Loop Invariant [2018-09-20 15:03:27,367 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-09-20 15:03:27,367 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-09-20 15:03:27,367 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-09-20 15:03:27,371 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-09-20 15:03:27,371 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-09-20 15:03:27,371 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-09-20 15:03:27,371 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-09-20 15:03:27,371 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-09-20 15:03:27,371 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-09-20 15:03:27,372 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-09-20 15:03:27,372 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-09-20 15:03:27,372 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-09-20 15:03:27,373 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-09-20 15:03:27,373 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-09-20 15:03:27,373 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-09-20 15:03:27,375 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-09-20 15:03:27,376 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-09-20 15:03:27,376 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-09-20 15:03:27,376 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-09-20 15:03:27,376 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_6,QUANTIFIED] [2018-09-20 15:03:27,376 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-09-20 15:03:27,377 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-09-20 15:03:27,377 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] [2018-09-20 15:03:27,377 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_7,QUANTIFIED] Derived loop invariant: (((\exists v_q#valueAsBitvector_7 : bv64 :: !~bvslt32(~bvadd64(~bvashr32(~bvand32(v_q#valueAsBitvector_7[63:32], 2146435072bv32), 20bv32), 4294966273bv32), 0bv32) && ~fp~LONGDOUBLE(v_q#valueAsBitvector_7[63:63], v_q#valueAsBitvector_7[62:52], v_q#valueAsBitvector_7[51:0]) == \old(x)) && (\exists v_q#valueAsBitvector_6 : bv64 :: ~fp~LONGDOUBLE(v_q#valueAsBitvector_6[63:63], v_q#valueAsBitvector_6[62:52], v_q#valueAsBitvector_6[51:0]) == \old(x) && ~bvadd64(~bvashr32(~bvand32(v_q#valueAsBitvector_6[63:32], 2146435072bv32), 20bv32), 4294966273bv32) == exponent_less_1023)) && (\exists v_q#valueAsBitvector_7 : bv64 :: v_q#valueAsBitvector_7[63:32] == msw && ~fp~LONGDOUBLE(v_q#valueAsBitvector_7[63:63], v_q#valueAsBitvector_7[62:52], v_q#valueAsBitvector_7[51:0]) == \old(x))) && x == \old(x) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 94 locations, 1 error locations. SAFE Result, 17.8s OverallTime, 5 OverallIterations, 1 TraceHistogramMax, 11.9s AutomataDifference, 0.0s DeadEndRemovalTime, 1.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 309 SDtfs, 348 SDslu, 1486 SDs, 0 SdLazy, 760 SolverSat, 49 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 243 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 9.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=91occurred 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, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 19 PreInvPairs, 25 NumberOfFragments, 236 HoareAnnotationTreeSize, 19 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 13 FomulaSimplificationsInter, 93 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 199 NumberOfCodeBlocks, 199 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 194 ConstructedInterpolants, 106 QuantifiedInterpolants, 110067 SizeOfPredicates, 45 NumberOfNonLiveVariables, 387 ConjunctsInSsa, 54 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...