./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/float-newlib/float_req_bl_1230_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/float-newlib/float_req_bl_1230_true-unreach-call.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 31da98a788dd1938c78053bade42bc512d4e8954 .................................................................................................................................................................................................................................................................................................................................................... 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/float_req_bl_1230_true-unreach-call.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 31da98a788dd1938c78053bade42bc512d4e8954 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 04:06:36,839 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 04:06:36,841 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 04:06:36,853 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 04:06:36,854 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 04:06:36,855 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 04:06:36,856 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 04:06:36,858 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 04:06:36,860 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 04:06:36,860 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 04:06:36,861 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 04:06:36,862 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 04:06:36,862 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 04:06:36,863 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 04:06:36,865 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 04:06:36,865 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 04:06:36,866 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 04:06:36,868 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 04:06:36,870 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 04:06:36,872 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 04:06:36,873 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 04:06:36,875 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 04:06:36,878 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 04:06:36,878 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 04:06:36,878 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 04:06:36,879 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 04:06:36,880 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 04:06:36,881 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 04:06:36,882 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 04:06:36,883 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 04:06:36,884 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 04:06:36,884 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 04:06:36,885 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 04:06:36,885 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 04:06:36,886 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 04:06:36,887 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 04:06:36,887 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 04:06:36,904 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 04:06:36,904 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 04:06:36,906 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 04:06:36,906 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 04:06:36,906 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 04:06:36,906 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 04:06:36,907 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 04:06:36,907 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 04:06:36,907 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 04:06:36,907 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 04:06:36,908 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 04:06:36,908 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 04:06:36,908 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 04:06:36,908 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 04:06:36,908 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 04:06:36,909 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 04:06:36,909 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 04:06:36,909 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 04:06:36,909 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 04:06:36,910 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 04:06:36,910 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 04:06:36,910 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 04:06:36,910 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 04:06:36,911 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 04:06:36,911 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 04:06:36,911 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 04:06:36,911 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 04:06:36,912 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 04:06:36,912 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 -> 31da98a788dd1938c78053bade42bc512d4e8954 [2018-12-31 04:06:36,954 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 04:06:36,967 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 04:06:36,971 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 04:06:36,973 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 04:06:36,973 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 04:06:36,974 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/float_req_bl_1230_true-unreach-call.c [2018-12-31 04:06:37,034 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae7aa23f6/8b8be3ae22e64004a571106d7c97ab2c/FLAGd2639fc98 [2018-12-31 04:06:37,552 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 04:06:37,553 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/float_req_bl_1230_true-unreach-call.c [2018-12-31 04:06:37,559 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae7aa23f6/8b8be3ae22e64004a571106d7c97ab2c/FLAGd2639fc98 [2018-12-31 04:06:37,907 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae7aa23f6/8b8be3ae22e64004a571106d7c97ab2c [2018-12-31 04:06:37,911 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 04:06:37,913 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 04:06:37,914 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 04:06:37,914 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 04:06:37,918 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 04:06:37,919 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 04:06:37" (1/1) ... [2018-12-31 04:06:37,923 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a490510 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:37, skipping insertion in model container [2018-12-31 04:06:37,923 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 04:06:37" (1/1) ... [2018-12-31 04:06:37,933 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 04:06:37,960 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 04:06:38,202 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 04:06:38,206 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 04:06:38,241 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 04:06:38,273 INFO L195 MainTranslator]: Completed translation [2018-12-31 04:06:38,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:38 WrapperNode [2018-12-31 04:06:38,273 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 04:06:38,275 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 04:06:38,275 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 04:06:38,275 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 04:06:38,285 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:38" (1/1) ... [2018-12-31 04:06:38,295 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:38" (1/1) ... [2018-12-31 04:06:38,327 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 04:06:38,328 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 04:06:38,328 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 04:06:38,328 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 04:06:38,339 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:38" (1/1) ... [2018-12-31 04:06:38,339 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:38" (1/1) ... [2018-12-31 04:06:38,342 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:38" (1/1) ... [2018-12-31 04:06:38,343 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:38" (1/1) ... [2018-12-31 04:06:38,352 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:38" (1/1) ... [2018-12-31 04:06:38,427 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:38" (1/1) ... [2018-12-31 04:06:38,429 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:38" (1/1) ... [2018-12-31 04:06:38,433 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 04:06:38,433 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 04:06:38,433 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 04:06:38,433 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 04:06:38,434 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 04:06:38,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-12-31 04:06:38,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 04:06:38,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 04:06:38,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-31 04:06:38,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 04:06:38,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 04:06:39,104 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 04:06:39,105 INFO L280 CfgBuilder]: Removed 16 assue(true) statements. [2018-12-31 04:06:39,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 04:06:39 BoogieIcfgContainer [2018-12-31 04:06:39,106 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 04:06:39,107 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 04:06:39,107 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 04:06:39,110 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 04:06:39,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 04:06:37" (1/3) ... [2018-12-31 04:06:39,111 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13a46ce2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 04:06:39, skipping insertion in model container [2018-12-31 04:06:39,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:38" (2/3) ... [2018-12-31 04:06:39,112 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13a46ce2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 04:06:39, skipping insertion in model container [2018-12-31 04:06:39,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 04:06:39" (3/3) ... [2018-12-31 04:06:39,114 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1230_true-unreach-call.c [2018-12-31 04:06:39,125 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 04:06:39,136 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 04:06:39,156 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 04:06:39,191 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 04:06:39,192 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 04:06:39,192 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 04:06:39,193 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 04:06:39,194 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 04:06:39,194 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 04:06:39,194 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 04:06:39,194 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 04:06:39,195 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 04:06:39,212 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2018-12-31 04:06:39,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-31 04:06:39,220 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:06:39,220 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:06:39,222 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:06:39,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:06:39,228 INFO L82 PathProgramCache]: Analyzing trace with hash -958093107, now seen corresponding path program 1 times [2018-12-31 04:06:39,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:06:39,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:06:39,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:06:39,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:06:39,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:06:39,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:06:39,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:06:39,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:06:39,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 04:06:39,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 04:06:39,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 04:06:39,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 04:06:39,368 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2018-12-31 04:06:39,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:06:39,387 INFO L93 Difference]: Finished difference Result 54 states and 84 transitions. [2018-12-31 04:06:39,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 04:06:39,389 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-12-31 04:06:39,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:06:39,401 INFO L225 Difference]: With dead ends: 54 [2018-12-31 04:06:39,402 INFO L226 Difference]: Without dead ends: 25 [2018-12-31 04:06:39,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 04:06:39,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-31 04:06:39,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-31 04:06:39,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-31 04:06:39,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2018-12-31 04:06:39,443 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 35 transitions. Word has length 10 [2018-12-31 04:06:39,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:06:39,443 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 35 transitions. [2018-12-31 04:06:39,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 04:06:39,443 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2018-12-31 04:06:39,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-31 04:06:39,444 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:06:39,444 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:06:39,444 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:06:39,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:06:39,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1001566992, now seen corresponding path program 1 times [2018-12-31 04:06:39,446 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:06:39,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:06:39,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:06:39,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:06:39,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:06:39,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:06:39,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:06:39,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:06:39,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 04:06:39,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 04:06:39,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 04:06:39,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 04:06:39,582 INFO L87 Difference]: Start difference. First operand 25 states and 35 transitions. Second operand 4 states. [2018-12-31 04:06:39,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:06:39,752 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2018-12-31 04:06:39,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 04:06:39,754 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-12-31 04:06:39,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:06:39,755 INFO L225 Difference]: With dead ends: 41 [2018-12-31 04:06:39,755 INFO L226 Difference]: Without dead ends: 36 [2018-12-31 04:06:39,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 04:06:39,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-31 04:06:39,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2018-12-31 04:06:39,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-31 04:06:39,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2018-12-31 04:06:39,767 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 11 [2018-12-31 04:06:39,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:06:39,768 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2018-12-31 04:06:39,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 04:06:39,768 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2018-12-31 04:06:39,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-31 04:06:39,769 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:06:39,770 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:06:39,770 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:06:39,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:06:39,771 INFO L82 PathProgramCache]: Analyzing trace with hash -555778251, now seen corresponding path program 1 times [2018-12-31 04:06:39,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:06:39,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:06:39,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:06:39,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:06:39,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:06:39,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:06:39,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:06:39,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:06:39,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 04:06:39,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 04:06:39,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 04:06:39,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 04:06:39,873 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 4 states. [2018-12-31 04:06:40,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:06:40,023 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2018-12-31 04:06:40,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 04:06:40,024 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-12-31 04:06:40,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:06:40,026 INFO L225 Difference]: With dead ends: 43 [2018-12-31 04:06:40,026 INFO L226 Difference]: Without dead ends: 38 [2018-12-31 04:06:40,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 04:06:40,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-31 04:06:40,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 27. [2018-12-31 04:06:40,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-31 04:06:40,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2018-12-31 04:06:40,032 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 14 [2018-12-31 04:06:40,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:06:40,033 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2018-12-31 04:06:40,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 04:06:40,034 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2018-12-31 04:06:40,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-31 04:06:40,034 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:06:40,034 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:06:40,035 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:06:40,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:06:40,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1219229111, now seen corresponding path program 1 times [2018-12-31 04:06:40,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:06:40,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:06:40,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:06:40,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:06:40,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:06:40,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 04:06:40,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 04:06:40,135 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 04:06:40,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 04:06:40 BoogieIcfgContainer [2018-12-31 04:06:40,166 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 04:06:40,167 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 04:06:40,167 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 04:06:40,167 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 04:06:40,168 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 04:06:39" (3/4) ... [2018-12-31 04:06:40,171 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-31 04:06:40,171 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 04:06:40,172 INFO L168 Benchmark]: Toolchain (without parser) took 2260.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 948.7 MB in the beginning and 1.0 GB in the end (delta: -99.0 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. [2018-12-31 04:06:40,175 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 04:06:40,175 INFO L168 Benchmark]: CACSL2BoogieTranslator took 359.74 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-31 04:06:40,176 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.91 ms. Allocated memory is still 1.0 GB. Free memory was 937.9 MB in the beginning and 932.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-31 04:06:40,177 INFO L168 Benchmark]: Boogie Preprocessor took 105.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -183.4 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. [2018-12-31 04:06:40,178 INFO L168 Benchmark]: RCFGBuilder took 672.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.5 MB). Peak memory consumption was 27.5 MB. Max. memory is 11.5 GB. [2018-12-31 04:06:40,179 INFO L168 Benchmark]: TraceAbstraction took 1059.80 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.8 MB). Peak memory consumption was 40.8 MB. Max. memory is 11.5 GB. [2018-12-31 04:06:40,180 INFO L168 Benchmark]: Witness Printer took 4.88 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. [2018-12-31 04:06:40,185 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 359.74 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.91 ms. Allocated memory is still 1.0 GB. Free memory was 937.9 MB in the beginning and 932.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 105.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -183.4 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 672.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.5 MB). Peak memory consumption was 27.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1059.80 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.8 MB). Peak memory consumption was 40.8 MB. Max. memory is 11.5 GB. * Witness Printer took 4.88 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: 59]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 44, overapproximation of someBinaryArithmeticFLOAToperation at line 54. Possible FailurePath: [L54] float x = 0.0f / 0.0f; [L55] float y = 0.0f / 0.0f; [L12] __uint32_t w; [L15] ieee_float_shape_type gf_u; [L16] gf_u.value = (x) [L17] EXPR gf_u.word [L17] (w) = gf_u.word [L20] COND FALSE !(w == 0x00000000 || w == 0x80000000) [L22-L23] COND FALSE !((w >= 0x00800000 && w <= 0x7f7fffff) || (w >= 0x80800000 && w <= 0xff7fffff)) [L25-L26] COND FALSE !((w >= 0x00000001 && w <= 0x007fffff) || (w >= 0x80000001 && w <= 0x807fffff)) [L28] COND FALSE !(w == 0x7f800000 || w == 0xff800000) [L31] return 0; [L35] COND TRUE __fpclassify_float(x) == 0 [L36] return y; [L56] float res = fmin_float(x, y); [L44] return x != x; [L58] COND TRUE !isnan_float(res) [L59] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 28 locations, 1 error locations. UNSAFE Result, 0.9s OverallTime, 4 OverallIterations, 1 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 110 SDtfs, 22 SDslu, 110 SDs, 0 SdLazy, 30 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 20 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 49 NumberOfCodeBlocks, 49 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 32 ConstructedInterpolants, 0 QuantifiedInterpolants, 442 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-2e94e6a [2018-12-31 04:06:42,692 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 04:06:42,694 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 04:06:42,713 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 04:06:42,714 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 04:06:42,715 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 04:06:42,716 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 04:06:42,719 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 04:06:42,721 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 04:06:42,722 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 04:06:42,722 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 04:06:42,723 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 04:06:42,724 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 04:06:42,725 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 04:06:42,727 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 04:06:42,728 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 04:06:42,729 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 04:06:42,734 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 04:06:42,741 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 04:06:42,744 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 04:06:42,747 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 04:06:42,752 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 04:06:42,757 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 04:06:42,759 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 04:06:42,759 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 04:06:42,760 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 04:06:42,762 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 04:06:42,765 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 04:06:42,766 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 04:06:42,769 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 04:06:42,771 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 04:06:42,772 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 04:06:42,774 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 04:06:42,774 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 04:06:42,775 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 04:06:42,777 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 04:06:42,778 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-12-31 04:06:42,802 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 04:06:42,802 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 04:06:42,804 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 04:06:42,804 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 04:06:42,804 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 04:06:42,804 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 04:06:42,804 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 04:06:42,810 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 04:06:42,810 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 04:06:42,810 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 04:06:42,810 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 04:06:42,811 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 04:06:42,811 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-31 04:06:42,811 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-31 04:06:42,811 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 04:06:42,811 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 04:06:42,812 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 04:06:42,812 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 04:06:42,812 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 04:06:42,812 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 04:06:42,812 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 04:06:42,814 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 04:06:42,814 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 04:06:42,815 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 04:06:42,815 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 04:06:42,815 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 04:06:42,815 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-12-31 04:06:42,815 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 04:06:42,816 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-31 04:06:42,816 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-31 04:06:42,816 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 -> 31da98a788dd1938c78053bade42bc512d4e8954 [2018-12-31 04:06:42,878 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 04:06:42,896 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 04:06:42,901 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 04:06:42,903 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 04:06:42,903 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 04:06:42,904 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/float_req_bl_1230_true-unreach-call.c [2018-12-31 04:06:42,964 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b01a9e78c/2f64a6fabb6e4b7684ea6861a21e1bef/FLAG15872df64 [2018-12-31 04:06:43,387 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 04:06:43,388 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/float_req_bl_1230_true-unreach-call.c [2018-12-31 04:06:43,395 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b01a9e78c/2f64a6fabb6e4b7684ea6861a21e1bef/FLAG15872df64 [2018-12-31 04:06:43,755 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b01a9e78c/2f64a6fabb6e4b7684ea6861a21e1bef [2018-12-31 04:06:43,760 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 04:06:43,762 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 04:06:43,763 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 04:06:43,763 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 04:06:43,768 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 04:06:43,769 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 04:06:43" (1/1) ... [2018-12-31 04:06:43,773 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d8c1856 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:43, skipping insertion in model container [2018-12-31 04:06:43,773 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 04:06:43" (1/1) ... [2018-12-31 04:06:43,782 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 04:06:43,807 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 04:06:44,074 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 04:06:44,084 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 04:06:44,120 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 04:06:44,160 INFO L195 MainTranslator]: Completed translation [2018-12-31 04:06:44,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:44 WrapperNode [2018-12-31 04:06:44,160 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 04:06:44,161 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 04:06:44,162 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 04:06:44,162 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 04:06:44,173 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:44" (1/1) ... [2018-12-31 04:06:44,192 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:44" (1/1) ... [2018-12-31 04:06:44,237 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 04:06:44,239 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 04:06:44,239 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 04:06:44,239 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 04:06:44,251 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:44" (1/1) ... [2018-12-31 04:06:44,252 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:44" (1/1) ... [2018-12-31 04:06:44,258 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:44" (1/1) ... [2018-12-31 04:06:44,259 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:44" (1/1) ... [2018-12-31 04:06:44,274 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:44" (1/1) ... [2018-12-31 04:06:44,347 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:44" (1/1) ... [2018-12-31 04:06:44,350 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:44" (1/1) ... [2018-12-31 04:06:44,354 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 04:06:44,355 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 04:06:44,355 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 04:06:44,355 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 04:06:44,356 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 04:06:44,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-12-31 04:06:44,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 04:06:44,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 04:06:44,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2018-12-31 04:06:44,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 04:06:44,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 04:06:44,670 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 04:06:44,958 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 04:06:45,011 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 04:06:45,011 INFO L280 CfgBuilder]: Removed 16 assue(true) statements. [2018-12-31 04:06:45,012 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 04:06:45 BoogieIcfgContainer [2018-12-31 04:06:45,012 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 04:06:45,013 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 04:06:45,013 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 04:06:45,017 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 04:06:45,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 04:06:43" (1/3) ... [2018-12-31 04:06:45,018 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d713073 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 04:06:45, skipping insertion in model container [2018-12-31 04:06:45,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:06:44" (2/3) ... [2018-12-31 04:06:45,018 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d713073 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 04:06:45, skipping insertion in model container [2018-12-31 04:06:45,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 04:06:45" (3/3) ... [2018-12-31 04:06:45,020 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1230_true-unreach-call.c [2018-12-31 04:06:45,031 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 04:06:45,040 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 04:06:45,059 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 04:06:45,088 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 04:06:45,089 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 04:06:45,089 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 04:06:45,089 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 04:06:45,089 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 04:06:45,090 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 04:06:45,090 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 04:06:45,090 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 04:06:45,090 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 04:06:45,103 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2018-12-31 04:06:45,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-31 04:06:45,110 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:06:45,111 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:06:45,113 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:06:45,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:06:45,119 INFO L82 PathProgramCache]: Analyzing trace with hash -958093107, now seen corresponding path program 1 times [2018-12-31 04:06:45,123 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 04:06:45,123 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-12-31 04:06:45,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:06:45,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:06:45,194 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:06:45,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:06:45,208 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 04:06:45,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:06:45,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 04:06:45,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 04:06:45,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 04:06:45,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 04:06:45,240 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2018-12-31 04:06:45,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:06:45,262 INFO L93 Difference]: Finished difference Result 54 states and 84 transitions. [2018-12-31 04:06:45,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 04:06:45,264 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-12-31 04:06:45,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:06:45,277 INFO L225 Difference]: With dead ends: 54 [2018-12-31 04:06:45,277 INFO L226 Difference]: Without dead ends: 25 [2018-12-31 04:06:45,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 04:06:45,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-31 04:06:45,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-31 04:06:45,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-31 04:06:45,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2018-12-31 04:06:45,314 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 35 transitions. Word has length 10 [2018-12-31 04:06:45,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:06:45,314 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 35 transitions. [2018-12-31 04:06:45,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 04:06:45,315 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2018-12-31 04:06:45,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-31 04:06:45,315 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:06:45,316 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:06:45,316 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:06:45,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:06:45,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1001566992, now seen corresponding path program 1 times [2018-12-31 04:06:45,317 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 04:06:45,318 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-12-31 04:06:45,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:06:45,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:06:45,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:06:45,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:06:45,447 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 04:06:45,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:06:45,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 04:06:45,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 04:06:45,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 04:06:45,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 04:06:45,461 INFO L87 Difference]: Start difference. First operand 25 states and 35 transitions. Second operand 4 states. [2018-12-31 04:06:45,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:06:45,695 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2018-12-31 04:06:45,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 04:06:45,698 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-12-31 04:06:45,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:06:45,699 INFO L225 Difference]: With dead ends: 41 [2018-12-31 04:06:45,699 INFO L226 Difference]: Without dead ends: 36 [2018-12-31 04:06:45,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 04:06:45,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-31 04:06:45,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2018-12-31 04:06:45,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-31 04:06:45,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2018-12-31 04:06:45,708 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 11 [2018-12-31 04:06:45,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:06:45,709 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2018-12-31 04:06:45,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 04:06:45,709 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2018-12-31 04:06:45,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-31 04:06:45,710 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:06:45,711 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:06:45,711 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:06:45,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:06:45,711 INFO L82 PathProgramCache]: Analyzing trace with hash 502183504, now seen corresponding path program 1 times [2018-12-31 04:06:45,712 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 04:06:45,712 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-12-31 04:06:45,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:06:45,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:06:45,778 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:06:45,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:06:45,879 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 04:06:45,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:06:45,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 04:06:45,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 04:06:45,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 04:06:45,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 04:06:45,893 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 4 states. [2018-12-31 04:06:45,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:06:45,996 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2018-12-31 04:06:45,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 04:06:45,997 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-12-31 04:06:45,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:06:45,998 INFO L225 Difference]: With dead ends: 43 [2018-12-31 04:06:45,998 INFO L226 Difference]: Without dead ends: 38 [2018-12-31 04:06:45,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 04:06:45,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-31 04:06:46,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 27. [2018-12-31 04:06:46,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-31 04:06:46,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2018-12-31 04:06:46,004 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 12 [2018-12-31 04:06:46,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:06:46,005 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2018-12-31 04:06:46,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 04:06:46,005 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2018-12-31 04:06:46,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-31 04:06:46,007 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:06:46,007 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:06:46,007 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:06:46,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:06:46,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1951251627, now seen corresponding path program 1 times [2018-12-31 04:06:46,009 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 04:06:46,009 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-12-31 04:06:46,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2018-12-31 04:06:46,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:06:46,075 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:06:46,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:06:46,095 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 04:06:46,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:06:46,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 04:06:46,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 04:06:46,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 04:06:46,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 04:06:46,109 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 4 states. [2018-12-31 04:06:46,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:06:46,462 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2018-12-31 04:06:46,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 04:06:46,463 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-12-31 04:06:46,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:06:46,464 INFO L225 Difference]: With dead ends: 43 [2018-12-31 04:06:46,465 INFO L226 Difference]: Without dead ends: 38 [2018-12-31 04:06:46,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 04:06:46,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-31 04:06:46,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 27. [2018-12-31 04:06:46,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-31 04:06:46,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2018-12-31 04:06:46,472 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 13 [2018-12-31 04:06:46,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:06:46,472 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2018-12-31 04:06:46,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 04:06:46,472 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2018-12-31 04:06:46,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-31 04:06:46,474 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:06:46,474 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:06:46,475 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:06:46,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:06:46,475 INFO L82 PathProgramCache]: Analyzing trace with hash -555778251, now seen corresponding path program 1 times [2018-12-31 04:06:46,476 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 04:06:46,477 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-12-31 04:06:46,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-12-31 04:06:46,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:06:46,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:06:46,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:06:46,650 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 04:06:46,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:06:46,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 04:06:46,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 04:06:46,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 04:06:46,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 04:06:46,663 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 4 states. [2018-12-31 04:06:46,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:06:46,763 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2018-12-31 04:06:46,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 04:06:46,764 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-12-31 04:06:46,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:06:46,765 INFO L225 Difference]: With dead ends: 43 [2018-12-31 04:06:46,765 INFO L226 Difference]: Without dead ends: 38 [2018-12-31 04:06:46,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 04:06:46,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-31 04:06:46,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 27. [2018-12-31 04:06:46,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-31 04:06:46,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2018-12-31 04:06:46,773 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 14 [2018-12-31 04:06:46,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:06:46,773 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2018-12-31 04:06:46,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 04:06:46,774 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2018-12-31 04:06:46,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-31 04:06:46,774 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:06:46,775 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:06:46,775 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:06:46,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:06:46,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1219229111, now seen corresponding path program 1 times [2018-12-31 04:06:46,776 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 04:06:46,776 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-12-31 04:06:46,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:06:46,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:06:46,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:06:46,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:06:46,912 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 04:06:46,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:06:46,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 04:06:46,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 04:06:46,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 04:06:46,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 04:06:46,925 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 6 states. [2018-12-31 04:06:47,335 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-31 04:06:47,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:06:47,490 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2018-12-31 04:06:47,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 04:06:47,494 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-12-31 04:06:47,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:06:47,495 INFO L225 Difference]: With dead ends: 36 [2018-12-31 04:06:47,495 INFO L226 Difference]: Without dead ends: 27 [2018-12-31 04:06:47,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 04:06:47,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-31 04:06:47,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-12-31 04:06:47,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-31 04:06:47,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2018-12-31 04:06:47,511 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 14 [2018-12-31 04:06:47,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:06:47,513 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2018-12-31 04:06:47,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 04:06:47,513 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2018-12-31 04:06:47,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-31 04:06:47,515 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:06:47,516 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:06:47,516 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:06:47,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:06:47,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1012428811, now seen corresponding path program 1 times [2018-12-31 04:06:47,517 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 04:06:47,518 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2018-12-31 04:06:47,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:06:47,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:06:47,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:06:47,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:06:47,610 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 04:06:47,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:06:47,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 04:06:47,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 04:06:47,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 04:06:47,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 04:06:47,623 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand 4 states. [2018-12-31 04:06:47,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:06:47,753 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2018-12-31 04:06:47,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 04:06:47,754 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-12-31 04:06:47,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:06:47,755 INFO L225 Difference]: With dead ends: 41 [2018-12-31 04:06:47,755 INFO L226 Difference]: Without dead ends: 36 [2018-12-31 04:06:47,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 04:06:47,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-31 04:06:47,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2018-12-31 04:06:47,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-31 04:06:47,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2018-12-31 04:06:47,763 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 16 [2018-12-31 04:06:47,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:06:47,763 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2018-12-31 04:06:47,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 04:06:47,763 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2018-12-31 04:06:47,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-31 04:06:47,765 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:06:47,765 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:06:47,766 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:06:47,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:06:47,766 INFO L82 PathProgramCache]: Analyzing trace with hash 874917212, now seen corresponding path program 1 times [2018-12-31 04:06:47,766 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 04:06:47,766 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2018-12-31 04:06:47,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:06:47,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:06:47,829 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:06:47,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:06:47,845 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 04:06:47,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:06:47,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 04:06:47,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 04:06:47,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 04:06:47,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 04:06:47,858 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 4 states. [2018-12-31 04:06:47,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:06:47,944 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2018-12-31 04:06:47,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 04:06:47,949 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-12-31 04:06:47,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:06:47,950 INFO L225 Difference]: With dead ends: 43 [2018-12-31 04:06:47,950 INFO L226 Difference]: Without dead ends: 38 [2018-12-31 04:06:47,952 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 04:06:47,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-31 04:06:47,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 27. [2018-12-31 04:06:47,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-31 04:06:47,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2018-12-31 04:06:47,959 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 17 [2018-12-31 04:06:47,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:06:47,959 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2018-12-31 04:06:47,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 04:06:47,959 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2018-12-31 04:06:47,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-31 04:06:47,960 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:06:47,960 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:06:47,961 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:06:47,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:06:47,962 INFO L82 PathProgramCache]: Analyzing trace with hash -356841937, now seen corresponding path program 1 times [2018-12-31 04:06:47,963 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 04:06:47,963 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2018-12-31 04:06:47,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:06:48,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:06:48,013 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:06:48,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:06:48,161 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 04:06:48,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:06:48,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 04:06:48,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 04:06:48,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 04:06:48,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 04:06:48,174 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 7 states. [2018-12-31 04:06:48,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:06:48,380 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2018-12-31 04:06:48,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 04:06:48,381 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-12-31 04:06:48,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:06:48,382 INFO L225 Difference]: With dead ends: 32 [2018-12-31 04:06:48,382 INFO L226 Difference]: Without dead ends: 23 [2018-12-31 04:06:48,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-12-31 04:06:48,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-31 04:06:48,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-31 04:06:48,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-31 04:06:48,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2018-12-31 04:06:48,388 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 18 [2018-12-31 04:06:48,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:06:48,388 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2018-12-31 04:06:48,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 04:06:48,391 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2018-12-31 04:06:48,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-31 04:06:48,391 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:06:48,392 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:06:48,392 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:06:48,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:06:48,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1049576048, now seen corresponding path program 1 times [2018-12-31 04:06:48,394 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 04:06:48,394 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2018-12-31 04:06:48,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:06:48,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:06:48,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:06:48,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:06:48,462 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 04:06:48,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:06:48,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 04:06:48,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 04:06:48,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 04:06:48,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 04:06:48,474 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand 4 states. [2018-12-31 04:06:48,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:06:48,581 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-12-31 04:06:48,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 04:06:48,585 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-12-31 04:06:48,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:06:48,585 INFO L225 Difference]: With dead ends: 32 [2018-12-31 04:06:48,585 INFO L226 Difference]: Without dead ends: 25 [2018-12-31 04:06:48,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 04:06:48,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-31 04:06:48,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-12-31 04:06:48,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-31 04:06:48,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-12-31 04:06:48,592 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 18 [2018-12-31 04:06:48,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:06:48,592 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-12-31 04:06:48,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 04:06:48,593 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2018-12-31 04:06:48,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-31 04:06:48,593 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:06:48,593 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:06:48,595 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:06:48,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:06:48,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1983383519, now seen corresponding path program 1 times [2018-12-31 04:06:48,596 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 04:06:48,596 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2018-12-31 04:06:48,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:06:48,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:06:48,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:06:48,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:06:48,664 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 04:06:48,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:06:48,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 04:06:48,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 04:06:48,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 04:06:48,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 04:06:48,675 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 4 states. [2018-12-31 04:06:48,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:06:48,772 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-12-31 04:06:48,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 04:06:48,773 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-12-31 04:06:48,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:06:48,773 INFO L225 Difference]: With dead ends: 32 [2018-12-31 04:06:48,773 INFO L226 Difference]: Without dead ends: 25 [2018-12-31 04:06:48,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 04:06:48,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-31 04:06:48,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-12-31 04:06:48,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-31 04:06:48,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2018-12-31 04:06:48,781 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 19 [2018-12-31 04:06:48,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:06:48,781 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2018-12-31 04:06:48,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 04:06:48,782 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2018-12-31 04:06:48,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-31 04:06:48,783 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:06:48,783 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:06:48,783 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:06:48,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:06:48,784 INFO L82 PathProgramCache]: Analyzing trace with hash -208376157, now seen corresponding path program 1 times [2018-12-31 04:06:48,784 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 04:06:48,784 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2018-12-31 04:06:48,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:06:48,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:06:48,838 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:06:48,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:06:48,901 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 04:06:48,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:06:48,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 04:06:48,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 04:06:48,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 04:06:48,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 04:06:48,916 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 6 states. [2018-12-31 04:06:48,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:06:48,993 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2018-12-31 04:06:48,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 04:06:48,994 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-12-31 04:06:48,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:06:48,994 INFO L225 Difference]: With dead ends: 23 [2018-12-31 04:06:48,994 INFO L226 Difference]: Without dead ends: 0 [2018-12-31 04:06:48,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 04:06:48,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-31 04:06:48,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-31 04:06:48,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-31 04:06:48,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-31 04:06:48,997 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2018-12-31 04:06:48,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:06:48,997 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-31 04:06:48,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 04:06:48,998 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-31 04:06:48,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-31 04:06:49,004 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-31 04:06:49,306 INFO L444 ceAbstractionStarter]: At program point L31(lines 11 32) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 8 24) (_ +zero 8 24)))) (and (= ULTIMATE.start_fmin_float_~x .cse0) (= ULTIMATE.start_fmin_float_~y .cse0))) [2018-12-31 04:06:49,306 INFO L444 ceAbstractionStarter]: At program point L31-1(lines 11 32) the Hoare annotation is: (let ((.cse1 (fp.div roundNearestTiesToEven (_ +zero 8 24) (_ +zero 8 24)))) (let ((.cse0 (= ULTIMATE.start_fmin_float_~y .cse1))) (or (and (or (= (bvadd |ULTIMATE.start___fpclassify_float_#res| (_ bv4294967292 32)) (_ bv0 32)) (= (bvadd |ULTIMATE.start___fpclassify_float_#res| (_ bv4294967294 32)) (_ bv0 32))) .cse0) (and (= ULTIMATE.start_fmin_float_~x .cse1) .cse0) (and (= (bvadd |ULTIMATE.start___fpclassify_float_#res| (_ bv4294967295 32)) (_ bv0 32)) .cse0) (and (= (bvadd |ULTIMATE.start___fpclassify_float_#res| (_ bv4294967293 32)) (_ bv0 32)) .cse0)))) [2018-12-31 04:06:49,306 INFO L444 ceAbstractionStarter]: At program point L44(line 44) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 8 24) (_ +zero 8 24)))) (and (= (bvadd |ULTIMATE.start_isnan_float_#res| (_ bv4294967295 32)) (_ bv0 32)) (= |ULTIMATE.start_fmin_float_#res| .cse0) (= ULTIMATE.start_fmin_float_~y .cse0))) [2018-12-31 04:06:49,306 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-12-31 04:06:49,306 INFO L448 ceAbstractionStarter]: For program point L40-2(line 40) no Hoare annotation was computed. [2018-12-31 04:06:49,306 INFO L444 ceAbstractionStarter]: At program point L40-3(lines 34 41) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 8 24) (_ +zero 8 24)))) (and (= |ULTIMATE.start_fmin_float_#res| .cse0) (= ULTIMATE.start_fmin_float_~y .cse0))) [2018-12-31 04:06:49,307 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-12-31 04:06:49,307 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-31 04:06:49,307 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-31 04:06:49,307 INFO L448 ceAbstractionStarter]: For program point L28(lines 28 31) no Hoare annotation was computed. [2018-12-31 04:06:49,307 INFO L448 ceAbstractionStarter]: For program point L28-1(lines 28 31) no Hoare annotation was computed. [2018-12-31 04:06:49,307 INFO L448 ceAbstractionStarter]: For program point L37(lines 37 38) no Hoare annotation was computed. [2018-12-31 04:06:49,307 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-31 04:06:49,307 INFO L448 ceAbstractionStarter]: For program point L58(lines 58 61) no Hoare annotation was computed. [2018-12-31 04:06:49,307 INFO L448 ceAbstractionStarter]: For program point L25(lines 25 31) no Hoare annotation was computed. [2018-12-31 04:06:49,307 INFO L448 ceAbstractionStarter]: For program point L25-1(lines 25 31) no Hoare annotation was computed. [2018-12-31 04:06:49,308 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 59) no Hoare annotation was computed. [2018-12-31 04:06:49,308 INFO L451 ceAbstractionStarter]: At program point L63(lines 46 64) the Hoare annotation is: true [2018-12-31 04:06:49,308 INFO L448 ceAbstractionStarter]: For program point L59(line 59) no Hoare annotation was computed. [2018-12-31 04:06:49,308 INFO L448 ceAbstractionStarter]: For program point L22(lines 22 31) no Hoare annotation was computed. [2018-12-31 04:06:49,308 INFO L448 ceAbstractionStarter]: For program point L22-1(lines 22 31) no Hoare annotation was computed. [2018-12-31 04:06:49,308 INFO L448 ceAbstractionStarter]: For program point L14-1(lines 14 18) no Hoare annotation was computed. [2018-12-31 04:06:49,308 INFO L444 ceAbstractionStarter]: At program point L14-2(lines 14 18) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 8 24) (_ +zero 8 24)))) (and (= ULTIMATE.start_fmin_float_~x .cse0) (= ULTIMATE.start_fmin_float_~y .cse0))) [2018-12-31 04:06:49,308 INFO L448 ceAbstractionStarter]: For program point L14-3(lines 11 32) no Hoare annotation was computed. [2018-12-31 04:06:49,309 INFO L448 ceAbstractionStarter]: For program point L14-5(lines 14 18) no Hoare annotation was computed. [2018-12-31 04:06:49,309 INFO L444 ceAbstractionStarter]: At program point L14-6(lines 14 18) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 8 24) (_ +zero 8 24)))) (and (= ULTIMATE.start_fmin_float_~x .cse0) (= ULTIMATE.start_fmin_float_~y .cse0))) [2018-12-31 04:06:49,309 INFO L448 ceAbstractionStarter]: For program point L14-7(lines 11 32) no Hoare annotation was computed. [2018-12-31 04:06:49,309 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 36) no Hoare annotation was computed. [2018-12-31 04:06:49,318 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:49,319 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:49,325 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:49,325 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:49,326 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:49,326 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:49,328 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:49,328 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:49,328 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:49,329 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:49,330 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:49,330 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:49,330 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:49,330 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:49,331 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:49,331 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:49,331 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:49,331 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:49,333 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:49,334 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:49,335 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:49,335 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:49,335 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:49,335 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:49,336 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:49,336 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:49,336 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:49,338 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:49,338 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:49,338 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:49,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 04:06:49 BoogieIcfgContainer [2018-12-31 04:06:49,342 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 04:06:49,343 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 04:06:49,343 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 04:06:49,343 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 04:06:49,343 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 04:06:45" (3/4) ... [2018-12-31 04:06:49,349 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-31 04:06:49,363 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2018-12-31 04:06:49,363 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-31 04:06:49,363 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-31 04:06:49,392 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \result == ~fp.div~FLOAT(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && y == ~fp.div~FLOAT(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) [2018-12-31 04:06:49,392 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (~bvadd64(\result, 4294967295bv32) == 0bv32 && \result == ~fp.div~FLOAT(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && y == ~fp.div~FLOAT(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) [2018-12-31 04:06:49,393 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((~bvadd64(\result, 4294967292bv32) == 0bv32 || ~bvadd64(\result, 4294967294bv32) == 0bv32) && y == ~fp.div~FLOAT(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) || (x == ~fp.div~FLOAT(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && y == ~fp.div~FLOAT(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()))) || (~bvadd64(\result, 4294967295bv32) == 0bv32 && y == ~fp.div~FLOAT(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()))) || (~bvadd64(\result, 4294967293bv32) == 0bv32 && y == ~fp.div~FLOAT(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) [2018-12-31 04:06:49,443 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 04:06:49,444 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 04:06:49,447 INFO L168 Benchmark]: Toolchain (without parser) took 5686.07 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 948.7 MB in the beginning and 835.9 MB in the end (delta: 112.8 MB). Peak memory consumption was 231.8 MB. Max. memory is 11.5 GB. [2018-12-31 04:06:49,448 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 04:06:49,448 INFO L168 Benchmark]: CACSL2BoogieTranslator took 397.79 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-31 04:06:49,450 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.05 ms. Allocated memory is still 1.0 GB. Free memory was 937.9 MB in the beginning and 932.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-31 04:06:49,450 INFO L168 Benchmark]: Boogie Preprocessor took 115.45 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -174.5 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. [2018-12-31 04:06:49,451 INFO L168 Benchmark]: RCFGBuilder took 657.60 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2018-12-31 04:06:49,451 INFO L168 Benchmark]: TraceAbstraction took 4329.25 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 842.6 MB in the end (delta: 239.6 MB). Peak memory consumption was 239.6 MB. Max. memory is 11.5 GB. [2018-12-31 04:06:49,453 INFO L168 Benchmark]: Witness Printer took 103.02 ms. Allocated memory is still 1.1 GB. Free memory was 842.6 MB in the beginning and 835.9 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-31 04:06:49,457 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 397.79 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 77.05 ms. Allocated memory is still 1.0 GB. Free memory was 937.9 MB in the beginning and 932.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 115.45 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -174.5 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 657.60 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4329.25 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 842.6 MB in the end (delta: 239.6 MB). Peak memory consumption was 239.6 MB. Max. memory is 11.5 GB. * Witness Printer took 103.02 ms. Allocated memory is still 1.1 GB. Free memory was 842.6 MB in the beginning and 835.9 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 59]: 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: 11]: Loop Invariant [2018-12-31 04:06:49,464 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:49,471 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:49,471 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:49,472 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: x == ~fp.div~FLOAT(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && y == ~fp.div~FLOAT(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 34]: Loop Invariant [2018-12-31 04:06:49,472 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:49,472 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:49,473 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:49,473 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: \result == ~fp.div~FLOAT(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && y == ~fp.div~FLOAT(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 44]: Loop Invariant [2018-12-31 04:06:49,473 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:49,473 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:49,474 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:49,474 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (~bvadd64(\result, 4294967295bv32) == 0bv32 && \result == ~fp.div~FLOAT(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && y == ~fp.div~FLOAT(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 14]: Loop Invariant [2018-12-31 04:06:49,474 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:49,474 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:49,475 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:49,475 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: x == ~fp.div~FLOAT(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && y == ~fp.div~FLOAT(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 14]: Loop Invariant [2018-12-31 04:06:49,475 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:49,476 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:49,476 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:49,476 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: x == ~fp.div~FLOAT(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && y == ~fp.div~FLOAT(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 11]: Loop Invariant [2018-12-31 04:06:49,476 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:49,477 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:49,477 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:49,477 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:49,477 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:49,478 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:49,478 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:49,478 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:49,478 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 04:06:49,479 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((((~bvadd64(\result, 4294967292bv32) == 0bv32 || ~bvadd64(\result, 4294967294bv32) == 0bv32) && y == ~fp.div~FLOAT(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) || (x == ~fp.div~FLOAT(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && y == ~fp.div~FLOAT(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()))) || (~bvadd64(\result, 4294967295bv32) == 0bv32 && y == ~fp.div~FLOAT(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()))) || (~bvadd64(\result, 4294967293bv32) == 0bv32 && y == ~fp.div~FLOAT(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 28 locations, 1 error locations. SAFE Result, 4.2s OverallTime, 12 OverallIterations, 1 TraceHistogramMax, 2.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 413 SDtfs, 132 SDslu, 682 SDs, 0 SdLazy, 219 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 187 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 68 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 21 NumberOfFragments, 127 HoareAnnotationTreeSize, 7 FomulaSimplifications, 938 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 181 NumberOfCodeBlocks, 181 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 169 ConstructedInterpolants, 0 QuantifiedInterpolants, 6625 SizeOfPredicates, 32 NumberOfNonLiveVariables, 564 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...