./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/float-newlib/double_req_bl_0662a_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/float-newlib/double_req_bl_0662a_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 c8db64e82d1b178f8644abd34ffdb7278ee391d6 ..................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/float-newlib/double_req_bl_0662a_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 c8db64e82d1b178f8644abd34ffdb7278ee391d6 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 09:00:01,098 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 09:00:01,099 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 09:00:01,111 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 09:00:01,111 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 09:00:01,113 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 09:00:01,114 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 09:00:01,115 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 09:00:01,117 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 09:00:01,118 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 09:00:01,119 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 09:00:01,119 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 09:00:01,120 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 09:00:01,121 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 09:00:01,122 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 09:00:01,123 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 09:00:01,124 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 09:00:01,126 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 09:00:01,128 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 09:00:01,129 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 09:00:01,130 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 09:00:01,132 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 09:00:01,134 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 09:00:01,134 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 09:00:01,135 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 09:00:01,136 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 09:00:01,137 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 09:00:01,138 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 09:00:01,138 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 09:00:01,140 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 09:00:01,140 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 09:00:01,141 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 09:00:01,141 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 09:00:01,141 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 09:00:01,142 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 09:00:01,143 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 09:00:01,143 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 09:00:01,158 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 09:00:01,158 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 09:00:01,160 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 09:00:01,160 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 09:00:01,160 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 09:00:01,160 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 09:00:01,160 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 09:00:01,161 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 09:00:01,161 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 09:00:01,161 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 09:00:01,161 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 09:00:01,161 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 09:00:01,161 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 09:00:01,162 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 09:00:01,162 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 09:00:01,162 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 09:00:01,162 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 09:00:01,162 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 09:00:01,162 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 09:00:01,163 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 09:00:01,163 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 09:00:01,163 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 09:00:01,163 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 09:00:01,163 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 09:00:01,164 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 09:00:01,164 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 09:00:01,164 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 09:00:01,164 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 09:00:01,164 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 -> c8db64e82d1b178f8644abd34ffdb7278ee391d6 [2019-01-12 09:00:01,198 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 09:00:01,212 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 09:00:01,216 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 09:00:01,218 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 09:00:01,218 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 09:00:01,220 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/double_req_bl_0662a_true-unreach-call.c [2019-01-12 09:00:01,290 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51a4563a4/504dd8ef161448f6946de88f31c7cf7e/FLAGb0708ee7e [2019-01-12 09:00:01,797 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 09:00:01,798 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/double_req_bl_0662a_true-unreach-call.c [2019-01-12 09:00:01,808 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51a4563a4/504dd8ef161448f6946de88f31c7cf7e/FLAGb0708ee7e [2019-01-12 09:00:02,150 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51a4563a4/504dd8ef161448f6946de88f31c7cf7e [2019-01-12 09:00:02,154 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 09:00:02,156 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 09:00:02,157 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 09:00:02,158 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 09:00:02,162 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 09:00:02,162 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:00:02" (1/1) ... [2019-01-12 09:00:02,166 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4eb4684 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:00:02, skipping insertion in model container [2019-01-12 09:00:02,166 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:00:02" (1/1) ... [2019-01-12 09:00:02,175 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 09:00:02,205 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 09:00:02,500 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:00:02,510 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 09:00:02,583 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:00:02,638 INFO L195 MainTranslator]: Completed translation [2019-01-12 09:00:02,638 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:00:02 WrapperNode [2019-01-12 09:00:02,638 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 09:00:02,639 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 09:00:02,640 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 09:00:02,640 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 09:00:02,712 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:00:02" (1/1) ... [2019-01-12 09:00:02,729 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:00:02" (1/1) ... [2019-01-12 09:00:02,790 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 09:00:02,791 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 09:00:02,791 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 09:00:02,791 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 09:00:02,802 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:00:02" (1/1) ... [2019-01-12 09:00:02,803 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:00:02" (1/1) ... [2019-01-12 09:00:02,813 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:00:02" (1/1) ... [2019-01-12 09:00:02,813 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:00:02" (1/1) ... [2019-01-12 09:00:02,850 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:00:02" (1/1) ... [2019-01-12 09:00:02,869 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:00:02" (1/1) ... [2019-01-12 09:00:02,874 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:00:02" (1/1) ... [2019-01-12 09:00:02,880 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 09:00:02,880 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 09:00:02,880 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 09:00:02,881 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 09:00:02,881 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:00:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 09:00:02,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 09:00:02,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2019-01-12 09:00:02,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-12 09:00:02,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-01-12 09:00:02,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 09:00:02,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 09:00:02,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-12 09:00:02,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2019-01-12 09:00:02,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 09:00:04,322 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 09:00:04,323 INFO L286 CfgBuilder]: Removed 44 assue(true) statements. [2019-01-12 09:00:04,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:00:04 BoogieIcfgContainer [2019-01-12 09:00:04,324 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 09:00:04,326 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 09:00:04,326 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 09:00:04,329 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 09:00:04,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 09:00:02" (1/3) ... [2019-01-12 09:00:04,331 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@168507e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:00:04, skipping insertion in model container [2019-01-12 09:00:04,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:00:02" (2/3) ... [2019-01-12 09:00:04,331 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@168507e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:00:04, skipping insertion in model container [2019-01-12 09:00:04,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:00:04" (3/3) ... [2019-01-12 09:00:04,333 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0662a_true-unreach-call.c [2019-01-12 09:00:04,344 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 09:00:04,352 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 09:00:04,369 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 09:00:04,401 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 09:00:04,402 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 09:00:04,402 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 09:00:04,402 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 09:00:04,402 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 09:00:04,402 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 09:00:04,403 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 09:00:04,403 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 09:00:04,403 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 09:00:04,422 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states. [2019-01-12 09:00:04,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-12 09:00:04,429 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:00:04,429 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:00:04,431 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:00:04,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:00:04,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1059427896, now seen corresponding path program 1 times [2019-01-12 09:00:04,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:00:04,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:00:04,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:00:04,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:00:04,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:00:04,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:00:04,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:00:04,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:00:04,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 09:00:04,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 09:00:04,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 09:00:04,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 09:00:04,601 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 2 states. [2019-01-12 09:00:04,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:00:04,631 INFO L93 Difference]: Finished difference Result 227 states and 382 transitions. [2019-01-12 09:00:04,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 09:00:04,632 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2019-01-12 09:00:04,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:00:04,645 INFO L225 Difference]: With dead ends: 227 [2019-01-12 09:00:04,645 INFO L226 Difference]: Without dead ends: 111 [2019-01-12 09:00:04,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 09:00:04,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-01-12 09:00:04,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-01-12 09:00:04,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-12 09:00:04,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 159 transitions. [2019-01-12 09:00:04,691 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 159 transitions. Word has length 11 [2019-01-12 09:00:04,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:00:04,691 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 159 transitions. [2019-01-12 09:00:04,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 09:00:04,692 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 159 transitions. [2019-01-12 09:00:04,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-12 09:00:04,692 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:00:04,693 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:00:04,693 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:00:04,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:00:04,694 INFO L82 PathProgramCache]: Analyzing trace with hash -7417919, now seen corresponding path program 1 times [2019-01-12 09:00:04,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:00:04,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:00:04,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:00:04,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:00:04,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:00:04,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 09:00:04,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 09:00:04,986 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 09:00:05,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 09:00:05 BoogieIcfgContainer [2019-01-12 09:00:05,052 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 09:00:05,053 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 09:00:05,053 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 09:00:05,053 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 09:00:05,054 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:00:04" (3/4) ... [2019-01-12 09:00:05,061 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-12 09:00:05,061 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 09:00:05,062 INFO L168 Benchmark]: Toolchain (without parser) took 2906.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 948.7 MB in the beginning and 1.0 GB in the end (delta: -70.7 MB). Peak memory consumption was 64.6 MB. Max. memory is 11.5 GB. [2019-01-12 09:00:05,065 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:00:05,066 INFO L168 Benchmark]: CACSL2BoogieTranslator took 481.31 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 932.5 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-01-12 09:00:05,067 INFO L168 Benchmark]: Boogie Procedure Inliner took 151.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 932.5 MB in the beginning and 1.1 GB in the end (delta: -184.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2019-01-12 09:00:05,068 INFO L168 Benchmark]: Boogie Preprocessor took 89.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-12 09:00:05,069 INFO L168 Benchmark]: RCFGBuilder took 1444.30 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: 51.2 MB). Peak memory consumption was 51.2 MB. Max. memory is 11.5 GB. [2019-01-12 09:00:05,071 INFO L168 Benchmark]: TraceAbstraction took 727.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 40.0 MB). Peak memory consumption was 40.0 MB. Max. memory is 11.5 GB. [2019-01-12 09:00:05,072 INFO L168 Benchmark]: Witness Printer took 7.97 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:00:05,080 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 481.31 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 932.5 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 151.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 932.5 MB in the beginning and 1.1 GB in the end (delta: -184.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 89.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1444.30 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: 51.2 MB). Peak memory consumption was 51.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 727.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 40.0 MB). Peak memory consumption was 40.0 MB. Max. memory is 11.5 GB. * Witness Printer took 7.97 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 260]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseOr at line 162, overapproximation of someUnaryDOUBLEoperation at line 251, overapproximation of bitwiseAnd at line 160, overapproximation of someBinaryArithmeticDOUBLEoperation at line 163, overapproximation of someBinaryDOUBLEComparisonOperation at line 259. Possible FailurePath: [L37-L42] static const double atanhi_atan[] = { 4.63647609000806093515e-01, 7.85398163397448278999e-01, 9.82793723247329054082e-01, 1.57079632679489655800e+00, }; [L44-L49] static const double atanlo_atan[] = { 2.26987774529616870924e-17, 3.06161699786838301793e-17, 1.39033110312309984516e-17, 6.12323399573676603587e-17, }; [L51-L58] static const double aT_atan[] = { 3.33333333333329318027e-01, -1.99999999998764832476e-01, 1.42857142725034663711e-01, -1.11111104054623557880e-01, 9.09088713343650656196e-02, -7.69187620504482999495e-02, 6.66107313738753120669e-02, -5.83357013379057348645e-02, 4.97687799461593236017e-02, -3.65315727442169155270e-02, 1.62858201153657823623e-02, }; [L60-L62] static const double one_atan = 1.0, pi_o_4 = 7.8539816339744827900E-01, pi_o_2 = 1.5707963267948965580E+00, pi = 3.1415926535897931160E+00, huge_atan = 1.0e300; [L139-L140] static const double tiny_atan2 = 1.0e-300, zero_atan2 = 0.0, pi_lo_atan2 = 1.2246467991473531772E-16; VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-3:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L251] double x = -0.0; [L252] double y = __VERIFIER_nondet_double(); [L254] COND TRUE y < 0.0 [L143] double z; [L144] __int32_t k, m, hx, hy, ix, iy; [L145] __uint32_t lx, ly; VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-3:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L148] ieee_double_shape_type ew_u; [L149] ew_u.value = (x) [L150] EXPR ew_u.parts.msw [L150] (hx) = ew_u.parts.msw [L151] EXPR ew_u.parts.lsw [L151] (lx) = ew_u.parts.lsw [L153] ix = hx & 0x7fffffff VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-3:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L155] ieee_double_shape_type ew_u; [L156] ew_u.value = (y) [L157] EXPR ew_u.parts.msw [L157] (hy) = ew_u.parts.msw [L158] EXPR ew_u.parts.lsw [L158] (ly) = ew_u.parts.lsw [L160] iy = hy & 0x7fffffff VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-3:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L161-L162] COND TRUE ((ix | ((lx | -lx) >> 31)) > 0x7ff00000) || ((iy | ((ly | -ly) >> 31)) > 0x7ff00000) [L163] return x + y; VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-3:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L256] double res = __ieee754_atan2(y, x); [L259] COND TRUE res != -pi_o_2 VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-3:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L260] __VERIFIER_error() VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-3:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 115 locations, 1 error locations. UNSAFE Result, 0.6s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 164 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=115occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 10 ConstructedInterpolants, 0 QuantifiedInterpolants, 100 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-0ed9222-m [2019-01-12 09:00:07,454 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 09:00:07,456 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 09:00:07,472 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 09:00:07,474 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 09:00:07,475 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 09:00:07,478 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 09:00:07,480 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 09:00:07,483 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 09:00:07,486 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 09:00:07,489 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 09:00:07,490 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 09:00:07,491 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 09:00:07,494 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 09:00:07,495 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 09:00:07,502 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 09:00:07,503 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 09:00:07,507 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 09:00:07,509 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 09:00:07,510 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 09:00:07,511 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 09:00:07,512 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 09:00:07,515 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 09:00:07,515 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 09:00:07,515 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 09:00:07,517 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 09:00:07,518 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 09:00:07,518 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 09:00:07,519 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 09:00:07,520 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 09:00:07,521 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 09:00:07,522 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 09:00:07,522 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 09:00:07,522 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 09:00:07,523 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 09:00:07,524 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 09:00:07,525 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-01-12 09:00:07,540 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 09:00:07,540 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 09:00:07,541 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 09:00:07,541 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 09:00:07,542 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 09:00:07,542 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 09:00:07,542 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 09:00:07,542 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 09:00:07,542 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 09:00:07,542 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 09:00:07,543 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 09:00:07,548 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 09:00:07,548 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2019-01-12 09:00:07,548 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-01-12 09:00:07,548 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 09:00:07,549 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 09:00:07,549 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 09:00:07,549 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 09:00:07,549 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 09:00:07,549 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 09:00:07,550 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 09:00:07,550 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 09:00:07,550 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 09:00:07,550 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 09:00:07,550 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 09:00:07,550 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 09:00:07,551 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2019-01-12 09:00:07,551 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 09:00:07,551 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-01-12 09:00:07,551 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2019-01-12 09:00:07,551 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 -> c8db64e82d1b178f8644abd34ffdb7278ee391d6 [2019-01-12 09:00:07,596 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 09:00:07,614 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 09:00:07,621 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 09:00:07,623 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 09:00:07,624 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 09:00:07,625 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/double_req_bl_0662a_true-unreach-call.c [2019-01-12 09:00:07,698 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9255a18dd/54ad6179bcff4f7692b464d5f0dce5e9/FLAGef72dbe26 [2019-01-12 09:00:08,087 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 09:00:08,089 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/double_req_bl_0662a_true-unreach-call.c [2019-01-12 09:00:08,099 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9255a18dd/54ad6179bcff4f7692b464d5f0dce5e9/FLAGef72dbe26 [2019-01-12 09:00:08,448 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9255a18dd/54ad6179bcff4f7692b464d5f0dce5e9 [2019-01-12 09:00:08,452 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 09:00:08,453 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 09:00:08,454 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 09:00:08,454 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 09:00:08,458 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 09:00:08,459 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:00:08" (1/1) ... [2019-01-12 09:00:08,463 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@700d6f83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:00:08, skipping insertion in model container [2019-01-12 09:00:08,463 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:00:08" (1/1) ... [2019-01-12 09:00:08,471 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 09:00:08,501 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 09:00:08,879 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:00:08,900 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 09:00:08,983 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:00:09,117 INFO L195 MainTranslator]: Completed translation [2019-01-12 09:00:09,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:00:09 WrapperNode [2019-01-12 09:00:09,117 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 09:00:09,119 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 09:00:09,119 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 09:00:09,119 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 09:00:09,126 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:00:09" (1/1) ... [2019-01-12 09:00:09,144 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:00:09" (1/1) ... [2019-01-12 09:00:09,205 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 09:00:09,206 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 09:00:09,206 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 09:00:09,206 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 09:00:09,219 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:00:09" (1/1) ... [2019-01-12 09:00:09,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:00:09" (1/1) ... [2019-01-12 09:00:09,229 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:00:09" (1/1) ... [2019-01-12 09:00:09,230 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:00:09" (1/1) ... [2019-01-12 09:00:09,259 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:00:09" (1/1) ... [2019-01-12 09:00:09,270 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:00:09" (1/1) ... [2019-01-12 09:00:09,275 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:00:09" (1/1) ... [2019-01-12 09:00:09,283 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 09:00:09,284 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 09:00:09,284 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 09:00:09,284 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 09:00:09,285 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:00:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 09:00:09,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2019-01-12 09:00:09,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2019-01-12 09:00:09,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 09:00:09,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2019-01-12 09:00:09,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-01-12 09:00:09,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 09:00:09,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 09:00:09,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-01-12 09:00:09,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 09:00:09,820 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:00:09,908 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:00:10,013 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:00:10,196 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:00:10,254 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:00:11,173 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:00:11,200 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:00:32,225 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:00:32,251 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:00:32,291 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:00:32,330 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:00:33,185 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:00:33,236 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:00:49,238 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:00:49,269 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:00:49,940 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 09:00:49,940 INFO L286 CfgBuilder]: Removed 44 assue(true) statements. [2019-01-12 09:00:49,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:00:49 BoogieIcfgContainer [2019-01-12 09:00:49,942 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 09:00:49,943 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 09:00:49,943 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 09:00:49,945 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 09:00:49,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 09:00:08" (1/3) ... [2019-01-12 09:00:49,947 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f9abbd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:00:49, skipping insertion in model container [2019-01-12 09:00:49,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:00:09" (2/3) ... [2019-01-12 09:00:49,947 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f9abbd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:00:49, skipping insertion in model container [2019-01-12 09:00:49,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:00:49" (3/3) ... [2019-01-12 09:00:49,950 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0662a_true-unreach-call.c [2019-01-12 09:00:49,958 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 09:00:49,966 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 09:00:49,982 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 09:00:50,011 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 09:00:50,012 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 09:00:50,012 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 09:00:50,012 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 09:00:50,013 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 09:00:50,013 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 09:00:50,013 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 09:00:50,013 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 09:00:50,013 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 09:00:50,029 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states. [2019-01-12 09:00:50,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-12 09:00:50,036 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:00:50,037 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:00:50,038 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:00:50,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:00:50,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1059427896, now seen corresponding path program 1 times [2019-01-12 09:00:50,050 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:00:50,051 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-01-12 09:00:50,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:00:50,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:00:50,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:00:50,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:00:50,376 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:00:50,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:00:50,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 09:00:50,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 09:00:50,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 09:00:50,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 09:00:50,409 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 2 states. [2019-01-12 09:00:50,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:00:50,444 INFO L93 Difference]: Finished difference Result 227 states and 382 transitions. [2019-01-12 09:00:50,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 09:00:50,445 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2019-01-12 09:00:50,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:00:50,460 INFO L225 Difference]: With dead ends: 227 [2019-01-12 09:00:50,460 INFO L226 Difference]: Without dead ends: 111 [2019-01-12 09:00:50,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 09:00:50,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-01-12 09:00:50,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-01-12 09:00:50,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-12 09:00:50,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 159 transitions. [2019-01-12 09:00:50,509 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 159 transitions. Word has length 11 [2019-01-12 09:00:50,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:00:50,510 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 159 transitions. [2019-01-12 09:00:50,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 09:00:50,510 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 159 transitions. [2019-01-12 09:00:50,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-12 09:00:50,511 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:00:50,512 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:00:50,512 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:00:50,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:00:50,513 INFO L82 PathProgramCache]: Analyzing trace with hash -7417919, now seen corresponding path program 1 times [2019-01-12 09:00:50,514 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:00:50,515 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-01-12 09:00:50,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:00:50,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:00:50,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:00:51,207 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:00:51,220 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:00:51,233 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:00:51,247 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:00:51,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 98 [2019-01-12 09:00:51,593 WARN L181 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2019-01-12 09:00:51,642 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:00:51,643 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:00:51,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 3 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 59 treesize of output 67 [2019-01-12 09:00:51,657 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:00:51,748 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2019-01-12 09:00:51,798 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:00:51,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2019-01-12 09:00:51,805 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-12 09:00:51,827 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:00:51,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 35 [2019-01-12 09:00:51,879 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 17 [2019-01-12 09:00:51,880 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-12 09:00:51,900 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:00:51,921 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:00:51,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-12 09:00:51,961 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:98, output treesize:42 [2019-01-12 09:00:52,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:00:52,184 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:00:52,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:00:52,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-12 09:00:52,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 09:00:52,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 09:00:52,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-12 09:00:52,201 INFO L87 Difference]: Start difference. First operand 111 states and 159 transitions. Second operand 8 states. [2019-01-12 09:00:52,763 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-01-12 09:00:53,496 WARN L181 SmtUtils]: Spent 401.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-01-12 09:00:56,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:00:56,559 INFO L93 Difference]: Finished difference Result 182 states and 254 transitions. [2019-01-12 09:00:56,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 09:00:56,936 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2019-01-12 09:00:56,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:00:56,938 INFO L225 Difference]: With dead ends: 182 [2019-01-12 09:00:56,938 INFO L226 Difference]: Without dead ends: 83 [2019-01-12 09:00:56,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-01-12 09:00:56,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-12 09:00:56,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 68. [2019-01-12 09:00:56,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-12 09:00:56,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 86 transitions. [2019-01-12 09:00:56,951 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 86 transitions. Word has length 13 [2019-01-12 09:00:56,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:00:56,951 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 86 transitions. [2019-01-12 09:00:56,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 09:00:56,951 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 86 transitions. [2019-01-12 09:00:56,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-12 09:00:56,953 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:00:56,953 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:00:56,954 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:00:56,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:00:56,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1226339013, now seen corresponding path program 1 times [2019-01-12 09:00:56,955 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:00:56,955 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-01-12 09:00:56,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:00:57,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:00:57,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:00:58,191 WARN L181 SmtUtils]: Spent 598.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-12 09:00:58,590 WARN L181 SmtUtils]: Spent 375.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-12 09:00:58,872 WARN L181 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-12 09:00:58,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:00:58,878 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:00:58,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:00:58,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 09:00:58,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 09:00:58,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 09:00:58,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 09:00:58,900 INFO L87 Difference]: Start difference. First operand 68 states and 86 transitions. Second operand 6 states. [2019-01-12 09:00:59,677 WARN L181 SmtUtils]: Spent 277.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-12 09:00:59,940 WARN L181 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-12 09:01:01,839 WARN L181 SmtUtils]: Spent 467.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-12 09:01:03,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:01:03,224 INFO L93 Difference]: Finished difference Result 72 states and 89 transitions. [2019-01-12 09:01:03,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 09:01:03,226 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-01-12 09:01:03,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:01:03,228 INFO L225 Difference]: With dead ends: 72 [2019-01-12 09:01:03,228 INFO L226 Difference]: Without dead ends: 66 [2019-01-12 09:01:03,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-01-12 09:01:03,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-01-12 09:01:03,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-01-12 09:01:03,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-12 09:01:03,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 83 transitions. [2019-01-12 09:01:03,247 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 83 transitions. Word has length 18 [2019-01-12 09:01:03,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:01:03,247 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 83 transitions. [2019-01-12 09:01:03,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 09:01:03,247 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 83 transitions. [2019-01-12 09:01:03,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-12 09:01:03,251 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:01:03,251 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:01:03,252 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:01:03,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:01:03,252 INFO L82 PathProgramCache]: Analyzing trace with hash 48409528, now seen corresponding path program 1 times [2019-01-12 09:01:03,255 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:01:03,256 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) [2019-01-12 09:01:03,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-01-12 09:01:03,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:01:03,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:01:03,844 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-12 09:01:04,165 WARN L181 SmtUtils]: Spent 297.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-12 09:01:04,378 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-12 09:01:04,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:01:04,382 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:01:04,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:01:04,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 09:01:04,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 09:01:04,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 09:01:04,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 09:01:04,399 INFO L87 Difference]: Start difference. First operand 66 states and 83 transitions. Second operand 6 states. [2019-01-12 09:01:05,012 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-12 09:01:05,496 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-12 09:01:05,853 WARN L181 SmtUtils]: Spent 331.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-12 09:01:07,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:01:07,223 INFO L93 Difference]: Finished difference Result 70 states and 86 transitions. [2019-01-12 09:01:07,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 09:01:07,226 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-01-12 09:01:07,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:01:07,227 INFO L225 Difference]: With dead ends: 70 [2019-01-12 09:01:07,227 INFO L226 Difference]: Without dead ends: 64 [2019-01-12 09:01:07,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-01-12 09:01:07,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-01-12 09:01:07,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-01-12 09:01:07,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-01-12 09:01:07,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 80 transitions. [2019-01-12 09:01:07,235 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 80 transitions. Word has length 20 [2019-01-12 09:01:07,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:01:07,235 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 80 transitions. [2019-01-12 09:01:07,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 09:01:07,235 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 80 transitions. [2019-01-12 09:01:07,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-12 09:01:07,237 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:01:07,237 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:01:07,238 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:01:07,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:01:07,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1297758981, now seen corresponding path program 1 times [2019-01-12 09:01:07,239 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:01:07,240 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-01-12 09:01:07,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:01:07,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:01:07,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:01:07,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:01:07,703 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:01:07,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:01:07,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 09:01:07,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 09:01:07,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 09:01:07,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-12 09:01:07,720 INFO L87 Difference]: Start difference. First operand 64 states and 80 transitions. Second operand 7 states. [2019-01-12 09:01:11,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:01:11,380 INFO L93 Difference]: Finished difference Result 68 states and 83 transitions. [2019-01-12 09:01:11,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 09:01:11,382 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-01-12 09:01:11,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:01:11,383 INFO L225 Difference]: With dead ends: 68 [2019-01-12 09:01:11,383 INFO L226 Difference]: Without dead ends: 59 [2019-01-12 09:01:11,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-01-12 09:01:11,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-12 09:01:11,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-01-12 09:01:11,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-12 09:01:11,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 73 transitions. [2019-01-12 09:01:11,405 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 73 transitions. Word has length 21 [2019-01-12 09:01:11,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:01:11,406 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 73 transitions. [2019-01-12 09:01:11,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 09:01:11,406 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2019-01-12 09:01:11,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-12 09:01:11,409 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:01:11,409 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:01:11,410 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:01:11,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:01:11,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1649788032, now seen corresponding path program 1 times [2019-01-12 09:01:11,411 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:01:11,411 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-01-12 09:01:11,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:01:11,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:01:11,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:01:14,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:01:14,947 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:01:14,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:01:14,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-12 09:01:14,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-12 09:01:14,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-12 09:01:14,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=86, Unknown=1, NotChecked=0, Total=110 [2019-01-12 09:01:14,965 INFO L87 Difference]: Start difference. First operand 59 states and 73 transitions. Second operand 11 states. [2019-01-12 09:01:19,608 WARN L181 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 31 [2019-01-12 09:01:20,164 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-01-12 09:01:23,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:01:23,086 INFO L93 Difference]: Finished difference Result 63 states and 76 transitions. [2019-01-12 09:01:23,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 09:01:23,088 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2019-01-12 09:01:23,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:01:23,089 INFO L225 Difference]: With dead ends: 63 [2019-01-12 09:01:23,089 INFO L226 Difference]: Without dead ends: 59 [2019-01-12 09:01:23,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=80, Invalid=191, Unknown=1, NotChecked=0, Total=272 [2019-01-12 09:01:23,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-12 09:01:23,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-01-12 09:01:23,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-12 09:01:23,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2019-01-12 09:01:23,108 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 72 transitions. Word has length 23 [2019-01-12 09:01:23,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:01:23,109 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 72 transitions. [2019-01-12 09:01:23,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-12 09:01:23,109 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 72 transitions. [2019-01-12 09:01:23,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-12 09:01:23,111 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:01:23,111 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:01:23,112 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:01:23,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:01:23,112 INFO L82 PathProgramCache]: Analyzing trace with hash -394512707, now seen corresponding path program 1 times [2019-01-12 09:01:23,112 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:01:23,113 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2019-01-12 09:01:23,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-01-12 09:01:23,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:01:23,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:01:23,799 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:01:23,800 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:01:23,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2019-01-12 09:01:23,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:01:23,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 53 [2019-01-12 09:01:23,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:01:23,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2019-01-12 09:01:23,942 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-12 09:01:23,968 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:01:23,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-01-12 09:01:23,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:01:23,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2019-01-12 09:01:23,993 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-12 09:01:23,997 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:01:24,002 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:01:24,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-12 09:01:24,016 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:58, output treesize:19 [2019-01-12 09:01:24,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:01:24,087 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:01:24,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:01:24,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 09:01:24,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 09:01:24,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 09:01:24,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 09:01:24,117 INFO L87 Difference]: Start difference. First operand 59 states and 72 transitions. Second operand 6 states. [2019-01-12 09:01:24,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:01:24,338 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2019-01-12 09:01:24,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 09:01:24,340 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-01-12 09:01:24,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:01:24,340 INFO L225 Difference]: With dead ends: 59 [2019-01-12 09:01:24,340 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 09:01:24,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 09:01:24,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 09:01:24,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 09:01:24,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 09:01:24,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 09:01:24,343 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2019-01-12 09:01:24,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:01:24,344 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 09:01:24,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 09:01:24,344 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 09:01:24,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 09:01:24,349 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 09:01:24,516 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-12 09:01:24,732 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 45 [2019-01-12 09:01:24,888 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-12 09:01:24,890 INFO L448 ceAbstractionStarter]: For program point L68-3(lines 68 72) no Hoare annotation was computed. [2019-01-12 09:01:24,890 INFO L448 ceAbstractionStarter]: For program point L68-5(lines 68 72) no Hoare annotation was computed. [2019-01-12 09:01:24,891 INFO L444 ceAbstractionStarter]: At program point L68-6(lines 68 72) the Hoare annotation is: false [2019-01-12 09:01:24,891 INFO L448 ceAbstractionStarter]: For program point L68-7(lines 68 72) no Hoare annotation was computed. [2019-01-12 09:01:24,891 INFO L448 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2019-01-12 09:01:24,891 INFO L448 ceAbstractionStarter]: For program point L168(lines 168 178) no Hoare annotation was computed. [2019-01-12 09:01:24,892 INFO L448 ceAbstractionStarter]: For program point L168-2(lines 142 242) no Hoare annotation was computed. [2019-01-12 09:01:24,892 INFO L448 ceAbstractionStarter]: For program point L169(lines 169 177) no Hoare annotation was computed. [2019-01-12 09:01:24,892 INFO L448 ceAbstractionStarter]: For program point L203(line 203) no Hoare annotation was computed. [2019-01-12 09:01:24,892 INFO L448 ceAbstractionStarter]: For program point L170(line 170) no Hoare annotation was computed. [2019-01-12 09:01:24,892 INFO L448 ceAbstractionStarter]: For program point L170-2(line 170) no Hoare annotation was computed. [2019-01-12 09:01:24,892 INFO L448 ceAbstractionStarter]: For program point L237(line 237) no Hoare annotation was computed. [2019-01-12 09:01:24,892 INFO L448 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-01-12 09:01:24,892 INFO L448 ceAbstractionStarter]: For program point L105(lines 105 111) no Hoare annotation was computed. [2019-01-12 09:01:24,893 INFO L448 ceAbstractionStarter]: For program point L105-2(lines 88 113) no Hoare annotation was computed. [2019-01-12 09:01:24,893 INFO L448 ceAbstractionStarter]: For program point L105-3(lines 105 111) no Hoare annotation was computed. [2019-01-12 09:01:24,893 INFO L448 ceAbstractionStarter]: For program point L105-5(lines 88 113) no Hoare annotation was computed. [2019-01-12 09:01:24,893 INFO L448 ceAbstractionStarter]: For program point L239(line 239) no Hoare annotation was computed. [2019-01-12 09:01:24,893 INFO L448 ceAbstractionStarter]: For program point L173(line 173) no Hoare annotation was computed. [2019-01-12 09:01:24,893 INFO L448 ceAbstractionStarter]: For program point L74(lines 74 87) no Hoare annotation was computed. [2019-01-12 09:01:24,893 INFO L448 ceAbstractionStarter]: For program point L74-1(lines 74 87) no Hoare annotation was computed. [2019-01-12 09:01:24,893 INFO L448 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-01-12 09:01:24,893 INFO L444 ceAbstractionStarter]: At program point L142(lines 142 242) the Hoare annotation is: (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)))) (and (= ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 500000000000000000.0)) ~pi_o_2~0) (= (fp.sub roundNearestTiesToEven (fp.neg ~pi_o_2~0) .cse0) |ULTIMATE.start___ieee754_atan2_#res|) (= ~tiny_atan2~0 .cse0))) [2019-01-12 09:01:24,894 INFO L448 ceAbstractionStarter]: For program point L76-1(lines 76 80) no Hoare annotation was computed. [2019-01-12 09:01:24,896 INFO L444 ceAbstractionStarter]: At program point L76-2(lines 76 80) the Hoare annotation is: false [2019-01-12 09:01:24,896 INFO L448 ceAbstractionStarter]: For program point L76-3(lines 74 87) no Hoare annotation was computed. [2019-01-12 09:01:24,896 INFO L448 ceAbstractionStarter]: For program point L76-5(lines 76 80) no Hoare annotation was computed. [2019-01-12 09:01:24,896 INFO L444 ceAbstractionStarter]: At program point L76-6(lines 76 80) the Hoare annotation is: false [2019-01-12 09:01:24,896 INFO L448 ceAbstractionStarter]: For program point L76-7(lines 74 87) no Hoare annotation was computed. [2019-01-12 09:01:24,896 INFO L448 ceAbstractionStarter]: For program point L210(line 210) no Hoare annotation was computed. [2019-01-12 09:01:24,896 INFO L448 ceAbstractionStarter]: For program point L210-2(line 210) no Hoare annotation was computed. [2019-01-12 09:01:24,897 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 260) no Hoare annotation was computed. [2019-01-12 09:01:24,897 INFO L448 ceAbstractionStarter]: For program point L213(lines 213 218) no Hoare annotation was computed. [2019-01-12 09:01:24,897 INFO L448 ceAbstractionStarter]: For program point L147-1(lines 147 152) no Hoare annotation was computed. [2019-01-12 09:01:24,897 INFO L444 ceAbstractionStarter]: At program point L147-2(lines 147 152) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (= ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 500000000000000000.0)) ~pi_o_2~0) (= ULTIMATE.start_main_~x~0 .cse0) (= .cse0 ULTIMATE.start___ieee754_atan2_~x) (= ~tiny_atan2~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0))) (fp.lt ULTIMATE.start___ieee754_atan2_~y (_ +zero 11 53)))) [2019-01-12 09:01:24,897 INFO L448 ceAbstractionStarter]: For program point L147-3(lines 147 152) no Hoare annotation was computed. [2019-01-12 09:01:24,897 INFO L448 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-01-12 09:01:24,897 INFO L448 ceAbstractionStarter]: For program point L181-2(line 181) no Hoare annotation was computed. [2019-01-12 09:01:24,898 INFO L448 ceAbstractionStarter]: For program point L215(lines 215 218) no Hoare annotation was computed. [2019-01-12 09:01:24,898 INFO L448 ceAbstractionStarter]: For program point L215-2(lines 213 218) no Hoare annotation was computed. [2019-01-12 09:01:24,898 INFO L448 ceAbstractionStarter]: For program point L83(lines 83 86) no Hoare annotation was computed. [2019-01-12 09:01:24,898 INFO L448 ceAbstractionStarter]: For program point L83-1(lines 83 86) no Hoare annotation was computed. [2019-01-12 09:01:24,898 INFO L448 ceAbstractionStarter]: For program point L183(lines 183 207) no Hoare annotation was computed. [2019-01-12 09:01:24,898 INFO L448 ceAbstractionStarter]: For program point L183-1(lines 142 242) no Hoare annotation was computed. [2019-01-12 09:01:24,898 INFO L448 ceAbstractionStarter]: For program point L184(lines 184 206) no Hoare annotation was computed. [2019-01-12 09:01:24,898 INFO L448 ceAbstractionStarter]: For program point L19-1(lines 19 23) no Hoare annotation was computed. [2019-01-12 09:01:24,898 INFO L444 ceAbstractionStarter]: At program point L19-2(lines 19 23) the Hoare annotation is: false [2019-01-12 09:01:24,898 INFO L448 ceAbstractionStarter]: For program point L19-5(lines 19 23) no Hoare annotation was computed. [2019-01-12 09:01:24,898 INFO L444 ceAbstractionStarter]: At program point L19-6(lines 19 23) the Hoare annotation is: false [2019-01-12 09:01:24,899 INFO L448 ceAbstractionStarter]: For program point L19-9(lines 19 23) no Hoare annotation was computed. [2019-01-12 09:01:24,901 INFO L444 ceAbstractionStarter]: At program point L19-10(lines 19 23) the Hoare annotation is: false [2019-01-12 09:01:24,902 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 09:01:24,902 INFO L448 ceAbstractionStarter]: For program point L185(lines 185 194) no Hoare annotation was computed. [2019-01-12 09:01:24,902 INFO L448 ceAbstractionStarter]: For program point L219(lines 219 241) no Hoare annotation was computed. [2019-01-12 09:01:24,902 INFO L448 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2019-01-12 09:01:24,902 INFO L448 ceAbstractionStarter]: For program point L220(line 220) no Hoare annotation was computed. [2019-01-12 09:01:24,902 INFO L448 ceAbstractionStarter]: For program point L154-1(lines 154 159) no Hoare annotation was computed. [2019-01-12 09:01:24,902 INFO L444 ceAbstractionStarter]: At program point L154-2(lines 154 159) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (= ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 500000000000000000.0)) ~pi_o_2~0) (exists ((|v_q#valueAsBitvector_21| (_ BitVec 64))) (and (= ULTIMATE.start___ieee754_atan2_~hx~1 ((_ extract 63 32) |v_q#valueAsBitvector_21|)) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_21|) ((_ extract 62 52) |v_q#valueAsBitvector_21|) ((_ extract 51 0) |v_q#valueAsBitvector_21|)) (fp.neg (_ +zero 11 53))) (= ULTIMATE.start___ieee754_atan2_~lx~0 ((_ extract 31 0) |v_q#valueAsBitvector_21|)))) (= ULTIMATE.start_main_~x~0 .cse0) (= .cse0 ULTIMATE.start___ieee754_atan2_~x) (= ~tiny_atan2~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0))) (fp.lt ULTIMATE.start___ieee754_atan2_~y (_ +zero 11 53)) (exists ((|v_q#valueAsBitvector_16| (_ BitVec 64))) (and (= (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_q#valueAsBitvector_16|)) ULTIMATE.start___ieee754_atan2_~ix~1) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_16|) ((_ extract 62 52) |v_q#valueAsBitvector_16|) ((_ extract 51 0) |v_q#valueAsBitvector_16|)) (fp.neg (_ +zero 11 53))))))) [2019-01-12 09:01:24,902 INFO L448 ceAbstractionStarter]: For program point L88(lines 88 113) no Hoare annotation was computed. [2019-01-12 09:01:24,903 INFO L448 ceAbstractionStarter]: For program point L154-3(lines 154 159) no Hoare annotation was computed. [2019-01-12 09:01:24,903 INFO L448 ceAbstractionStarter]: For program point L88-2(lines 88 113) no Hoare annotation was computed. [2019-01-12 09:01:24,903 INFO L448 ceAbstractionStarter]: For program point L254(lines 254 263) no Hoare annotation was computed. [2019-01-12 09:01:24,903 INFO L448 ceAbstractionStarter]: For program point L188(line 188) no Hoare annotation was computed. [2019-01-12 09:01:24,903 INFO L448 ceAbstractionStarter]: For program point L254-2(lines 254 263) no Hoare annotation was computed. [2019-01-12 09:01:24,903 INFO L448 ceAbstractionStarter]: For program point L89(lines 89 92) no Hoare annotation was computed. [2019-01-12 09:01:24,903 INFO L448 ceAbstractionStarter]: For program point L89-2(lines 89 92) no Hoare annotation was computed. [2019-01-12 09:01:24,903 INFO L448 ceAbstractionStarter]: For program point L89-3(lines 89 92) no Hoare annotation was computed. [2019-01-12 09:01:24,903 INFO L448 ceAbstractionStarter]: For program point L89-5(lines 89 92) no Hoare annotation was computed. [2019-01-12 09:01:24,903 INFO L448 ceAbstractionStarter]: For program point L222(line 222) no Hoare annotation was computed. [2019-01-12 09:01:24,903 INFO L448 ceAbstractionStarter]: For program point L90(lines 90 91) no Hoare annotation was computed. [2019-01-12 09:01:24,903 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 90 91) no Hoare annotation was computed. [2019-01-12 09:01:24,904 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 29) no Hoare annotation was computed. [2019-01-12 09:01:24,904 INFO L448 ceAbstractionStarter]: For program point L24-1(lines 17 31) no Hoare annotation was computed. [2019-01-12 09:01:24,904 INFO L448 ceAbstractionStarter]: For program point L24-2(lines 24 29) no Hoare annotation was computed. [2019-01-12 09:01:24,904 INFO L448 ceAbstractionStarter]: For program point L24-3(lines 24 29) no Hoare annotation was computed. [2019-01-12 09:01:24,904 INFO L448 ceAbstractionStarter]: For program point L24-4(lines 17 31) no Hoare annotation was computed. [2019-01-12 09:01:24,904 INFO L448 ceAbstractionStarter]: For program point L24-5(lines 24 29) no Hoare annotation was computed. [2019-01-12 09:01:24,904 INFO L448 ceAbstractionStarter]: For program point L24-6(lines 24 29) no Hoare annotation was computed. [2019-01-12 09:01:24,904 INFO L448 ceAbstractionStarter]: For program point L24-7(lines 17 31) no Hoare annotation was computed. [2019-01-12 09:01:24,904 INFO L448 ceAbstractionStarter]: For program point L24-8(lines 24 29) no Hoare annotation was computed. [2019-01-12 09:01:24,905 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 09:01:24,905 INFO L448 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-01-12 09:01:24,905 INFO L448 ceAbstractionStarter]: For program point L224-1(lines 224 228) no Hoare annotation was computed. [2019-01-12 09:01:24,905 INFO L444 ceAbstractionStarter]: At program point L224-2(lines 224 228) the Hoare annotation is: false [2019-01-12 09:01:24,905 INFO L448 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2019-01-12 09:01:24,905 INFO L448 ceAbstractionStarter]: For program point L126(lines 126 131) no Hoare annotation was computed. [2019-01-12 09:01:24,905 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 126 131) no Hoare annotation was computed. [2019-01-12 09:01:24,905 INFO L448 ceAbstractionStarter]: For program point L259(lines 259 262) no Hoare annotation was computed. [2019-01-12 09:01:24,905 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 09:01:24,905 INFO L448 ceAbstractionStarter]: For program point L260(line 260) no Hoare annotation was computed. [2019-01-12 09:01:24,905 INFO L448 ceAbstractionStarter]: For program point L161(lines 161 163) no Hoare annotation was computed. [2019-01-12 09:01:24,906 INFO L448 ceAbstractionStarter]: For program point L96(lines 96 112) no Hoare annotation was computed. [2019-01-12 09:01:24,906 INFO L448 ceAbstractionStarter]: For program point L96-1(lines 96 112) no Hoare annotation was computed. [2019-01-12 09:01:24,906 INFO L444 ceAbstractionStarter]: At program point L30(lines 17 31) the Hoare annotation is: false [2019-01-12 09:01:24,906 INFO L444 ceAbstractionStarter]: At program point L30-1(lines 17 31) the Hoare annotation is: false [2019-01-12 09:01:24,906 INFO L444 ceAbstractionStarter]: At program point L30-2(lines 17 31) the Hoare annotation is: false [2019-01-12 09:01:24,906 INFO L448 ceAbstractionStarter]: For program point L229(lines 229 234) no Hoare annotation was computed. [2019-01-12 09:01:24,906 INFO L448 ceAbstractionStarter]: For program point L196(lines 196 205) no Hoare annotation was computed. [2019-01-12 09:01:24,906 INFO L448 ceAbstractionStarter]: For program point L229-1(lines 222 235) no Hoare annotation was computed. [2019-01-12 09:01:24,906 INFO L448 ceAbstractionStarter]: For program point L229-2(lines 229 234) no Hoare annotation was computed. [2019-01-12 09:01:24,906 INFO L448 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-01-12 09:01:24,907 INFO L448 ceAbstractionStarter]: For program point L97(lines 97 103) no Hoare annotation was computed. [2019-01-12 09:01:24,907 INFO L448 ceAbstractionStarter]: For program point L130-2(line 130) no Hoare annotation was computed. [2019-01-12 09:01:24,907 INFO L444 ceAbstractionStarter]: At program point L130-3(lines 64 132) the Hoare annotation is: false [2019-01-12 09:01:24,907 INFO L448 ceAbstractionStarter]: For program point L97-3(lines 97 103) no Hoare annotation was computed. [2019-01-12 09:01:24,907 INFO L448 ceAbstractionStarter]: For program point L130-4(line 130) no Hoare annotation was computed. [2019-01-12 09:01:24,907 INFO L448 ceAbstractionStarter]: For program point L130-6(line 130) no Hoare annotation was computed. [2019-01-12 09:01:24,907 INFO L444 ceAbstractionStarter]: At program point L130-7(lines 64 132) the Hoare annotation is: false [2019-01-12 09:01:24,907 INFO L448 ceAbstractionStarter]: For program point L197(line 197) no Hoare annotation was computed. [2019-01-12 09:01:24,907 INFO L448 ceAbstractionStarter]: For program point L164(lines 164 165) no Hoare annotation was computed. [2019-01-12 09:01:24,907 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 09:01:24,908 INFO L451 ceAbstractionStarter]: At program point L265(lines 244 266) the Hoare annotation is: true [2019-01-12 09:01:24,908 INFO L448 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-01-12 09:01:24,908 INFO L448 ceAbstractionStarter]: For program point L68-1(lines 68 72) no Hoare annotation was computed. [2019-01-12 09:01:24,908 INFO L444 ceAbstractionStarter]: At program point L68-2(lines 68 72) the Hoare annotation is: false [2019-01-12 09:01:24,921 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:01:24,922 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:01:24,924 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:01:24,925 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:01:24,928 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:01:24,928 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] [2019-01-12 09:01:24,929 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] [2019-01-12 09:01:24,929 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] [2019-01-12 09:01:24,929 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] [2019-01-12 09:01:24,929 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] [2019-01-12 09:01:24,930 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:01:24,932 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:01:24,932 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:01:24,932 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:01:24,932 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:01:24,935 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:01:24,935 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] [2019-01-12 09:01:24,935 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] [2019-01-12 09:01:24,935 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] [2019-01-12 09:01:24,936 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] [2019-01-12 09:01:24,936 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] [2019-01-12 09:01:24,936 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:01:24,936 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:01:24,936 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:01:24,937 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:01:24,937 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:01:24,938 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:01:24,938 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:01:24,938 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:01:24,939 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:01:24,943 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:01:24,943 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:01:24,943 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:01:24,944 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:01:24,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 09:01:24 BoogieIcfgContainer [2019-01-12 09:01:24,948 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 09:01:24,948 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 09:01:24,948 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 09:01:24,949 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 09:01:24,949 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:00:49" (3/4) ... [2019-01-12 09:01:24,955 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 09:01:24,977 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2019-01-12 09:01:24,977 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2019-01-12 09:01:24,978 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-12 09:01:25,012 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/500000000000000000) == pi_o_2 && (\exists v_q#valueAsBitvector_21 : bv64 :: (hx == v_q#valueAsBitvector_21[63:32] && ~fp~LONGDOUBLE(v_q#valueAsBitvector_21[63:63], v_q#valueAsBitvector_21[62:52], v_q#valueAsBitvector_21[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && lx == v_q#valueAsBitvector_21[31:0])) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) && ~fp.lt~DOUBLE(y, ~Pluszero~LONGDOUBLE())) && (\exists v_q#valueAsBitvector_16 : bv64 :: ~bvand32(2147483647bv32, v_q#valueAsBitvector_16[63:32]) == ix && ~fp~LONGDOUBLE(v_q#valueAsBitvector_16[63:63], v_q#valueAsBitvector_16[62:52], v_q#valueAsBitvector_16[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) [2019-01-12 09:01:25,012 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/500000000000000000) == pi_o_2 && ~fp.sub~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(pi_o_2), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) == \result) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) [2019-01-12 09:01:25,093 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 09:01:25,093 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 09:01:25,094 INFO L168 Benchmark]: Toolchain (without parser) took 76641.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 201.3 MB). Free memory was 947.3 MB in the beginning and 1.0 GB in the end (delta: -78.8 MB). Peak memory consumption was 122.5 MB. Max. memory is 11.5 GB. [2019-01-12 09:01:25,096 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:01:25,096 INFO L168 Benchmark]: CACSL2BoogieTranslator took 664.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -177.2 MB). Peak memory consumption was 36.6 MB. Max. memory is 11.5 GB. [2019-01-12 09:01:25,097 INFO L168 Benchmark]: Boogie Procedure Inliner took 87.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-12 09:01:25,097 INFO L168 Benchmark]: Boogie Preprocessor took 77.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-12 09:01:25,097 INFO L168 Benchmark]: RCFGBuilder took 40657.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 71.4 MB). Peak memory consumption was 71.4 MB. Max. memory is 11.5 GB. [2019-01-12 09:01:25,100 INFO L168 Benchmark]: TraceAbstraction took 35005.34 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 64.5 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.4 MB). Peak memory consumption was 70.9 MB. Max. memory is 11.5 GB. [2019-01-12 09:01:25,100 INFO L168 Benchmark]: Witness Printer took 145.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 11.5 GB. [2019-01-12 09:01:25,105 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 664.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -177.2 MB). Peak memory consumption was 36.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 87.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 77.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 40657.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 71.4 MB). Peak memory consumption was 71.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 35005.34 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 64.5 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.4 MB). Peak memory consumption was 70.9 MB. Max. memory is 11.5 GB. * Witness Printer took 145.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 260]: 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: 64]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 147]: Loop Invariant [2019-01-12 09:01:25,118 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:01:25,118 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:01:25,119 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:01:25,119 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (((~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/500000000000000000) == pi_o_2 && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) && ~fp.lt~DOUBLE(y, ~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 224]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 244]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 154]: Loop Invariant [2019-01-12 09:01:25,123 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:01:25,124 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] [2019-01-12 09:01:25,124 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] [2019-01-12 09:01:25,124 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] [2019-01-12 09:01:25,124 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] [2019-01-12 09:01:25,125 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] [2019-01-12 09:01:25,125 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:01:25,125 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:01:25,125 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:01:25,125 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:01:25,125 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:01:25,130 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:01:25,130 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] [2019-01-12 09:01:25,130 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] [2019-01-12 09:01:25,130 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] [2019-01-12 09:01:25,130 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] [2019-01-12 09:01:25,131 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_21,QUANTIFIED] [2019-01-12 09:01:25,131 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:01:25,131 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:01:25,131 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:01:25,131 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:01:25,131 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] Derived loop invariant: (((((~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/500000000000000000) == pi_o_2 && (\exists v_q#valueAsBitvector_21 : bv64 :: (hx == v_q#valueAsBitvector_21[63:32] && ~fp~LONGDOUBLE(v_q#valueAsBitvector_21[63:63], v_q#valueAsBitvector_21[62:52], v_q#valueAsBitvector_21[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && lx == v_q#valueAsBitvector_21[31:0])) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) && ~fp.lt~DOUBLE(y, ~Pluszero~LONGDOUBLE())) && (\exists v_q#valueAsBitvector_16 : bv64 :: ~bvand32(2147483647bv32, v_q#valueAsBitvector_16[63:32]) == ix && ~fp~LONGDOUBLE(v_q#valueAsBitvector_16[63:63], v_q#valueAsBitvector_16[62:52], v_q#valueAsBitvector_16[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) - InvariantResult [Line: 142]: Loop Invariant [2019-01-12 09:01:25,134 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:01:25,135 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:01:25,135 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:01:25,135 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:01:25,136 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:01:25,139 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:01:25,139 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:01:25,139 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/500000000000000000) == pi_o_2 && ~fp.sub~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(pi_o_2), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) == \result) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 115 locations, 1 error locations. SAFE Result, 34.9s OverallTime, 7 OverallIterations, 1 TraceHistogramMax, 23.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 519 SDtfs, 1009 SDslu, 983 SDs, 0 SdLazy, 161 SolverSat, 42 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 16.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 147 GetRequests, 87 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 12.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115occurred 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.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 15 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 17 PreInvPairs, 21 NumberOfFragments, 116 HoareAnnotationTreeSize, 17 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 17 FomulaSimplificationsInter, 70 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 130 NumberOfCodeBlocks, 130 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 123 ConstructedInterpolants, 43 QuantifiedInterpolants, 32752 SizeOfPredicates, 43 NumberOfNonLiveVariables, 954 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...