./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_1232a.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/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 ../sv-benchmarks/c/float-newlib/float_req_bl_1232a.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 cd0c8f7b91fa815011541d5ffb41102d34132ba8 .......................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/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 ../sv-benchmarks/c/float-newlib/float_req_bl_1232a.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 cd0c8f7b91fa815011541d5ffb41102d34132ba8 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-27 23:51:03,137 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 23:51:03,139 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 23:51:03,151 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 23:51:03,151 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 23:51:03,152 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 23:51:03,154 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 23:51:03,156 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 23:51:03,158 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 23:51:03,158 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 23:51:03,159 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 23:51:03,161 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 23:51:03,161 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 23:51:03,162 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 23:51:03,163 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 23:51:03,164 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 23:51:03,165 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 23:51:03,166 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 23:51:03,168 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 23:51:03,170 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 23:51:03,172 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 23:51:03,173 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 23:51:03,174 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 23:51:03,175 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 23:51:03,177 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 23:51:03,178 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 23:51:03,178 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 23:51:03,179 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 23:51:03,179 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 23:51:03,180 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 23:51:03,181 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 23:51:03,181 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 23:51:03,182 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 23:51:03,184 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 23:51:03,185 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 23:51:03,188 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 23:51:03,189 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 23:51:03,190 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 23:51:03,190 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 23:51:03,191 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 23:51:03,195 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 23:51:03,196 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-27 23:51:03,219 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 23:51:03,219 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 23:51:03,220 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 23:51:03,221 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 23:51:03,221 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 23:51:03,221 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 23:51:03,222 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 23:51:03,222 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 23:51:03,222 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 23:51:03,222 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 23:51:03,223 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 23:51:03,223 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 23:51:03,223 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 23:51:03,224 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 23:51:03,224 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 23:51:03,224 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 23:51:03,224 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 23:51:03,225 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 23:51:03,225 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 23:51:03,225 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 23:51:03,227 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 23:51:03,227 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 23:51:03,227 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 23:51:03,227 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 23:51:03,228 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 23:51:03,228 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 23:51:03,228 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 23:51:03,228 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 23:51:03,228 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> cd0c8f7b91fa815011541d5ffb41102d34132ba8 [2019-11-27 23:51:03,515 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 23:51:03,531 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 23:51:03,535 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 23:51:03,536 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 23:51:03,536 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 23:51:03,537 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1232a.c [2019-11-27 23:51:03,608 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29fa589e1/5acbcd93a3db4d39b4c8b11b6b103f6a/FLAGe1bf047a6 [2019-11-27 23:51:04,036 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 23:51:04,037 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1232a.c [2019-11-27 23:51:04,044 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29fa589e1/5acbcd93a3db4d39b4c8b11b6b103f6a/FLAGe1bf047a6 [2019-11-27 23:51:04,414 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29fa589e1/5acbcd93a3db4d39b4c8b11b6b103f6a [2019-11-27 23:51:04,417 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 23:51:04,418 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 23:51:04,419 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 23:51:04,420 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 23:51:04,423 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 23:51:04,424 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:51:04" (1/1) ... [2019-11-27 23:51:04,427 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f384efe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:51:04, skipping insertion in model container [2019-11-27 23:51:04,427 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:51:04" (1/1) ... [2019-11-27 23:51:04,434 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 23:51:04,453 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 23:51:04,634 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:51:04,639 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 23:51:04,685 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:51:04,762 INFO L208 MainTranslator]: Completed translation [2019-11-27 23:51:04,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:51:04 WrapperNode [2019-11-27 23:51:04,762 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 23:51:04,763 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 23:51:04,763 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 23:51:04,764 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 23:51:04,771 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:51:04" (1/1) ... [2019-11-27 23:51:04,791 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:51:04" (1/1) ... [2019-11-27 23:51:04,823 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 23:51:04,824 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 23:51:04,824 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 23:51:04,824 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 23:51:04,832 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:51:04" (1/1) ... [2019-11-27 23:51:04,832 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:51:04" (1/1) ... [2019-11-27 23:51:04,834 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:51:04" (1/1) ... [2019-11-27 23:51:04,835 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:51:04" (1/1) ... [2019-11-27 23:51:04,842 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:51:04" (1/1) ... [2019-11-27 23:51:04,847 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:51:04" (1/1) ... [2019-11-27 23:51:04,849 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:51:04" (1/1) ... [2019-11-27 23:51:04,852 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 23:51:04,852 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 23:51:04,852 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 23:51:04,852 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 23:51:04,853 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:51:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 23:51:04,913 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-27 23:51:04,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-11-27 23:51:04,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 23:51:04,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 23:51:04,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-27 23:51:04,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-27 23:51:05,300 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 23:51:05,300 INFO L297 CfgBuilder]: Removed 18 assume(true) statements. [2019-11-27 23:51:05,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:51:05 BoogieIcfgContainer [2019-11-27 23:51:05,302 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 23:51:05,303 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 23:51:05,303 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 23:51:05,306 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 23:51:05,306 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 11:51:04" (1/3) ... [2019-11-27 23:51:05,306 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@370d3077 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:51:05, skipping insertion in model container [2019-11-27 23:51:05,306 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:51:04" (2/3) ... [2019-11-27 23:51:05,307 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@370d3077 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:51:05, skipping insertion in model container [2019-11-27 23:51:05,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:51:05" (3/3) ... [2019-11-27 23:51:05,308 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1232a.c [2019-11-27 23:51:05,315 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 23:51:05,322 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 23:51:05,333 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 23:51:05,355 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 23:51:05,355 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 23:51:05,355 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 23:51:05,355 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 23:51:05,355 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 23:51:05,356 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 23:51:05,356 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 23:51:05,356 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 23:51:05,373 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2019-11-27 23:51:05,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-27 23:51:05,382 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:51:05,383 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:51:05,383 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:51:05,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:51:05,390 INFO L82 PathProgramCache]: Analyzing trace with hash -958075201, now seen corresponding path program 1 times [2019-11-27 23:51:05,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:51:05,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405356821] [2019-11-27 23:51:05,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:51:05,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:51:05,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:51:05,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405356821] [2019-11-27 23:51:05,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:51:05,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 23:51:05,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427141070] [2019-11-27 23:51:05,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-27 23:51:05,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:51:05,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-27 23:51:05,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-27 23:51:05,522 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2019-11-27 23:51:05,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:51:05,542 INFO L93 Difference]: Finished difference Result 62 states and 98 transitions. [2019-11-27 23:51:05,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-27 23:51:05,544 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-11-27 23:51:05,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:51:05,553 INFO L225 Difference]: With dead ends: 62 [2019-11-27 23:51:05,553 INFO L226 Difference]: Without dead ends: 29 [2019-11-27 23:51:05,556 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-27 23:51:05,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-27 23:51:05,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-11-27 23:51:05,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-27 23:51:05,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2019-11-27 23:51:05,593 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 10 [2019-11-27 23:51:05,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:51:05,594 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2019-11-27 23:51:05,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-27 23:51:05,594 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2019-11-27 23:51:05,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-27 23:51:05,595 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:51:05,595 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:51:05,600 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:51:05,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:51:05,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1001584898, now seen corresponding path program 1 times [2019-11-27 23:51:05,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:51:05,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250043917] [2019-11-27 23:51:05,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:51:05,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:51:05,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:51:05,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250043917] [2019-11-27 23:51:05,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:51:05,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 23:51:05,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432273096] [2019-11-27 23:51:05,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 23:51:05,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:51:05,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 23:51:05,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 23:51:05,678 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand 4 states. [2019-11-27 23:51:05,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:51:05,759 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2019-11-27 23:51:05,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 23:51:05,760 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-27 23:51:05,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:51:05,761 INFO L225 Difference]: With dead ends: 53 [2019-11-27 23:51:05,761 INFO L226 Difference]: Without dead ends: 44 [2019-11-27 23:51:05,762 INFO L630 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 [2019-11-27 23:51:05,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-27 23:51:05,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 31. [2019-11-27 23:51:05,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-27 23:51:05,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2019-11-27 23:51:05,769 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 11 [2019-11-27 23:51:05,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:51:05,770 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2019-11-27 23:51:05,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 23:51:05,770 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2019-11-27 23:51:05,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-27 23:51:05,771 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:51:05,771 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:51:05,772 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:51:05,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:51:05,772 INFO L82 PathProgramCache]: Analyzing trace with hash -555760345, now seen corresponding path program 1 times [2019-11-27 23:51:05,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:51:05,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686663050] [2019-11-27 23:51:05,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:51:05,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:51:05,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:51:05,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686663050] [2019-11-27 23:51:05,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:51:05,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 23:51:05,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420715993] [2019-11-27 23:51:05,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 23:51:05,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:51:05,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 23:51:05,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 23:51:05,854 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand 4 states. [2019-11-27 23:51:05,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:51:05,951 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2019-11-27 23:51:05,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 23:51:05,952 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-27 23:51:05,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:51:05,953 INFO L225 Difference]: With dead ends: 55 [2019-11-27 23:51:05,953 INFO L226 Difference]: Without dead ends: 46 [2019-11-27 23:51:05,954 INFO L630 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 [2019-11-27 23:51:05,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-11-27 23:51:05,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 31. [2019-11-27 23:51:05,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-27 23:51:05,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2019-11-27 23:51:05,964 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 14 [2019-11-27 23:51:05,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:51:05,964 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2019-11-27 23:51:05,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 23:51:05,965 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2019-11-27 23:51:05,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-27 23:51:05,965 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:51:05,965 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:51:05,966 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:51:05,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:51:05,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1219247017, now seen corresponding path program 1 times [2019-11-27 23:51:05,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:51:05,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224708646] [2019-11-27 23:51:05,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:51:05,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 23:51:06,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 23:51:06,054 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-27 23:51:06,054 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-27 23:51:06,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 11:51:06 BoogieIcfgContainer [2019-11-27 23:51:06,078 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 23:51:06,079 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 23:51:06,079 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 23:51:06,079 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 23:51:06,079 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:51:05" (3/4) ... [2019-11-27 23:51:06,082 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-27 23:51:06,082 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 23:51:06,085 INFO L168 Benchmark]: Toolchain (without parser) took 1665.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -100.3 MB). Peak memory consumption was 42.9 MB. Max. memory is 11.5 GB. [2019-11-27 23:51:06,085 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 23:51:06,086 INFO L168 Benchmark]: CACSL2BoogieTranslator took 343.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -183.3 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-11-27 23:51:06,087 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-27 23:51:06,088 INFO L168 Benchmark]: Boogie Preprocessor took 28.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-27 23:51:06,089 INFO L168 Benchmark]: RCFGBuilder took 449.87 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: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. [2019-11-27 23:51:06,090 INFO L168 Benchmark]: TraceAbstraction took 775.12 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: 45.9 MB). Peak memory consumption was 45.9 MB. Max. memory is 11.5 GB. [2019-11-27 23:51:06,090 INFO L168 Benchmark]: Witness Printer took 3.87 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 23:51:06,095 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.50 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 343.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -183.3 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 59.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 449.87 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: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 775.12 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: 45.9 MB). Peak memory consumption was 45.9 MB. Max. memory is 11.5 GB. * Witness Printer took 3.87 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 70]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 69, overapproximation of someUnaryFLOAToperation at line 65. Possible FailurePath: [L64] float x = 0.0f; [L65] float y = -0.0f; [L13] __uint32_t w; [L16] ieee_float_shape_type gf_u; [L17] gf_u.value = (x) [L18] EXPR gf_u.word [L18] (w) = gf_u.word [L21] COND FALSE !(w == 0x00000000 || w == 0x80000000) [L23-L24] COND FALSE !((w >= 0x00800000 && w <= 0x7f7fffff) || (w >= 0x80800000 && w <= 0xff7fffff)) [L26-L27] COND FALSE !((w >= 0x00000001 && w <= 0x007fffff) || (w >= 0x80000001 && w <= 0x807fffff)) [L29] COND FALSE !(w == 0x7f800000 || w == 0xff800000) [L32] return 0; [L36] COND TRUE __fpclassify_float(x) == 0 [L37] return y; [L66] float res = fmin_float(x, y); [L69] EXPR res == -0.0f && __signbit_float(res) == 1 [L69] COND TRUE !(res == -0.0f && __signbit_float(res) == 1) [L70] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 32 locations, 1 error locations. Result: UNSAFE, OverallTime: 0.7s, OverallIterations: 4, TraceHistogramMax: 1, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 135 SDtfs, 32 SDslu, 140 SDs, 0 SdLazy, 30 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 28 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s 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, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: 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-30f4e4a [2019-11-27 23:51:08,034 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 23:51:08,037 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 23:51:08,050 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 23:51:08,050 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 23:51:08,051 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 23:51:08,053 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 23:51:08,056 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 23:51:08,058 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 23:51:08,059 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 23:51:08,066 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 23:51:08,068 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 23:51:08,068 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 23:51:08,069 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 23:51:08,072 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 23:51:08,073 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 23:51:08,075 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 23:51:08,076 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 23:51:08,080 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 23:51:08,083 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 23:51:08,086 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 23:51:08,088 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 23:51:08,089 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 23:51:08,091 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 23:51:08,094 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 23:51:08,095 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 23:51:08,095 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 23:51:08,097 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 23:51:08,098 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 23:51:08,099 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 23:51:08,100 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 23:51:08,100 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 23:51:08,101 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 23:51:08,102 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 23:51:08,106 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 23:51:08,106 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 23:51:08,107 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 23:51:08,108 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 23:51:08,108 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 23:51:08,110 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 23:51:08,111 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 23:51:08,112 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-27 23:51:08,148 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 23:51:08,149 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 23:51:08,150 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 23:51:08,152 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 23:51:08,152 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 23:51:08,152 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 23:51:08,152 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 23:51:08,153 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 23:51:08,153 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 23:51:08,153 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 23:51:08,153 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 23:51:08,153 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 23:51:08,154 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-27 23:51:08,155 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-27 23:51:08,155 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 23:51:08,155 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 23:51:08,156 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 23:51:08,156 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 23:51:08,156 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 23:51:08,156 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 23:51:08,157 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 23:51:08,158 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 23:51:08,158 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 23:51:08,159 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 23:51:08,159 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 23:51:08,159 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 23:51:08,159 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-27 23:51:08,160 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-27 23:51:08,163 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 23:51:08,163 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-27 23:51:08,163 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> cd0c8f7b91fa815011541d5ffb41102d34132ba8 [2019-11-27 23:51:08,453 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 23:51:08,472 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 23:51:08,475 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 23:51:08,477 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 23:51:08,478 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 23:51:08,479 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1232a.c [2019-11-27 23:51:08,547 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55cc2a7cc/1f6aa125d8634ed78a99eb73c7d12b02/FLAG6c93e95af [2019-11-27 23:51:09,021 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 23:51:09,022 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1232a.c [2019-11-27 23:51:09,031 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55cc2a7cc/1f6aa125d8634ed78a99eb73c7d12b02/FLAG6c93e95af [2019-11-27 23:51:09,416 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55cc2a7cc/1f6aa125d8634ed78a99eb73c7d12b02 [2019-11-27 23:51:09,420 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 23:51:09,422 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 23:51:09,425 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 23:51:09,426 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 23:51:09,429 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 23:51:09,430 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:51:09" (1/1) ... [2019-11-27 23:51:09,433 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51c22218 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:51:09, skipping insertion in model container [2019-11-27 23:51:09,434 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:51:09" (1/1) ... [2019-11-27 23:51:09,442 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 23:51:09,472 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 23:51:09,704 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:51:09,712 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 23:51:09,800 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:51:09,829 INFO L208 MainTranslator]: Completed translation [2019-11-27 23:51:09,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:51:09 WrapperNode [2019-11-27 23:51:09,830 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 23:51:09,831 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 23:51:09,831 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 23:51:09,831 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 23:51:09,840 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:51:09" (1/1) ... [2019-11-27 23:51:09,851 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:51:09" (1/1) ... [2019-11-27 23:51:09,882 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 23:51:09,883 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 23:51:09,883 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 23:51:09,883 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 23:51:09,892 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:51:09" (1/1) ... [2019-11-27 23:51:09,892 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:51:09" (1/1) ... [2019-11-27 23:51:09,898 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:51:09" (1/1) ... [2019-11-27 23:51:09,899 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:51:09" (1/1) ... [2019-11-27 23:51:09,908 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:51:09" (1/1) ... [2019-11-27 23:51:09,914 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:51:09" (1/1) ... [2019-11-27 23:51:09,920 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:51:09" (1/1) ... [2019-11-27 23:51:09,926 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 23:51:09,927 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 23:51:09,927 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 23:51:09,927 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 23:51:09,928 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:51:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 23:51:09,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-27 23:51:09,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-27 23:51:09,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 23:51:09,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 23:51:09,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2019-11-27 23:51:09,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-27 23:51:10,374 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 23:51:10,374 INFO L297 CfgBuilder]: Removed 18 assume(true) statements. [2019-11-27 23:51:10,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:51:10 BoogieIcfgContainer [2019-11-27 23:51:10,376 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 23:51:10,378 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 23:51:10,378 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 23:51:10,387 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 23:51:10,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 11:51:09" (1/3) ... [2019-11-27 23:51:10,388 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20696992 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:51:10, skipping insertion in model container [2019-11-27 23:51:10,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:51:09" (2/3) ... [2019-11-27 23:51:10,389 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20696992 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:51:10, skipping insertion in model container [2019-11-27 23:51:10,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:51:10" (3/3) ... [2019-11-27 23:51:10,391 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1232a.c [2019-11-27 23:51:10,400 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 23:51:10,409 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 23:51:10,417 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 23:51:10,435 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 23:51:10,435 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 23:51:10,435 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 23:51:10,435 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 23:51:10,436 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 23:51:10,436 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 23:51:10,436 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 23:51:10,436 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 23:51:10,449 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2019-11-27 23:51:10,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-27 23:51:10,455 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:51:10,456 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:51:10,457 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:51:10,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:51:10,462 INFO L82 PathProgramCache]: Analyzing trace with hash -958075201, now seen corresponding path program 1 times [2019-11-27 23:51:10,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:51:10,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1941564168] [2019-11-27 23:51:10,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-11-27 23:51:10,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:51:10,562 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-27 23:51:10,566 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:51:10,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:51:10,578 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:51:10,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:51:10,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1941564168] [2019-11-27 23:51:10,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:51:10,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-27 23:51:10,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764539228] [2019-11-27 23:51:10,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-27 23:51:10,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:51:10,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-27 23:51:10,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-27 23:51:10,604 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2019-11-27 23:51:10,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:51:10,625 INFO L93 Difference]: Finished difference Result 62 states and 98 transitions. [2019-11-27 23:51:10,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-27 23:51:10,627 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-11-27 23:51:10,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:51:10,637 INFO L225 Difference]: With dead ends: 62 [2019-11-27 23:51:10,638 INFO L226 Difference]: Without dead ends: 29 [2019-11-27 23:51:10,641 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-27 23:51:10,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-27 23:51:10,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-11-27 23:51:10,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-27 23:51:10,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2019-11-27 23:51:10,678 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 10 [2019-11-27 23:51:10,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:51:10,678 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2019-11-27 23:51:10,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-27 23:51:10,679 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2019-11-27 23:51:10,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-27 23:51:10,680 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:51:10,680 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:51:10,892 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-27 23:51:10,893 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:51:10,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:51:10,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1001584898, now seen corresponding path program 1 times [2019-11-27 23:51:10,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:51:10,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1067441083] [2019-11-27 23:51:10,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-11-27 23:51:10,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:51:10,954 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-27 23:51:10,956 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:51:10,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:51:10,989 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:51:11,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:51:11,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1067441083] [2019-11-27 23:51:11,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:51:11,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-27 23:51:11,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552204531] [2019-11-27 23:51:11,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-27 23:51:11,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:51:11,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-27 23:51:11,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-27 23:51:11,020 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand 6 states. [2019-11-27 23:51:11,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:51:11,163 INFO L93 Difference]: Finished difference Result 68 states and 85 transitions. [2019-11-27 23:51:11,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-27 23:51:11,164 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-11-27 23:51:11,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:51:11,165 INFO L225 Difference]: With dead ends: 68 [2019-11-27 23:51:11,165 INFO L226 Difference]: Without dead ends: 59 [2019-11-27 23:51:11,167 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-27 23:51:11,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-27 23:51:11,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 31. [2019-11-27 23:51:11,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-27 23:51:11,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2019-11-27 23:51:11,174 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 11 [2019-11-27 23:51:11,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:51:11,175 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2019-11-27 23:51:11,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-27 23:51:11,175 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2019-11-27 23:51:11,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-27 23:51:11,176 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:51:11,177 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:51:11,398 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-27 23:51:11,398 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:51:11,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:51:11,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1219247017, now seen corresponding path program 1 times [2019-11-27 23:51:11,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:51:11,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [879576506] [2019-11-27 23:51:11,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-11-27 23:51:11,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:51:11,463 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-27 23:51:11,466 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:51:11,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:51:11,495 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:51:11,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:51:11,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [879576506] [2019-11-27 23:51:11,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:51:11,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-27 23:51:11,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247374064] [2019-11-27 23:51:11,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 23:51:11,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:51:11,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 23:51:11,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 23:51:11,525 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand 4 states. [2019-11-27 23:51:11,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:51:11,588 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions. [2019-11-27 23:51:11,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 23:51:11,589 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-27 23:51:11,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:51:11,590 INFO L225 Difference]: With dead ends: 52 [2019-11-27 23:51:11,590 INFO L226 Difference]: Without dead ends: 26 [2019-11-27 23:51:11,591 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-27 23:51:11,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-27 23:51:11,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-11-27 23:51:11,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-27 23:51:11,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2019-11-27 23:51:11,596 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 14 [2019-11-27 23:51:11,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:51:11,596 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2019-11-27 23:51:11,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 23:51:11,596 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2019-11-27 23:51:11,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-27 23:51:11,597 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:51:11,597 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:51:11,810 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-27 23:51:11,813 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:51:11,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:51:11,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1012446717, now seen corresponding path program 1 times [2019-11-27 23:51:11,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:51:11,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1641958090] [2019-11-27 23:51:11,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-11-27 23:51:11,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:51:11,894 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-27 23:51:11,895 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:51:11,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:51:11,912 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:51:11,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:51:11,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1641958090] [2019-11-27 23:51:11,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:51:11,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-27 23:51:11,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59086853] [2019-11-27 23:51:11,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-27 23:51:11,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:51:11,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-27 23:51:11,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-27 23:51:11,931 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand 6 states. [2019-11-27 23:51:12,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:51:12,025 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2019-11-27 23:51:12,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-27 23:51:12,026 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-27 23:51:12,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:51:12,027 INFO L225 Difference]: With dead ends: 61 [2019-11-27 23:51:12,027 INFO L226 Difference]: Without dead ends: 52 [2019-11-27 23:51:12,028 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-27 23:51:12,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-11-27 23:51:12,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 28. [2019-11-27 23:51:12,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-27 23:51:12,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2019-11-27 23:51:12,039 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 16 [2019-11-27 23:51:12,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:51:12,040 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2019-11-27 23:51:12,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-27 23:51:12,040 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2019-11-27 23:51:12,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-27 23:51:12,041 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:51:12,041 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:51:12,246 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-27 23:51:12,247 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:51:12,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:51:12,248 INFO L82 PathProgramCache]: Analyzing trace with hash -414082333, now seen corresponding path program 1 times [2019-11-27 23:51:12,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:51:12,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [571733881] [2019-11-27 23:51:12,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-11-27 23:51:12,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:51:12,321 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-27 23:51:12,323 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:51:12,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:51:12,347 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:51:12,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:51:12,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [571733881] [2019-11-27 23:51:12,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:51:12,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-27 23:51:12,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854833768] [2019-11-27 23:51:12,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 23:51:12,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:51:12,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 23:51:12,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 23:51:12,368 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand 4 states. [2019-11-27 23:51:12,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:51:12,381 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2019-11-27 23:51:12,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 23:51:12,382 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-27 23:51:12,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:51:12,383 INFO L225 Difference]: With dead ends: 38 [2019-11-27 23:51:12,383 INFO L226 Difference]: Without dead ends: 28 [2019-11-27 23:51:12,383 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 23:51:12,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-27 23:51:12,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-11-27 23:51:12,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-27 23:51:12,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2019-11-27 23:51:12,388 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 18 [2019-11-27 23:51:12,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:51:12,389 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2019-11-27 23:51:12,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 23:51:12,389 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2019-11-27 23:51:12,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-27 23:51:12,390 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:51:12,390 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:51:12,590 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-27 23:51:12,591 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:51:12,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:51:12,592 INFO L82 PathProgramCache]: Analyzing trace with hash -356824031, now seen corresponding path program 1 times [2019-11-27 23:51:12,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:51:12,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1863606103] [2019-11-27 23:51:12,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-11-27 23:51:12,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:51:12,668 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-27 23:51:12,669 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:51:12,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:51:12,710 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:51:12,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:12,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:51:12,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1863606103] [2019-11-27 23:51:12,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:51:12,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 9 [2019-11-27 23:51:12,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169332478] [2019-11-27 23:51:12,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-27 23:51:12,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:51:12,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-27 23:51:12,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-27 23:51:12,767 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand 9 states. [2019-11-27 23:51:12,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:51:12,882 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2019-11-27 23:51:12,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-27 23:51:12,884 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-11-27 23:51:12,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:51:12,885 INFO L225 Difference]: With dead ends: 40 [2019-11-27 23:51:12,887 INFO L226 Difference]: Without dead ends: 37 [2019-11-27 23:51:12,888 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-11-27 23:51:12,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-11-27 23:51:12,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2019-11-27 23:51:12,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-27 23:51:12,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2019-11-27 23:51:12,898 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 18 [2019-11-27 23:51:12,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:51:12,899 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2019-11-27 23:51:12,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-27 23:51:12,899 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2019-11-27 23:51:12,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-27 23:51:12,901 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:51:12,901 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:51:13,102 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-27 23:51:13,102 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:51:13,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:51:13,103 INFO L82 PathProgramCache]: Analyzing trace with hash -208358251, now seen corresponding path program 1 times [2019-11-27 23:51:13,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:51:13,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [210065976] [2019-11-27 23:51:13,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2019-11-27 23:51:13,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:51:13,186 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-27 23:51:13,188 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:51:13,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:51:13,220 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:51:13,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:51:13,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [210065976] [2019-11-27 23:51:13,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:51:13,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-27 23:51:13,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924306257] [2019-11-27 23:51:13,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 23:51:13,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:51:13,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 23:51:13,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 23:51:13,247 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 5 states. [2019-11-27 23:51:13,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:51:13,310 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2019-11-27 23:51:13,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 23:51:13,313 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-27 23:51:13,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:51:13,314 INFO L225 Difference]: With dead ends: 43 [2019-11-27 23:51:13,314 INFO L226 Difference]: Without dead ends: 23 [2019-11-27 23:51:13,315 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-27 23:51:13,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-11-27 23:51:13,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-11-27 23:51:13,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-27 23:51:13,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 22 transitions. [2019-11-27 23:51:13,319 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 22 transitions. Word has length 19 [2019-11-27 23:51:13,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:51:13,319 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 22 transitions. [2019-11-27 23:51:13,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 23:51:13,319 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 22 transitions. [2019-11-27 23:51:13,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-27 23:51:13,320 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:51:13,320 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:51:13,529 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-27 23:51:13,529 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:51:13,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:51:13,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1524231306, now seen corresponding path program 1 times [2019-11-27 23:51:13,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:51:13,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1169992071] [2019-11-27 23:51:13,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2019-11-27 23:51:13,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:51:13,615 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-27 23:51:13,617 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:51:13,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:13,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:51:13,720 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:51:13,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:13,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:51:13,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1169992071] [2019-11-27 23:51:13,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:51:13,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 16 [2019-11-27 23:51:13,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328215322] [2019-11-27 23:51:13,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-27 23:51:13,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:51:13,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-27 23:51:13,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-11-27 23:51:13,948 INFO L87 Difference]: Start difference. First operand 23 states and 22 transitions. Second operand 16 states. [2019-11-27 23:51:14,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:51:14,192 INFO L93 Difference]: Finished difference Result 23 states and 22 transitions. [2019-11-27 23:51:14,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-27 23:51:14,195 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-11-27 23:51:14,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:51:14,196 INFO L225 Difference]: With dead ends: 23 [2019-11-27 23:51:14,196 INFO L226 Difference]: Without dead ends: 0 [2019-11-27 23:51:14,197 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2019-11-27 23:51:14,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-27 23:51:14,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-27 23:51:14,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-27 23:51:14,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-27 23:51:14,198 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2019-11-27 23:51:14,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:51:14,198 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-27 23:51:14,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-27 23:51:14,198 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-27 23:51:14,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-27 23:51:14,402 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-27 23:51:14,404 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-27 23:51:14,643 INFO L246 CegarLoopResult]: For program point L69(line 69) no Hoare annotation was computed. [2019-11-27 23:51:14,644 INFO L246 CegarLoopResult]: For program point L36(lines 36 37) no Hoare annotation was computed. [2019-11-27 23:51:14,644 INFO L246 CegarLoopResult]: For program point L69-2(lines 69 72) no Hoare annotation was computed. [2019-11-27 23:51:14,644 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-27 23:51:14,644 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-27 23:51:14,645 INFO L242 CegarLoopResult]: At program point L53(lines 44 54) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 8 24)))) (and (= .cse0 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0))) (= ULTIMATE.start_fmin_float_~x (_ +zero 8 24)) (= .cse0 ULTIMATE.start___fpclassify_float_~x) (= ULTIMATE.start_main_~res~0 .cse0) |ULTIMATE.start_main_#t~short9| (= |ULTIMATE.start_fmin_float_#res| .cse0) (= (_ bv0 32) (bvadd |ULTIMATE.start___signbit_float_#res| (_ bv4294967295 32))) (= (fp ((_ extract 31 31) ULTIMATE.start___signbit_float_~w~1) ((_ extract 30 23) ULTIMATE.start___signbit_float_~w~1) ((_ extract 22 0) ULTIMATE.start___signbit_float_~w~1)) .cse0) (= ULTIMATE.start___signbit_float_~x .cse0) (= ULTIMATE.start_fmin_float_~y .cse0))) [2019-11-27 23:51:14,645 INFO L246 CegarLoopResult]: For program point L70(line 70) no Hoare annotation was computed. [2019-11-27 23:51:14,645 INFO L246 CegarLoopResult]: For program point L29(lines 29 32) no Hoare annotation was computed. [2019-11-27 23:51:14,645 INFO L246 CegarLoopResult]: For program point L29-1(lines 29 32) no Hoare annotation was computed. [2019-11-27 23:51:14,645 INFO L246 CegarLoopResult]: For program point L38(lines 38 39) no Hoare annotation was computed. [2019-11-27 23:51:14,646 INFO L246 CegarLoopResult]: For program point L47-1(lines 47 51) no Hoare annotation was computed. [2019-11-27 23:51:14,646 INFO L242 CegarLoopResult]: At program point L47-2(lines 47 51) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 8 24)))) (and (= .cse0 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0))) (= ULTIMATE.start_fmin_float_~x (_ +zero 8 24)) (= .cse0 ULTIMATE.start___fpclassify_float_~x) (= ULTIMATE.start_main_~res~0 .cse0) |ULTIMATE.start_main_#t~short9| (= |ULTIMATE.start_fmin_float_#res| .cse0) (= ULTIMATE.start___signbit_float_~x .cse0) (= ULTIMATE.start_fmin_float_~y .cse0))) [2019-11-27 23:51:14,646 INFO L246 CegarLoopResult]: For program point L47-3(lines 47 51) no Hoare annotation was computed. [2019-11-27 23:51:14,646 INFO L246 CegarLoopResult]: For program point L23(lines 23 32) no Hoare annotation was computed. [2019-11-27 23:51:14,646 INFO L246 CegarLoopResult]: For program point L23-1(lines 23 32) no Hoare annotation was computed. [2019-11-27 23:51:14,646 INFO L246 CegarLoopResult]: For program point L15-1(lines 15 19) no Hoare annotation was computed. [2019-11-27 23:51:14,646 INFO L242 CegarLoopResult]: At program point L15-2(lines 15 19) the Hoare annotation is: (and (= ULTIMATE.start_fmin_float_~x (_ +zero 8 24)) (= (_ +zero 8 24) ULTIMATE.start___fpclassify_float_~x) (= ULTIMATE.start_fmin_float_~y (fp.neg (_ +zero 8 24)))) [2019-11-27 23:51:14,647 INFO L246 CegarLoopResult]: For program point L15-3(lines 12 33) no Hoare annotation was computed. [2019-11-27 23:51:14,647 INFO L246 CegarLoopResult]: For program point L15-5(lines 15 19) no Hoare annotation was computed. [2019-11-27 23:51:14,647 INFO L242 CegarLoopResult]: At program point L15-6(lines 15 19) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 8 24)))) (and (= ULTIMATE.start_fmin_float_~x (_ +zero 8 24)) (= .cse0 ULTIMATE.start___fpclassify_float_~x) (= ULTIMATE.start_fmin_float_~y .cse0))) [2019-11-27 23:51:14,647 INFO L246 CegarLoopResult]: For program point L15-7(lines 12 33) no Hoare annotation was computed. [2019-11-27 23:51:14,647 INFO L242 CegarLoopResult]: At program point L32(lines 12 33) the Hoare annotation is: (and (= (_ +zero 8 24) (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0))) (= ULTIMATE.start_fmin_float_~x (_ +zero 8 24)) (= (_ +zero 8 24) ULTIMATE.start___fpclassify_float_~x) (= (_ bv2 32) |ULTIMATE.start___fpclassify_float_#res|) (= ULTIMATE.start_fmin_float_~y (fp.neg (_ +zero 8 24)))) [2019-11-27 23:51:14,647 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-27 23:51:14,648 INFO L242 CegarLoopResult]: At program point L32-1(lines 12 33) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 8 24)))) (and (= .cse0 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0))) (= ULTIMATE.start_fmin_float_~x (_ +zero 8 24)) (not (= (_ bv0 32) |ULTIMATE.start___fpclassify_float_#res|)) (= .cse0 ULTIMATE.start___fpclassify_float_~x) (= ULTIMATE.start_fmin_float_~y .cse0))) [2019-11-27 23:51:14,648 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 70) no Hoare annotation was computed. [2019-11-27 23:51:14,648 INFO L249 CegarLoopResult]: At program point L74(lines 56 75) the Hoare annotation is: true [2019-11-27 23:51:14,648 INFO L246 CegarLoopResult]: For program point L41(line 41) no Hoare annotation was computed. [2019-11-27 23:51:14,648 INFO L246 CegarLoopResult]: For program point L41-2(line 41) no Hoare annotation was computed. [2019-11-27 23:51:14,649 INFO L242 CegarLoopResult]: At program point L41-3(lines 35 42) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 8 24)))) (and (= .cse0 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0))) (= ULTIMATE.start_fmin_float_~x (_ +zero 8 24)) (= .cse0 ULTIMATE.start___fpclassify_float_~x) (= |ULTIMATE.start_fmin_float_#res| .cse0) (= ULTIMATE.start_fmin_float_~y .cse0))) [2019-11-27 23:51:14,649 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-27 23:51:14,649 INFO L246 CegarLoopResult]: For program point L26(lines 26 32) no Hoare annotation was computed. [2019-11-27 23:51:14,649 INFO L246 CegarLoopResult]: For program point L26-1(lines 26 32) no Hoare annotation was computed. [2019-11-27 23:51:14,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 11:51:14 BoogieIcfgContainer [2019-11-27 23:51:14,671 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 23:51:14,671 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 23:51:14,671 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 23:51:14,672 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 23:51:14,672 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:51:10" (3/4) ... [2019-11-27 23:51:14,676 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-27 23:51:14,688 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2019-11-27 23:51:14,689 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-11-27 23:51:14,690 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-27 23:51:14,723 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]) && x == ~Pluszero~LONGDOUBLE()) && ~Pluszero~LONGDOUBLE() == x) && 2bv32 == \result) && y == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) [2019-11-27 23:51:14,723 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]) && x == ~Pluszero~LONGDOUBLE()) && ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) == x) && \result == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE())) && y == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) [2019-11-27 23:51:14,725 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]) && x == ~Pluszero~LONGDOUBLE()) && ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) == x) && res == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE())) && aux-res == -0.0f && __signbit_float(res) == 1-aux) && \result == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE())) && x == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE())) && y == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) [2019-11-27 23:51:14,725 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]) && x == ~Pluszero~LONGDOUBLE()) && !(0bv32 == \result)) && ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) == x) && y == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) [2019-11-27 23:51:14,726 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]) && x == ~Pluszero~LONGDOUBLE()) && ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) == x) && res == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE())) && aux-res == -0.0f && __signbit_float(res) == 1-aux) && \result == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE())) && 0bv32 == ~bvadd64(\result, 4294967295bv32)) && ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]) == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE())) && x == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE())) && y == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) [2019-11-27 23:51:14,762 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 23:51:14,762 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 23:51:14,765 INFO L168 Benchmark]: Toolchain (without parser) took 5342.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 952.3 MB in the beginning and 837.3 MB in the end (delta: 115.1 MB). Peak memory consumption was 259.8 MB. Max. memory is 11.5 GB. [2019-11-27 23:51:14,765 INFO L168 Benchmark]: CDTParser took 0.34 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 23:51:14,766 INFO L168 Benchmark]: CACSL2BoogieTranslator took 404.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -175.9 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-11-27 23:51:14,766 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.18 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 23:51:14,767 INFO L168 Benchmark]: Boogie Preprocessor took 43.36 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 23:51:14,767 INFO L168 Benchmark]: RCFGBuilder took 449.91 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: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2019-11-27 23:51:14,768 INFO L168 Benchmark]: TraceAbstraction took 4293.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 843.8 MB in the end (delta: 260.2 MB). Peak memory consumption was 260.2 MB. Max. memory is 11.5 GB. [2019-11-27 23:51:14,768 INFO L168 Benchmark]: Witness Printer took 91.12 ms. Allocated memory is still 1.2 GB. Free memory was 843.8 MB in the beginning and 837.3 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-27 23:51:14,771 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.34 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 404.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -175.9 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.18 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.36 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 449.91 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: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4293.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 843.8 MB in the end (delta: 260.2 MB). Peak memory consumption was 260.2 MB. Max. memory is 11.5 GB. * Witness Printer took 91.12 ms. Allocated memory is still 1.2 GB. Free memory was 843.8 MB in the beginning and 837.3 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 70]: 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: 12]: Loop Invariant Derived loop invariant: (((~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]) && x == ~Pluszero~LONGDOUBLE()) && !(0bv32 == \result)) && ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) == x) && y == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 44]: Loop Invariant Derived loop invariant: ((((((((~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]) && x == ~Pluszero~LONGDOUBLE()) && ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) == x) && res == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE())) && aux-res == -0.0f && __signbit_float(res) == 1-aux) && \result == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE())) && 0bv32 == ~bvadd64(\result, 4294967295bv32)) && ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]) == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE())) && x == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE())) && y == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: (((~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]) && x == ~Pluszero~LONGDOUBLE()) && ~Pluszero~LONGDOUBLE() == x) && 2bv32 == \result) && y == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: (((~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]) && x == ~Pluszero~LONGDOUBLE()) && ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) == x) && \result == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE())) && y == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: (x == ~Pluszero~LONGDOUBLE() && ~Pluszero~LONGDOUBLE() == x) && y == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: ((((((~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]) && x == ~Pluszero~LONGDOUBLE()) && ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) == x) && res == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE())) && aux-res == -0.0f && __signbit_float(res) == 1-aux) && \result == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE())) && x == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE())) && y == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: (x == ~Pluszero~LONGDOUBLE() && ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) == x) && y == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 32 locations, 1 error locations. Result: SAFE, OverallTime: 3.9s, OverallIterations: 8, TraceHistogramMax: 1, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, HoareTripleCheckerStatistics: 234 SDtfs, 215 SDslu, 432 SDs, 0 SdLazy, 153 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 257 GetRequests, 197 SyntacticMatches, 7 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 59 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 16 NumberOfFragments, 184 HoareAnnotationTreeSize, 8 FomulaSimplifications, 48 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 4 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 128 NumberOfCodeBlocks, 128 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 240 ConstructedInterpolants, 15 QuantifiedInterpolants, 16152 SizeOfPredicates, 38 NumberOfNonLiveVariables, 399 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...