./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_1300.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -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/double_req_bl_1300.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 ee5ae4bbae935ee4fc29ea9e50ac81dc390a543f ........................................................................................................................................................................................................................................................................................................................................................................................................................... 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 -ea -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/double_req_bl_1300.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 ee5ae4bbae935ee4fc29ea9e50ac81dc390a543f .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 17:43:43,301 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 17:43:43,304 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 17:43:43,325 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 17:43:43,326 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 17:43:43,328 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 17:43:43,331 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 17:43:43,343 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 17:43:43,349 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 17:43:43,353 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 17:43:43,356 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 17:43:43,358 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 17:43:43,358 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 17:43:43,361 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 17:43:43,363 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 17:43:43,364 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 17:43:43,366 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 17:43:43,368 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 17:43:43,372 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 17:43:43,377 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 17:43:43,382 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 17:43:43,386 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 17:43:43,389 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 17:43:43,390 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 17:43:43,393 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 17:43:43,393 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 17:43:43,393 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 17:43:43,395 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 17:43:43,396 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 17:43:43,397 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 17:43:43,398 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 17:43:43,399 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 17:43:43,400 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 17:43:43,401 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 17:43:43,402 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 17:43:43,403 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 17:43:43,404 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 17:43:43,404 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 17:43:43,404 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 17:43:43,405 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 17:43:43,407 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 17:43:43,408 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-28 17:43:43,442 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 17:43:43,443 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 17:43:43,444 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 17:43:43,445 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 17:43:43,445 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 17:43:43,445 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 17:43:43,446 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 17:43:43,446 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 17:43:43,446 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 17:43:43,447 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 17:43:43,447 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 17:43:43,447 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 17:43:43,447 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 17:43:43,448 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 17:43:43,448 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 17:43:43,448 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 17:43:43,448 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 17:43:43,449 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 17:43:43,449 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 17:43:43,449 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 17:43:43,450 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 17:43:43,450 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 17:43:43,450 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 17:43:43,451 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 17:43:43,451 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 17:43:43,451 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 17:43:43,451 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 17:43:43,452 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 17:43:43,452 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 17:43:43,452 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 -> ee5ae4bbae935ee4fc29ea9e50ac81dc390a543f [2020-07-28 17:43:43,813 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 17:43:43,828 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 17:43:43,831 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 17:43:43,833 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 17:43:43,834 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 17:43:43,835 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1300.c [2020-07-28 17:43:43,902 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57d399e95/2fa0038a04f8466bae5851f39e726f75/FLAG0950bdfe6 [2020-07-28 17:43:44,375 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 17:43:44,376 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1300.c [2020-07-28 17:43:44,385 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57d399e95/2fa0038a04f8466bae5851f39e726f75/FLAG0950bdfe6 [2020-07-28 17:43:44,737 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57d399e95/2fa0038a04f8466bae5851f39e726f75 [2020-07-28 17:43:44,740 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 17:43:44,744 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 17:43:44,745 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 17:43:44,745 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 17:43:44,749 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 17:43:44,751 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:43:44" (1/1) ... [2020-07-28 17:43:44,754 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e71c8b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:43:44, skipping insertion in model container [2020-07-28 17:43:44,754 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:43:44" (1/1) ... [2020-07-28 17:43:44,763 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 17:43:44,788 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 17:43:44,983 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:43:44,987 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 17:43:45,017 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:43:45,108 INFO L208 MainTranslator]: Completed translation [2020-07-28 17:43:45,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:43:45 WrapperNode [2020-07-28 17:43:45,109 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 17:43:45,110 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 17:43:45,111 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 17:43:45,111 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 17:43:45,121 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:43:45" (1/1) ... [2020-07-28 17:43:45,132 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:43:45" (1/1) ... [2020-07-28 17:43:45,169 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 17:43:45,170 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 17:43:45,170 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 17:43:45,170 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 17:43:45,178 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:43:45" (1/1) ... [2020-07-28 17:43:45,179 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:43:45" (1/1) ... [2020-07-28 17:43:45,181 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:43:45" (1/1) ... [2020-07-28 17:43:45,181 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:43:45" (1/1) ... [2020-07-28 17:43:45,192 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:43:45" (1/1) ... [2020-07-28 17:43:45,198 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:43:45" (1/1) ... [2020-07-28 17:43:45,200 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:43:45" (1/1) ... [2020-07-28 17:43:45,203 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 17:43:45,203 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 17:43:45,203 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 17:43:45,203 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 17:43:45,204 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:43:45" (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 [2020-07-28 17:43:45,279 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-28 17:43:45,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-07-28 17:43:45,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 17:43:45,280 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 17:43:45,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-28 17:43:45,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-28 17:43:45,719 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 17:43:45,719 INFO L295 CfgBuilder]: Removed 14 assume(true) statements. [2020-07-28 17:43:45,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:43:45 BoogieIcfgContainer [2020-07-28 17:43:45,729 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 17:43:45,730 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 17:43:45,730 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 17:43:45,733 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 17:43:45,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 05:43:44" (1/3) ... [2020-07-28 17:43:45,744 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@684d2794 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:43:45, skipping insertion in model container [2020-07-28 17:43:45,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:43:45" (2/3) ... [2020-07-28 17:43:45,745 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@684d2794 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:43:45, skipping insertion in model container [2020-07-28 17:43:45,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:43:45" (3/3) ... [2020-07-28 17:43:45,746 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1300.c [2020-07-28 17:43:45,756 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 17:43:45,763 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 17:43:45,777 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 17:43:45,802 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 17:43:45,802 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 17:43:45,803 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 17:43:45,803 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 17:43:45,803 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 17:43:45,804 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 17:43:45,804 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 17:43:45,804 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 17:43:45,819 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2020-07-28 17:43:45,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-28 17:43:45,824 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:43:45,825 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:43:45,826 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:43:45,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:43:45,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1033094394, now seen corresponding path program 1 times [2020-07-28 17:43:45,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:43:45,842 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832011053] [2020-07-28 17:43:45,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:43:45,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:43:45,989 INFO L280 TraceCheckUtils]: 0: Hoare triple {23#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {23#true} is VALID [2020-07-28 17:43:45,991 INFO L280 TraceCheckUtils]: 1: Hoare triple {23#true} havoc main_#res;havoc main_#t~nondet6, main_#t~ret7, main_#t~ret8, main_#t~short9, main_#t~ret10, main_~res~0, main_~x~0;main_~x~0 := main_#t~nondet6;havoc main_#t~nondet6;isinf_double_#in~x := main_~x~0;havoc isinf_double_#res;havoc isinf_double_#t~mem0, isinf_double_#t~union1, isinf_double_#t~mem2, isinf_double_#t~union3, isinf_double_~#ew_u~0.base, isinf_double_~#ew_u~0.offset, isinf_double_~x, isinf_double_~hx~0, isinf_double_~lx~0;isinf_double_~x := isinf_double_#in~x;havoc isinf_double_~hx~0;havoc isinf_double_~lx~0; {23#true} is VALID [2020-07-28 17:43:45,996 INFO L280 TraceCheckUtils]: 2: Hoare triple {23#true} assume !true; {24#false} is VALID [2020-07-28 17:43:45,997 INFO L280 TraceCheckUtils]: 3: Hoare triple {24#false} isinf_double_~hx~0 := ~bitwiseAnd(isinf_double_~hx~0, 2147483647);isinf_double_~hx~0 := (if ~bitwiseOr(isinf_double_~hx~0, ~bitwiseOr(isinf_double_~lx~0, -isinf_double_~lx~0) / 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(isinf_double_~hx~0, ~bitwiseOr(isinf_double_~lx~0, -isinf_double_~lx~0) / 2147483648) % 4294967296 % 4294967296 else ~bitwiseOr(isinf_double_~hx~0, ~bitwiseOr(isinf_double_~lx~0, -isinf_double_~lx~0) / 2147483648) % 4294967296 % 4294967296 - 4294967296);isinf_double_~hx~0 := 2146435072 - isinf_double_~hx~0;isinf_double_#res := 1 - (if ~bitwiseOr(isinf_double_~hx~0, -isinf_double_~hx~0) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(isinf_double_~hx~0, -isinf_double_~hx~0) / 2147483648 % 4294967296 % 4294967296 else ~bitwiseOr(isinf_double_~hx~0, -isinf_double_~hx~0) / 2147483648 % 4294967296 % 4294967296 - 4294967296); {24#false} is VALID [2020-07-28 17:43:45,997 INFO L280 TraceCheckUtils]: 4: Hoare triple {24#false} main_#t~ret7 := isinf_double_#res;assume -2147483648 <= main_#t~ret7 && main_#t~ret7 <= 2147483647;main_#t~short9 := 0 == main_#t~ret7; {24#false} is VALID [2020-07-28 17:43:45,998 INFO L280 TraceCheckUtils]: 5: Hoare triple {24#false} assume !main_#t~short9; {24#false} is VALID [2020-07-28 17:43:45,998 INFO L280 TraceCheckUtils]: 6: Hoare triple {24#false} assume main_#t~short9;havoc main_#t~short9;havoc main_#t~ret8;havoc main_#t~ret7;isfinite_double_#in~x := main_~x~0;havoc isfinite_double_#res;havoc isfinite_double_#t~mem4, isfinite_double_#t~union5, isfinite_double_~#gh_u~0.base, isfinite_double_~#gh_u~0.offset, isfinite_double_~x, isfinite_double_~hx~1;isfinite_double_~x := isfinite_double_#in~x;havoc isfinite_double_~hx~1; {24#false} is VALID [2020-07-28 17:43:45,998 INFO L280 TraceCheckUtils]: 7: Hoare triple {24#false} assume !true; {24#false} is VALID [2020-07-28 17:43:45,999 INFO L280 TraceCheckUtils]: 8: Hoare triple {24#false} isfinite_double_#res := (if (~bitwiseAnd(isfinite_double_~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then (~bitwiseAnd(isfinite_double_~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 else (~bitwiseAnd(isfinite_double_~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 - 4294967296); {24#false} is VALID [2020-07-28 17:43:45,999 INFO L280 TraceCheckUtils]: 9: Hoare triple {24#false} main_#t~ret10 := isfinite_double_#res;assume -2147483648 <= main_#t~ret10 && main_#t~ret10 <= 2147483647;main_~res~0 := ~convertINTToDOUBLE(main_#t~ret10);havoc main_#t~ret10; {24#false} is VALID [2020-07-28 17:43:45,999 INFO L280 TraceCheckUtils]: 10: Hoare triple {24#false} assume ~someBinaryDOUBLEComparisonOperation(main_~res~0, 0.0); {24#false} is VALID [2020-07-28 17:43:46,000 INFO L280 TraceCheckUtils]: 11: Hoare triple {24#false} assume !false; {24#false} is VALID [2020-07-28 17:43:46,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:43:46,007 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832011053] [2020-07-28 17:43:46,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:43:46,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-28 17:43:46,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159142448] [2020-07-28 17:43:46,017 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2020-07-28 17:43:46,020 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:43:46,023 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 17:43:46,083 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:43:46,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 17:43:46,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 17:43:46,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 17:43:46,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 17:43:46,097 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2020-07-28 17:43:46,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:43:46,176 INFO L93 Difference]: Finished difference Result 38 states and 50 transitions. [2020-07-28 17:43:46,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 17:43:46,177 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2020-07-28 17:43:46,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:43:46,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:43:46,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 50 transitions. [2020-07-28 17:43:46,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:43:46,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 50 transitions. [2020-07-28 17:43:46,196 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 50 transitions. [2020-07-28 17:43:46,300 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:43:46,312 INFO L225 Difference]: With dead ends: 38 [2020-07-28 17:43:46,313 INFO L226 Difference]: Without dead ends: 16 [2020-07-28 17:43:46,317 INFO L675 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 [2020-07-28 17:43:46,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-07-28 17:43:46,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-07-28 17:43:46,354 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:43:46,355 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2020-07-28 17:43:46,356 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2020-07-28 17:43:46,356 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2020-07-28 17:43:46,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:43:46,360 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2020-07-28 17:43:46,360 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2020-07-28 17:43:46,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:43:46,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:43:46,361 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2020-07-28 17:43:46,362 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2020-07-28 17:43:46,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:43:46,364 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2020-07-28 17:43:46,364 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2020-07-28 17:43:46,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:43:46,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:43:46,366 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:43:46,366 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:43:46,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-28 17:43:46,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2020-07-28 17:43:46,370 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 12 [2020-07-28 17:43:46,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:43:46,371 INFO L479 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2020-07-28 17:43:46,371 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 17:43:46,371 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2020-07-28 17:43:46,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-28 17:43:46,372 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:43:46,372 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:43:46,373 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 17:43:46,373 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:43:46,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:43:46,373 INFO L82 PathProgramCache]: Analyzing trace with hash 499625812, now seen corresponding path program 1 times [2020-07-28 17:43:46,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:43:46,374 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910475315] [2020-07-28 17:43:46,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:43:46,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:43:46,528 INFO L280 TraceCheckUtils]: 0: Hoare triple {130#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {130#true} is VALID [2020-07-28 17:43:46,529 INFO L280 TraceCheckUtils]: 1: Hoare triple {130#true} havoc main_#res;havoc main_#t~nondet6, main_#t~ret7, main_#t~ret8, main_#t~short9, main_#t~ret10, main_~res~0, main_~x~0;main_~x~0 := main_#t~nondet6;havoc main_#t~nondet6;isinf_double_#in~x := main_~x~0;havoc isinf_double_#res;havoc isinf_double_#t~mem0, isinf_double_#t~union1, isinf_double_#t~mem2, isinf_double_#t~union3, isinf_double_~#ew_u~0.base, isinf_double_~#ew_u~0.offset, isinf_double_~x, isinf_double_~hx~0, isinf_double_~lx~0;isinf_double_~x := isinf_double_#in~x;havoc isinf_double_~hx~0;havoc isinf_double_~lx~0; {130#true} is VALID [2020-07-28 17:43:46,530 INFO L280 TraceCheckUtils]: 2: Hoare triple {130#true} call isinf_double_~#ew_u~0.base, isinf_double_~#ew_u~0.offset := #Ultimate.allocOnStack(8);call write~real(isinf_double_~x, isinf_double_~#ew_u~0.base, isinf_double_~#ew_u~0.offset, 8);call isinf_double_#t~mem0 := read~int(isinf_double_~#ew_u~0.base, 4 + isinf_double_~#ew_u~0.offset, 4);isinf_double_~hx~0 := (if isinf_double_#t~mem0 % 4294967296 % 4294967296 <= 2147483647 then isinf_double_#t~mem0 % 4294967296 % 4294967296 else isinf_double_#t~mem0 % 4294967296 % 4294967296 - 4294967296);call write~real(isinf_double_#t~union1, isinf_double_~#ew_u~0.base, isinf_double_~#ew_u~0.offset, 8);havoc isinf_double_#t~mem0;havoc isinf_double_#t~union1;call isinf_double_#t~mem2 := read~int(isinf_double_~#ew_u~0.base, isinf_double_~#ew_u~0.offset, 4);isinf_double_~lx~0 := (if isinf_double_#t~mem2 % 4294967296 % 4294967296 <= 2147483647 then isinf_double_#t~mem2 % 4294967296 % 4294967296 else isinf_double_#t~mem2 % 4294967296 % 4294967296 - 4294967296);call write~real(isinf_double_#t~union3, isinf_double_~#ew_u~0.base, isinf_double_~#ew_u~0.offset, 8);havoc isinf_double_#t~union3;havoc isinf_double_#t~mem2;call ULTIMATE.dealloc(isinf_double_~#ew_u~0.base, isinf_double_~#ew_u~0.offset);havoc isinf_double_~#ew_u~0.base, isinf_double_~#ew_u~0.offset; {130#true} is VALID [2020-07-28 17:43:46,530 INFO L280 TraceCheckUtils]: 3: Hoare triple {130#true} goto; {130#true} is VALID [2020-07-28 17:43:46,530 INFO L280 TraceCheckUtils]: 4: Hoare triple {130#true} isinf_double_~hx~0 := ~bitwiseAnd(isinf_double_~hx~0, 2147483647);isinf_double_~hx~0 := (if ~bitwiseOr(isinf_double_~hx~0, ~bitwiseOr(isinf_double_~lx~0, -isinf_double_~lx~0) / 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(isinf_double_~hx~0, ~bitwiseOr(isinf_double_~lx~0, -isinf_double_~lx~0) / 2147483648) % 4294967296 % 4294967296 else ~bitwiseOr(isinf_double_~hx~0, ~bitwiseOr(isinf_double_~lx~0, -isinf_double_~lx~0) / 2147483648) % 4294967296 % 4294967296 - 4294967296);isinf_double_~hx~0 := 2146435072 - isinf_double_~hx~0;isinf_double_#res := 1 - (if ~bitwiseOr(isinf_double_~hx~0, -isinf_double_~hx~0) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(isinf_double_~hx~0, -isinf_double_~hx~0) / 2147483648 % 4294967296 % 4294967296 else ~bitwiseOr(isinf_double_~hx~0, -isinf_double_~hx~0) / 2147483648 % 4294967296 % 4294967296 - 4294967296); {130#true} is VALID [2020-07-28 17:43:46,531 INFO L280 TraceCheckUtils]: 5: Hoare triple {130#true} main_#t~ret7 := isinf_double_#res;assume -2147483648 <= main_#t~ret7 && main_#t~ret7 <= 2147483647;main_#t~short9 := 0 == main_#t~ret7; {130#true} is VALID [2020-07-28 17:43:46,532 INFO L280 TraceCheckUtils]: 6: Hoare triple {130#true} assume !main_#t~short9; {132#(not |ULTIMATE.start_main_#t~short9|)} is VALID [2020-07-28 17:43:46,533 INFO L280 TraceCheckUtils]: 7: Hoare triple {132#(not |ULTIMATE.start_main_#t~short9|)} assume main_#t~short9;havoc main_#t~short9;havoc main_#t~ret8;havoc main_#t~ret7;isfinite_double_#in~x := main_~x~0;havoc isfinite_double_#res;havoc isfinite_double_#t~mem4, isfinite_double_#t~union5, isfinite_double_~#gh_u~0.base, isfinite_double_~#gh_u~0.offset, isfinite_double_~x, isfinite_double_~hx~1;isfinite_double_~x := isfinite_double_#in~x;havoc isfinite_double_~hx~1; {131#false} is VALID [2020-07-28 17:43:46,533 INFO L280 TraceCheckUtils]: 8: Hoare triple {131#false} call isfinite_double_~#gh_u~0.base, isfinite_double_~#gh_u~0.offset := #Ultimate.allocOnStack(8);call write~real(isfinite_double_~x, isfinite_double_~#gh_u~0.base, isfinite_double_~#gh_u~0.offset, 8);call isfinite_double_#t~mem4 := read~int(isfinite_double_~#gh_u~0.base, 4 + isfinite_double_~#gh_u~0.offset, 4);isfinite_double_~hx~1 := (if isfinite_double_#t~mem4 % 4294967296 % 4294967296 <= 2147483647 then isfinite_double_#t~mem4 % 4294967296 % 4294967296 else isfinite_double_#t~mem4 % 4294967296 % 4294967296 - 4294967296);call write~real(isfinite_double_#t~union5, isfinite_double_~#gh_u~0.base, isfinite_double_~#gh_u~0.offset, 8);havoc isfinite_double_#t~union5;havoc isfinite_double_#t~mem4;call ULTIMATE.dealloc(isfinite_double_~#gh_u~0.base, isfinite_double_~#gh_u~0.offset);havoc isfinite_double_~#gh_u~0.base, isfinite_double_~#gh_u~0.offset; {131#false} is VALID [2020-07-28 17:43:46,533 INFO L280 TraceCheckUtils]: 9: Hoare triple {131#false} goto; {131#false} is VALID [2020-07-28 17:43:46,534 INFO L280 TraceCheckUtils]: 10: Hoare triple {131#false} isfinite_double_#res := (if (~bitwiseAnd(isfinite_double_~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then (~bitwiseAnd(isfinite_double_~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 else (~bitwiseAnd(isfinite_double_~hx~1, 2147483647) - 2146435072) / 2147483648 % 4294967296 % 4294967296 - 4294967296); {131#false} is VALID [2020-07-28 17:43:46,534 INFO L280 TraceCheckUtils]: 11: Hoare triple {131#false} main_#t~ret10 := isfinite_double_#res;assume -2147483648 <= main_#t~ret10 && main_#t~ret10 <= 2147483647;main_~res~0 := ~convertINTToDOUBLE(main_#t~ret10);havoc main_#t~ret10; {131#false} is VALID [2020-07-28 17:43:46,534 INFO L280 TraceCheckUtils]: 12: Hoare triple {131#false} assume ~someBinaryDOUBLEComparisonOperation(main_~res~0, 0.0); {131#false} is VALID [2020-07-28 17:43:46,535 INFO L280 TraceCheckUtils]: 13: Hoare triple {131#false} assume !false; {131#false} is VALID [2020-07-28 17:43:46,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:43:46,536 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910475315] [2020-07-28 17:43:46,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:43:46,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-28 17:43:46,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116207030] [2020-07-28 17:43:46,539 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2020-07-28 17:43:46,539 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:43:46,540 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-28 17:43:46,564 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:43:46,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-28 17:43:46,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 17:43:46,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-28 17:43:46,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 17:43:46,566 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 3 states. [2020-07-28 17:43:46,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:43:46,617 INFO L93 Difference]: Finished difference Result 24 states and 23 transitions. [2020-07-28 17:43:46,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-28 17:43:46,618 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2020-07-28 17:43:46,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:43:46,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 17:43:46,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2020-07-28 17:43:46,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 17:43:46,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2020-07-28 17:43:46,621 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 23 transitions. [2020-07-28 17:43:46,658 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:43:46,659 INFO L225 Difference]: With dead ends: 24 [2020-07-28 17:43:46,659 INFO L226 Difference]: Without dead ends: 16 [2020-07-28 17:43:46,660 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 17:43:46,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-07-28 17:43:46,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-07-28 17:43:46,669 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:43:46,669 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2020-07-28 17:43:46,669 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2020-07-28 17:43:46,670 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2020-07-28 17:43:46,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:43:46,672 INFO L93 Difference]: Finished difference Result 16 states and 15 transitions. [2020-07-28 17:43:46,672 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 15 transitions. [2020-07-28 17:43:46,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:43:46,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:43:46,673 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2020-07-28 17:43:46,673 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2020-07-28 17:43:46,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:43:46,675 INFO L93 Difference]: Finished difference Result 16 states and 15 transitions. [2020-07-28 17:43:46,675 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 15 transitions. [2020-07-28 17:43:46,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:43:46,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:43:46,676 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:43:46,677 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:43:46,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-28 17:43:46,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 15 transitions. [2020-07-28 17:43:46,678 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 15 transitions. Word has length 14 [2020-07-28 17:43:46,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:43:46,679 INFO L479 AbstractCegarLoop]: Abstraction has 16 states and 15 transitions. [2020-07-28 17:43:46,679 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-28 17:43:46,680 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 15 transitions. [2020-07-28 17:43:46,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-28 17:43:46,680 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:43:46,681 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:43:46,681 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-28 17:43:46,681 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:43:46,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:43:46,682 INFO L82 PathProgramCache]: Analyzing trace with hash 2210040, now seen corresponding path program 1 times [2020-07-28 17:43:46,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:43:46,683 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082676204] [2020-07-28 17:43:46,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:43:46,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 17:43:46,822 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 17:43:46,894 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-28 17:43:46,895 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.TableauxRow.(TableauxRow.java:45) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.generateLinVar(LinArSolve.java:275) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.createEquality(LinArSolve.java:1974) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.createLAEquality(EqualityProxy.java:83) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.createAtom(EqualityProxy.java:165) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.getLiteral(EqualityProxy.java:186) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.createCCEquality(EqualityProxy.java:109) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.mbtc(LinArSolve.java:1891) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.computeConflictClause(LinArSolve.java:664) at de.uni_freiburg.informatik.ultimate.smtinterpol.dpll.DPLLEngine.checkConsistency(DPLLEngine.java:1010) at de.uni_freiburg.informatik.ultimate.smtinterpol.dpll.DPLLEngine.solve(DPLLEngine.java:1157) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol$CheckType$1.check(SMTInterpol.java:117) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.checkSatAssuming(SMTInterpol.java:494) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.checkSat(SMTInterpol.java:446) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.AnnotateAndAsserter.buildAnnotatedSsaAndAssertTerms(AnnotateAndAsserter.java:130) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.checkTrace(TraceCheck.java:295) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:206) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:337) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:223) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:89) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-28 17:43:46,903 INFO L168 Benchmark]: Toolchain (without parser) took 2160.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 961.6 MB in the beginning and 1.0 GB in the end (delta: -55.2 MB). Peak memory consumption was 85.3 MB. Max. memory is 11.5 GB. [2020-07-28 17:43:46,904 INFO L168 Benchmark]: CDTParser took 0.38 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 17:43:46,905 INFO L168 Benchmark]: CACSL2BoogieTranslator took 364.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 961.6 MB in the beginning and 1.1 GB in the end (delta: -175.3 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2020-07-28 17:43:46,906 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.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. [2020-07-28 17:43:46,907 INFO L168 Benchmark]: Boogie Preprocessor took 32.69 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. [2020-07-28 17:43:46,907 INFO L168 Benchmark]: RCFGBuilder took 525.57 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: 33.6 MB). Peak memory consumption was 33.6 MB. Max. memory is 11.5 GB. [2020-07-28 17:43:46,908 INFO L168 Benchmark]: TraceAbstraction took 1170.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 79.8 MB). Peak memory consumption was 79.8 MB. Max. memory is 11.5 GB. [2020-07-28 17:43:46,913 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.38 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 364.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 961.6 MB in the beginning and 1.1 GB in the end (delta: -175.3 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 59.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. * Boogie Preprocessor took 32.69 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 525.57 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: 33.6 MB). Peak memory consumption was 33.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1170.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 79.8 MB). Peak memory consumption was 79.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: null: de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.TableauxRow.(TableauxRow.java:45) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 17:43:48,878 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 17:43:48,880 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 17:43:48,892 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 17:43:48,893 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 17:43:48,894 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 17:43:48,895 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 17:43:48,897 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 17:43:48,899 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 17:43:48,900 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 17:43:48,901 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 17:43:48,902 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 17:43:48,902 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 17:43:48,903 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 17:43:48,904 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 17:43:48,905 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 17:43:48,906 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 17:43:48,907 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 17:43:48,909 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 17:43:48,912 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 17:43:48,914 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 17:43:48,915 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 17:43:48,916 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 17:43:48,917 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 17:43:48,920 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 17:43:48,920 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 17:43:48,920 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 17:43:48,921 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 17:43:48,922 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 17:43:48,923 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 17:43:48,923 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 17:43:48,924 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 17:43:48,925 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 17:43:48,926 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 17:43:48,927 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 17:43:48,927 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 17:43:48,928 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 17:43:48,928 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 17:43:48,928 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 17:43:48,929 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 17:43:48,930 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 17:43:48,931 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2020-07-28 17:43:48,947 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 17:43:48,947 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 17:43:48,949 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 17:43:48,949 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 17:43:48,949 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 17:43:48,949 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 17:43:48,950 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 17:43:48,950 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 17:43:48,950 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 17:43:48,950 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 17:43:48,951 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 17:43:48,951 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 17:43:48,951 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-07-28 17:43:48,951 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-07-28 17:43:48,951 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 17:43:48,952 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 17:43:48,952 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 17:43:48,952 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 17:43:48,952 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 17:43:48,953 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 17:43:48,953 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 17:43:48,953 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 17:43:48,953 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 17:43:48,953 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 17:43:48,954 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 17:43:48,954 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 17:43:48,954 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-07-28 17:43:48,954 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-07-28 17:43:48,955 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 17:43:48,955 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 17:43:48,955 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-28 17:43:48,955 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 -> ee5ae4bbae935ee4fc29ea9e50ac81dc390a543f [2020-07-28 17:43:49,277 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 17:43:49,291 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 17:43:49,294 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 17:43:49,296 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 17:43:49,297 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 17:43:49,298 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1300.c [2020-07-28 17:43:49,367 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4eabbb039/66a8fa2619cf47bfb8d6ded6612c4d0d/FLAGff08f81ca [2020-07-28 17:43:49,800 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 17:43:49,801 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1300.c [2020-07-28 17:43:49,808 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4eabbb039/66a8fa2619cf47bfb8d6ded6612c4d0d/FLAGff08f81ca [2020-07-28 17:43:50,172 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4eabbb039/66a8fa2619cf47bfb8d6ded6612c4d0d [2020-07-28 17:43:50,176 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 17:43:50,180 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 17:43:50,181 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 17:43:50,181 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 17:43:50,185 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 17:43:50,186 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:43:50" (1/1) ... [2020-07-28 17:43:50,189 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d874a55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:43:50, skipping insertion in model container [2020-07-28 17:43:50,190 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:43:50" (1/1) ... [2020-07-28 17:43:50,197 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 17:43:50,221 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 17:43:50,427 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:43:50,435 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 17:43:50,467 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:43:50,564 INFO L208 MainTranslator]: Completed translation [2020-07-28 17:43:50,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:43:50 WrapperNode [2020-07-28 17:43:50,565 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 17:43:50,566 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 17:43:50,566 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 17:43:50,566 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 17:43:50,576 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:43:50" (1/1) ... [2020-07-28 17:43:50,602 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:43:50" (1/1) ... [2020-07-28 17:43:50,657 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 17:43:50,657 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 17:43:50,658 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 17:43:50,658 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 17:43:50,669 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:43:50" (1/1) ... [2020-07-28 17:43:50,669 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:43:50" (1/1) ... [2020-07-28 17:43:50,679 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:43:50" (1/1) ... [2020-07-28 17:43:50,680 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:43:50" (1/1) ... [2020-07-28 17:43:50,713 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:43:50" (1/1) ... [2020-07-28 17:43:50,723 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:43:50" (1/1) ... [2020-07-28 17:43:50,726 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:43:50" (1/1) ... [2020-07-28 17:43:50,732 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 17:43:50,732 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 17:43:50,732 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 17:43:50,733 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 17:43:50,741 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:43:50" (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 [2020-07-28 17:43:50,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2020-07-28 17:43:50,831 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-28 17:43:50,831 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2020-07-28 17:43:50,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 17:43:50,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 17:43:50,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-28 17:43:51,311 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 17:43:51,312 INFO L295 CfgBuilder]: Removed 14 assume(true) statements. [2020-07-28 17:43:51,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:43:51 BoogieIcfgContainer [2020-07-28 17:43:51,316 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 17:43:51,318 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 17:43:51,318 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 17:43:51,322 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 17:43:51,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 05:43:50" (1/3) ... [2020-07-28 17:43:51,323 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53aaa6e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:43:51, skipping insertion in model container [2020-07-28 17:43:51,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:43:50" (2/3) ... [2020-07-28 17:43:51,324 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53aaa6e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:43:51, skipping insertion in model container [2020-07-28 17:43:51,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:43:51" (3/3) ... [2020-07-28 17:43:51,326 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1300.c [2020-07-28 17:43:51,338 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 17:43:51,345 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 17:43:51,359 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 17:43:51,381 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 17:43:51,382 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 17:43:51,382 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 17:43:51,382 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 17:43:51,383 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 17:43:51,383 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 17:43:51,383 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 17:43:51,384 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 17:43:51,400 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2020-07-28 17:43:51,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-28 17:43:51,407 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:43:51,408 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:43:51,409 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:43:51,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:43:51,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1033094394, now seen corresponding path program 1 times [2020-07-28 17:43:51,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 17:43:51,431 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1187692701] [2020-07-28 17:43:51,431 INFO L95 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 [2020-07-28 17:43:51,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:43:51,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 1 conjunts are in the unsatisfiable core [2020-07-28 17:43:51,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:43:51,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 17:43:51,590 INFO L280 TraceCheckUtils]: 0: Hoare triple {23#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {23#true} is VALID [2020-07-28 17:43:51,591 INFO L280 TraceCheckUtils]: 1: Hoare triple {23#true} havoc main_#res;havoc main_#t~nondet6, main_#t~ret7, main_#t~ret8, main_#t~short9, main_#t~ret10, main_~res~0, main_~x~0;main_~x~0 := main_#t~nondet6;havoc main_#t~nondet6;isinf_double_#in~x := main_~x~0;havoc isinf_double_#res;havoc isinf_double_#t~mem0, isinf_double_#t~union1, isinf_double_#t~mem2, isinf_double_#t~union3, isinf_double_~#ew_u~0.base, isinf_double_~#ew_u~0.offset, isinf_double_~x, isinf_double_~hx~0, isinf_double_~lx~0;isinf_double_~x := isinf_double_#in~x;havoc isinf_double_~hx~0;havoc isinf_double_~lx~0; {23#true} is VALID [2020-07-28 17:43:51,593 INFO L280 TraceCheckUtils]: 2: Hoare triple {23#true} assume !true; {24#false} is VALID [2020-07-28 17:43:51,594 INFO L280 TraceCheckUtils]: 3: Hoare triple {24#false} isinf_double_~hx~0 := ~bvand32(2147483647bv32, isinf_double_~hx~0);isinf_double_~hx~0 := ~bvor32(isinf_double_~hx~0, ~bvlshr32(~bvor32(isinf_double_~lx~0, ~bvneg32(isinf_double_~lx~0)), 31bv32));isinf_double_~hx~0 := ~bvsub32(2146435072bv32, isinf_double_~hx~0);isinf_double_#res := ~bvsub32(1bv32, ~bvlshr32(~bvor32(isinf_double_~hx~0, ~bvneg32(isinf_double_~hx~0)), 31bv32)); {24#false} is VALID [2020-07-28 17:43:51,594 INFO L280 TraceCheckUtils]: 4: Hoare triple {24#false} main_#t~ret7 := isinf_double_#res;main_#t~short9 := 0bv32 == main_#t~ret7; {24#false} is VALID [2020-07-28 17:43:51,595 INFO L280 TraceCheckUtils]: 5: Hoare triple {24#false} assume !main_#t~short9; {24#false} is VALID [2020-07-28 17:43:51,595 INFO L280 TraceCheckUtils]: 6: Hoare triple {24#false} assume main_#t~short9;havoc main_#t~ret7;havoc main_#t~ret8;havoc main_#t~short9;isfinite_double_#in~x := main_~x~0;havoc isfinite_double_#res;havoc isfinite_double_#t~mem4, isfinite_double_#t~union5, isfinite_double_~#gh_u~0.base, isfinite_double_~#gh_u~0.offset, isfinite_double_~x, isfinite_double_~hx~1;isfinite_double_~x := isfinite_double_#in~x;havoc isfinite_double_~hx~1; {24#false} is VALID [2020-07-28 17:43:51,595 INFO L280 TraceCheckUtils]: 7: Hoare triple {24#false} assume !true; {24#false} is VALID [2020-07-28 17:43:51,596 INFO L280 TraceCheckUtils]: 8: Hoare triple {24#false} isfinite_double_#res := ~bvlshr32(~bvsub32(~bvand32(2147483647bv32, isfinite_double_~hx~1), 2146435072bv32), 31bv32); {24#false} is VALID [2020-07-28 17:43:51,596 INFO L280 TraceCheckUtils]: 9: Hoare triple {24#false} main_#t~ret10 := isfinite_double_#res;main_~res~0 := ~convertINTToDOUBLE(currentRoundingMode, main_#t~ret10);havoc main_#t~ret10; {24#false} is VALID [2020-07-28 17:43:51,596 INFO L280 TraceCheckUtils]: 10: Hoare triple {24#false} assume ~fp.eq~DOUBLE(main_~res~0, ~Pluszero~DOUBLE()); {24#false} is VALID [2020-07-28 17:43:51,597 INFO L280 TraceCheckUtils]: 11: Hoare triple {24#false} assume !false; {24#false} is VALID [2020-07-28 17:43:51,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:43:51,600 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 17:43:51,618 INFO L280 TraceCheckUtils]: 11: Hoare triple {24#false} assume !false; {24#false} is VALID [2020-07-28 17:43:51,618 INFO L280 TraceCheckUtils]: 10: Hoare triple {24#false} assume ~fp.eq~DOUBLE(main_~res~0, ~Pluszero~DOUBLE()); {24#false} is VALID [2020-07-28 17:43:51,619 INFO L280 TraceCheckUtils]: 9: Hoare triple {24#false} main_#t~ret10 := isfinite_double_#res;main_~res~0 := ~convertINTToDOUBLE(currentRoundingMode, main_#t~ret10);havoc main_#t~ret10; {24#false} is VALID [2020-07-28 17:43:51,619 INFO L280 TraceCheckUtils]: 8: Hoare triple {24#false} isfinite_double_#res := ~bvlshr32(~bvsub32(~bvand32(2147483647bv32, isfinite_double_~hx~1), 2146435072bv32), 31bv32); {24#false} is VALID [2020-07-28 17:43:51,620 INFO L280 TraceCheckUtils]: 7: Hoare triple {24#false} assume !true; {24#false} is VALID [2020-07-28 17:43:51,620 INFO L280 TraceCheckUtils]: 6: Hoare triple {24#false} assume main_#t~short9;havoc main_#t~ret7;havoc main_#t~ret8;havoc main_#t~short9;isfinite_double_#in~x := main_~x~0;havoc isfinite_double_#res;havoc isfinite_double_#t~mem4, isfinite_double_#t~union5, isfinite_double_~#gh_u~0.base, isfinite_double_~#gh_u~0.offset, isfinite_double_~x, isfinite_double_~hx~1;isfinite_double_~x := isfinite_double_#in~x;havoc isfinite_double_~hx~1; {24#false} is VALID [2020-07-28 17:43:51,620 INFO L280 TraceCheckUtils]: 5: Hoare triple {24#false} assume !main_#t~short9; {24#false} is VALID [2020-07-28 17:43:51,621 INFO L280 TraceCheckUtils]: 4: Hoare triple {24#false} main_#t~ret7 := isinf_double_#res;main_#t~short9 := 0bv32 == main_#t~ret7; {24#false} is VALID [2020-07-28 17:43:51,621 INFO L280 TraceCheckUtils]: 3: Hoare triple {24#false} isinf_double_~hx~0 := ~bvand32(2147483647bv32, isinf_double_~hx~0);isinf_double_~hx~0 := ~bvor32(isinf_double_~hx~0, ~bvlshr32(~bvor32(isinf_double_~lx~0, ~bvneg32(isinf_double_~lx~0)), 31bv32));isinf_double_~hx~0 := ~bvsub32(2146435072bv32, isinf_double_~hx~0);isinf_double_#res := ~bvsub32(1bv32, ~bvlshr32(~bvor32(isinf_double_~hx~0, ~bvneg32(isinf_double_~hx~0)), 31bv32)); {24#false} is VALID [2020-07-28 17:43:51,622 INFO L280 TraceCheckUtils]: 2: Hoare triple {23#true} assume !true; {24#false} is VALID [2020-07-28 17:43:51,623 INFO L280 TraceCheckUtils]: 1: Hoare triple {23#true} havoc main_#res;havoc main_#t~nondet6, main_#t~ret7, main_#t~ret8, main_#t~short9, main_#t~ret10, main_~res~0, main_~x~0;main_~x~0 := main_#t~nondet6;havoc main_#t~nondet6;isinf_double_#in~x := main_~x~0;havoc isinf_double_#res;havoc isinf_double_#t~mem0, isinf_double_#t~union1, isinf_double_#t~mem2, isinf_double_#t~union3, isinf_double_~#ew_u~0.base, isinf_double_~#ew_u~0.offset, isinf_double_~x, isinf_double_~hx~0, isinf_double_~lx~0;isinf_double_~x := isinf_double_#in~x;havoc isinf_double_~hx~0;havoc isinf_double_~lx~0; {23#true} is VALID [2020-07-28 17:43:51,623 INFO L280 TraceCheckUtils]: 0: Hoare triple {23#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {23#true} is VALID [2020-07-28 17:43:51,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:43:51,625 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1187692701] [2020-07-28 17:43:51,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:43:51,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-07-28 17:43:51,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849959523] [2020-07-28 17:43:51,634 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2020-07-28 17:43:51,636 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:43:51,640 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 17:43:51,700 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:43:51,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 17:43:51,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 17:43:51,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 17:43:51,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 17:43:51,713 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2020-07-28 17:43:51,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:43:51,856 INFO L93 Difference]: Finished difference Result 38 states and 50 transitions. [2020-07-28 17:43:51,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 17:43:51,857 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2020-07-28 17:43:51,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:43:51,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:43:51,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 50 transitions. [2020-07-28 17:43:51,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:43:51,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 50 transitions. [2020-07-28 17:43:51,871 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 50 transitions. [2020-07-28 17:43:52,079 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:43:52,090 INFO L225 Difference]: With dead ends: 38 [2020-07-28 17:43:52,090 INFO L226 Difference]: Without dead ends: 16 [2020-07-28 17:43:52,093 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 17:43:52,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-07-28 17:43:52,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-07-28 17:43:52,132 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:43:52,132 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2020-07-28 17:43:52,133 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2020-07-28 17:43:52,135 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2020-07-28 17:43:52,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:43:52,138 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2020-07-28 17:43:52,138 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2020-07-28 17:43:52,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:43:52,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:43:52,139 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2020-07-28 17:43:52,140 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2020-07-28 17:43:52,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:43:52,142 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2020-07-28 17:43:52,143 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2020-07-28 17:43:52,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:43:52,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:43:52,144 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:43:52,144 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:43:52,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-28 17:43:52,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2020-07-28 17:43:52,148 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 12 [2020-07-28 17:43:52,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:43:52,151 INFO L479 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2020-07-28 17:43:52,151 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 17:43:52,151 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2020-07-28 17:43:52,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-28 17:43:52,154 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:43:52,154 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:43:52,355 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-07-28 17:43:52,356 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:43:52,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:43:52,357 INFO L82 PathProgramCache]: Analyzing trace with hash 499625812, now seen corresponding path program 1 times [2020-07-28 17:43:52,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 17:43:52,360 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2062579963] [2020-07-28 17:43:52,360 INFO L95 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 [2020-07-28 17:43:52,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:43:52,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-28 17:43:52,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:43:52,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 17:43:52,511 INFO L280 TraceCheckUtils]: 0: Hoare triple {196#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {196#true} is VALID [2020-07-28 17:43:52,511 INFO L280 TraceCheckUtils]: 1: Hoare triple {196#true} havoc main_#res;havoc main_#t~nondet6, main_#t~ret7, main_#t~ret8, main_#t~short9, main_#t~ret10, main_~res~0, main_~x~0;main_~x~0 := main_#t~nondet6;havoc main_#t~nondet6;isinf_double_#in~x := main_~x~0;havoc isinf_double_#res;havoc isinf_double_#t~mem0, isinf_double_#t~union1, isinf_double_#t~mem2, isinf_double_#t~union3, isinf_double_~#ew_u~0.base, isinf_double_~#ew_u~0.offset, isinf_double_~x, isinf_double_~hx~0, isinf_double_~lx~0;isinf_double_~x := isinf_double_#in~x;havoc isinf_double_~hx~0;havoc isinf_double_~lx~0; {196#true} is VALID [2020-07-28 17:43:52,512 INFO L280 TraceCheckUtils]: 2: Hoare triple {196#true} call isinf_double_~#ew_u~0.base, isinf_double_~#ew_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(isinf_double_~x, isinf_double_~#ew_u~0.base, isinf_double_~#ew_u~0.offset, 8bv32);call isinf_double_#t~mem0 := read~intINTTYPE4(isinf_double_~#ew_u~0.base, ~bvadd32(4bv32, isinf_double_~#ew_u~0.offset), 4bv32);isinf_double_~hx~0 := isinf_double_#t~mem0;call write~intFLOATTYPE8(isinf_double_#t~union1, isinf_double_~#ew_u~0.base, isinf_double_~#ew_u~0.offset, 8bv32);havoc isinf_double_#t~mem0;havoc isinf_double_#t~union1;call isinf_double_#t~mem2 := read~intINTTYPE4(isinf_double_~#ew_u~0.base, isinf_double_~#ew_u~0.offset, 4bv32);isinf_double_~lx~0 := isinf_double_#t~mem2;call write~intFLOATTYPE8(isinf_double_#t~union3, isinf_double_~#ew_u~0.base, isinf_double_~#ew_u~0.offset, 8bv32);havoc isinf_double_#t~union3;havoc isinf_double_#t~mem2;call ULTIMATE.dealloc(isinf_double_~#ew_u~0.base, isinf_double_~#ew_u~0.offset);havoc isinf_double_~#ew_u~0.base, isinf_double_~#ew_u~0.offset; {196#true} is VALID [2020-07-28 17:43:52,513 INFO L280 TraceCheckUtils]: 3: Hoare triple {196#true} goto; {196#true} is VALID [2020-07-28 17:43:52,513 INFO L280 TraceCheckUtils]: 4: Hoare triple {196#true} isinf_double_~hx~0 := ~bvand32(2147483647bv32, isinf_double_~hx~0);isinf_double_~hx~0 := ~bvor32(isinf_double_~hx~0, ~bvlshr32(~bvor32(isinf_double_~lx~0, ~bvneg32(isinf_double_~lx~0)), 31bv32));isinf_double_~hx~0 := ~bvsub32(2146435072bv32, isinf_double_~hx~0);isinf_double_#res := ~bvsub32(1bv32, ~bvlshr32(~bvor32(isinf_double_~hx~0, ~bvneg32(isinf_double_~hx~0)), 31bv32)); {196#true} is VALID [2020-07-28 17:43:52,513 INFO L280 TraceCheckUtils]: 5: Hoare triple {196#true} main_#t~ret7 := isinf_double_#res;main_#t~short9 := 0bv32 == main_#t~ret7; {196#true} is VALID [2020-07-28 17:43:52,514 INFO L280 TraceCheckUtils]: 6: Hoare triple {196#true} assume !main_#t~short9; {219#(not |ULTIMATE.start_main_#t~short9|)} is VALID [2020-07-28 17:43:52,516 INFO L280 TraceCheckUtils]: 7: Hoare triple {219#(not |ULTIMATE.start_main_#t~short9|)} assume main_#t~short9;havoc main_#t~ret7;havoc main_#t~ret8;havoc main_#t~short9;isfinite_double_#in~x := main_~x~0;havoc isfinite_double_#res;havoc isfinite_double_#t~mem4, isfinite_double_#t~union5, isfinite_double_~#gh_u~0.base, isfinite_double_~#gh_u~0.offset, isfinite_double_~x, isfinite_double_~hx~1;isfinite_double_~x := isfinite_double_#in~x;havoc isfinite_double_~hx~1; {197#false} is VALID [2020-07-28 17:43:52,516 INFO L280 TraceCheckUtils]: 8: Hoare triple {197#false} call isfinite_double_~#gh_u~0.base, isfinite_double_~#gh_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(isfinite_double_~x, isfinite_double_~#gh_u~0.base, isfinite_double_~#gh_u~0.offset, 8bv32);call isfinite_double_#t~mem4 := read~intINTTYPE4(isfinite_double_~#gh_u~0.base, ~bvadd32(4bv32, isfinite_double_~#gh_u~0.offset), 4bv32);isfinite_double_~hx~1 := isfinite_double_#t~mem4;call write~intFLOATTYPE8(isfinite_double_#t~union5, isfinite_double_~#gh_u~0.base, isfinite_double_~#gh_u~0.offset, 8bv32);havoc isfinite_double_#t~union5;havoc isfinite_double_#t~mem4;call ULTIMATE.dealloc(isfinite_double_~#gh_u~0.base, isfinite_double_~#gh_u~0.offset);havoc isfinite_double_~#gh_u~0.base, isfinite_double_~#gh_u~0.offset; {197#false} is VALID [2020-07-28 17:43:52,517 INFO L280 TraceCheckUtils]: 9: Hoare triple {197#false} goto; {197#false} is VALID [2020-07-28 17:43:52,517 INFO L280 TraceCheckUtils]: 10: Hoare triple {197#false} isfinite_double_#res := ~bvlshr32(~bvsub32(~bvand32(2147483647bv32, isfinite_double_~hx~1), 2146435072bv32), 31bv32); {197#false} is VALID [2020-07-28 17:43:52,517 INFO L280 TraceCheckUtils]: 11: Hoare triple {197#false} main_#t~ret10 := isfinite_double_#res;main_~res~0 := ~convertINTToDOUBLE(currentRoundingMode, main_#t~ret10);havoc main_#t~ret10; {197#false} is VALID [2020-07-28 17:43:52,518 INFO L280 TraceCheckUtils]: 12: Hoare triple {197#false} assume ~fp.eq~DOUBLE(main_~res~0, ~Pluszero~DOUBLE()); {197#false} is VALID [2020-07-28 17:43:52,518 INFO L280 TraceCheckUtils]: 13: Hoare triple {197#false} assume !false; {197#false} is VALID [2020-07-28 17:43:52,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:43:52,520 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 17:43:52,545 INFO L280 TraceCheckUtils]: 13: Hoare triple {197#false} assume !false; {197#false} is VALID [2020-07-28 17:43:52,545 INFO L280 TraceCheckUtils]: 12: Hoare triple {197#false} assume ~fp.eq~DOUBLE(main_~res~0, ~Pluszero~DOUBLE()); {197#false} is VALID [2020-07-28 17:43:52,546 INFO L280 TraceCheckUtils]: 11: Hoare triple {197#false} main_#t~ret10 := isfinite_double_#res;main_~res~0 := ~convertINTToDOUBLE(currentRoundingMode, main_#t~ret10);havoc main_#t~ret10; {197#false} is VALID [2020-07-28 17:43:52,546 INFO L280 TraceCheckUtils]: 10: Hoare triple {197#false} isfinite_double_#res := ~bvlshr32(~bvsub32(~bvand32(2147483647bv32, isfinite_double_~hx~1), 2146435072bv32), 31bv32); {197#false} is VALID [2020-07-28 17:43:52,546 INFO L280 TraceCheckUtils]: 9: Hoare triple {197#false} goto; {197#false} is VALID [2020-07-28 17:43:52,547 INFO L280 TraceCheckUtils]: 8: Hoare triple {197#false} call isfinite_double_~#gh_u~0.base, isfinite_double_~#gh_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(isfinite_double_~x, isfinite_double_~#gh_u~0.base, isfinite_double_~#gh_u~0.offset, 8bv32);call isfinite_double_#t~mem4 := read~intINTTYPE4(isfinite_double_~#gh_u~0.base, ~bvadd32(4bv32, isfinite_double_~#gh_u~0.offset), 4bv32);isfinite_double_~hx~1 := isfinite_double_#t~mem4;call write~intFLOATTYPE8(isfinite_double_#t~union5, isfinite_double_~#gh_u~0.base, isfinite_double_~#gh_u~0.offset, 8bv32);havoc isfinite_double_#t~union5;havoc isfinite_double_#t~mem4;call ULTIMATE.dealloc(isfinite_double_~#gh_u~0.base, isfinite_double_~#gh_u~0.offset);havoc isfinite_double_~#gh_u~0.base, isfinite_double_~#gh_u~0.offset; {197#false} is VALID [2020-07-28 17:43:52,549 INFO L280 TraceCheckUtils]: 7: Hoare triple {219#(not |ULTIMATE.start_main_#t~short9|)} assume main_#t~short9;havoc main_#t~ret7;havoc main_#t~ret8;havoc main_#t~short9;isfinite_double_#in~x := main_~x~0;havoc isfinite_double_#res;havoc isfinite_double_#t~mem4, isfinite_double_#t~union5, isfinite_double_~#gh_u~0.base, isfinite_double_~#gh_u~0.offset, isfinite_double_~x, isfinite_double_~hx~1;isfinite_double_~x := isfinite_double_#in~x;havoc isfinite_double_~hx~1; {197#false} is VALID [2020-07-28 17:43:52,549 INFO L280 TraceCheckUtils]: 6: Hoare triple {196#true} assume !main_#t~short9; {219#(not |ULTIMATE.start_main_#t~short9|)} is VALID [2020-07-28 17:43:52,550 INFO L280 TraceCheckUtils]: 5: Hoare triple {196#true} main_#t~ret7 := isinf_double_#res;main_#t~short9 := 0bv32 == main_#t~ret7; {196#true} is VALID [2020-07-28 17:43:52,550 INFO L280 TraceCheckUtils]: 4: Hoare triple {196#true} isinf_double_~hx~0 := ~bvand32(2147483647bv32, isinf_double_~hx~0);isinf_double_~hx~0 := ~bvor32(isinf_double_~hx~0, ~bvlshr32(~bvor32(isinf_double_~lx~0, ~bvneg32(isinf_double_~lx~0)), 31bv32));isinf_double_~hx~0 := ~bvsub32(2146435072bv32, isinf_double_~hx~0);isinf_double_#res := ~bvsub32(1bv32, ~bvlshr32(~bvor32(isinf_double_~hx~0, ~bvneg32(isinf_double_~hx~0)), 31bv32)); {196#true} is VALID [2020-07-28 17:43:52,551 INFO L280 TraceCheckUtils]: 3: Hoare triple {196#true} goto; {196#true} is VALID [2020-07-28 17:43:52,551 INFO L280 TraceCheckUtils]: 2: Hoare triple {196#true} call isinf_double_~#ew_u~0.base, isinf_double_~#ew_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(isinf_double_~x, isinf_double_~#ew_u~0.base, isinf_double_~#ew_u~0.offset, 8bv32);call isinf_double_#t~mem0 := read~intINTTYPE4(isinf_double_~#ew_u~0.base, ~bvadd32(4bv32, isinf_double_~#ew_u~0.offset), 4bv32);isinf_double_~hx~0 := isinf_double_#t~mem0;call write~intFLOATTYPE8(isinf_double_#t~union1, isinf_double_~#ew_u~0.base, isinf_double_~#ew_u~0.offset, 8bv32);havoc isinf_double_#t~mem0;havoc isinf_double_#t~union1;call isinf_double_#t~mem2 := read~intINTTYPE4(isinf_double_~#ew_u~0.base, isinf_double_~#ew_u~0.offset, 4bv32);isinf_double_~lx~0 := isinf_double_#t~mem2;call write~intFLOATTYPE8(isinf_double_#t~union3, isinf_double_~#ew_u~0.base, isinf_double_~#ew_u~0.offset, 8bv32);havoc isinf_double_#t~union3;havoc isinf_double_#t~mem2;call ULTIMATE.dealloc(isinf_double_~#ew_u~0.base, isinf_double_~#ew_u~0.offset);havoc isinf_double_~#ew_u~0.base, isinf_double_~#ew_u~0.offset; {196#true} is VALID [2020-07-28 17:43:52,551 INFO L280 TraceCheckUtils]: 1: Hoare triple {196#true} havoc main_#res;havoc main_#t~nondet6, main_#t~ret7, main_#t~ret8, main_#t~short9, main_#t~ret10, main_~res~0, main_~x~0;main_~x~0 := main_#t~nondet6;havoc main_#t~nondet6;isinf_double_#in~x := main_~x~0;havoc isinf_double_#res;havoc isinf_double_#t~mem0, isinf_double_#t~union1, isinf_double_#t~mem2, isinf_double_#t~union3, isinf_double_~#ew_u~0.base, isinf_double_~#ew_u~0.offset, isinf_double_~x, isinf_double_~hx~0, isinf_double_~lx~0;isinf_double_~x := isinf_double_#in~x;havoc isinf_double_~hx~0;havoc isinf_double_~lx~0; {196#true} is VALID [2020-07-28 17:43:52,552 INFO L280 TraceCheckUtils]: 0: Hoare triple {196#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {196#true} is VALID [2020-07-28 17:43:52,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:43:52,553 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2062579963] [2020-07-28 17:43:52,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:43:52,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-07-28 17:43:52,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12067056] [2020-07-28 17:43:52,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2020-07-28 17:43:52,565 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:43:52,565 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-28 17:43:52,633 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:43:52,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-28 17:43:52,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 17:43:52,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-28 17:43:52,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 17:43:52,635 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 3 states. [2020-07-28 17:43:52,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:43:52,846 INFO L93 Difference]: Finished difference Result 24 states and 23 transitions. [2020-07-28 17:43:52,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-28 17:43:52,847 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2020-07-28 17:43:52,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:43:52,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 17:43:52,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2020-07-28 17:43:52,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 17:43:52,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2020-07-28 17:43:52,850 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 23 transitions. [2020-07-28 17:43:52,962 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:43:52,964 INFO L225 Difference]: With dead ends: 24 [2020-07-28 17:43:52,964 INFO L226 Difference]: Without dead ends: 16 [2020-07-28 17:43:52,965 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 17:43:52,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-07-28 17:43:52,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-07-28 17:43:52,979 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:43:52,979 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2020-07-28 17:43:52,979 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2020-07-28 17:43:52,979 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2020-07-28 17:43:52,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:43:52,983 INFO L93 Difference]: Finished difference Result 16 states and 15 transitions. [2020-07-28 17:43:52,984 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 15 transitions. [2020-07-28 17:43:52,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:43:52,984 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:43:52,985 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2020-07-28 17:43:52,985 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2020-07-28 17:43:52,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:43:52,988 INFO L93 Difference]: Finished difference Result 16 states and 15 transitions. [2020-07-28 17:43:52,988 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 15 transitions. [2020-07-28 17:43:52,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:43:52,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:43:52,989 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:43:52,989 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:43:52,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-28 17:43:52,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 15 transitions. [2020-07-28 17:43:52,992 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 15 transitions. Word has length 14 [2020-07-28 17:43:52,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:43:52,992 INFO L479 AbstractCegarLoop]: Abstraction has 16 states and 15 transitions. [2020-07-28 17:43:52,992 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-28 17:43:52,992 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 15 transitions. [2020-07-28 17:43:52,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-28 17:43:52,993 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:43:52,993 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:43:53,208 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-07-28 17:43:53,208 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:43:53,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:43:53,209 INFO L82 PathProgramCache]: Analyzing trace with hash 2210040, now seen corresponding path program 1 times [2020-07-28 17:43:53,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 17:43:53,212 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1790532260] [2020-07-28 17:43:53,212 INFO L95 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 [2020-07-28 17:43:53,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 17:43:53,323 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 17:43:53,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 17:43:53,418 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 17:43:53,460 INFO L174 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2020-07-28 17:43:53,461 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-28 17:43:53,662 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-07-28 17:43:53,698 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 17:43:53,703 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-28 17:43:53,704 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2020-07-28 17:43:53,704 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2020-07-28 17:43:53,705 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2020-07-28 17:43:53,705 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2020-07-28 17:43:53,705 WARN L170 areAnnotationChecker]: L18-3 has no Hoare annotation [2020-07-28 17:43:53,705 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-28 17:43:53,706 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2020-07-28 17:43:53,706 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2020-07-28 17:43:53,707 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-28 17:43:53,707 WARN L170 areAnnotationChecker]: L53-2 has no Hoare annotation [2020-07-28 17:43:53,707 WARN L170 areAnnotationChecker]: L53-2 has no Hoare annotation [2020-07-28 17:43:53,707 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2020-07-28 17:43:53,707 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2020-07-28 17:43:53,708 WARN L170 areAnnotationChecker]: L53-4 has no Hoare annotation [2020-07-28 17:43:53,708 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2020-07-28 17:43:53,708 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2020-07-28 17:43:53,708 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-28 17:43:53,709 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2020-07-28 17:43:53,709 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-28 17:43:53,709 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 17:43:53,716 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2020-07-28 17:43:53,716 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2020-07-28 17:43:53,716 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2020-07-28 17:43:53,718 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2020-07-28 17:43:53,719 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-28 17:43:53,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 05:43:53 BoogieIcfgContainer [2020-07-28 17:43:53,721 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 17:43:53,721 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 17:43:53,721 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 17:43:53,722 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 17:43:53,722 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:43:51" (3/4) ... [2020-07-28 17:43:53,725 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-07-28 17:43:53,816 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-28 17:43:53,816 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 17:43:53,820 INFO L168 Benchmark]: Toolchain (without parser) took 3641.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 950.8 MB in the beginning and 970.9 MB in the end (delta: -20.1 MB). Peak memory consumption was 103.1 MB. Max. memory is 11.5 GB. [2020-07-28 17:43:53,820 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 17:43:53,827 INFO L168 Benchmark]: CACSL2BoogieTranslator took 384.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -168.4 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2020-07-28 17:43:53,828 INFO L168 Benchmark]: Boogie Procedure Inliner took 90.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2020-07-28 17:43:53,828 INFO L168 Benchmark]: Boogie Preprocessor took 74.93 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. [2020-07-28 17:43:53,829 INFO L168 Benchmark]: RCFGBuilder took 584.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. [2020-07-28 17:43:53,831 INFO L168 Benchmark]: TraceAbstraction took 2403.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 970.9 MB in the end (delta: 115.3 MB). Peak memory consumption was 115.3 MB. Max. memory is 11.5 GB. [2020-07-28 17:43:53,831 INFO L168 Benchmark]: Witness Printer took 94.88 ms. Allocated memory is still 1.2 GB. Free memory is still 970.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 17:43:53,843 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 384.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -168.4 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 90.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 74.93 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 584.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2403.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 970.9 MB in the end (delta: 115.3 MB). Peak memory consumption was 115.3 MB. Max. memory is 11.5 GB. * Witness Printer took 94.88 ms. Allocated memory is still 1.2 GB. Free memory is still 970.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 59]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L50] double x = __VERIFIER_nondet_double(); [L17] __int32_t hx, lx; [L19] ieee_double_shape_type ew_u; [L20] ew_u.value = (x) [L21] EXPR ew_u.parts.msw [L21] (hx) = ew_u.parts.msw [L22] EXPR ew_u.parts.lsw [L22] (lx) = ew_u.parts.lsw [L24] hx &= 0x7fffffff [L25] hx |= (__uint32_t)(lx | (-lx)) >> 31 [L26] hx = 0x7ff00000 - hx [L27] return 1 - (int)((__uint32_t)(hx | (-hx)) >> 31); [L53] !isinf_double(x) && !isnan_double(x) [L31] return x != x; [L53] !isinf_double(x) && !isnan_double(x) [L53] COND TRUE !isinf_double(x) && !isnan_double(x) [L34] __int32_t hx; [L36] ieee_double_shape_type gh_u; [L37] gh_u.value = (x) [L38] EXPR gh_u.parts.msw [L38] (hx) = gh_u.parts.msw [L40] return (int)((__uint32_t)((hx & 0x7fffffff) - 0x7ff00000) >> 31); [L55] double res = isfinite_double(x); [L58] COND TRUE res == 0.0 [L59] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 2.2s, OverallIterations: 3, TraceHistogramMax: 1, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 37 SDtfs, 0 SDslu, 10 SDs, 0 SdLazy, 5 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 41 NumberOfCodeBlocks, 41 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 48 ConstructedInterpolants, 0 QuantifiedInterpolants, 606 SizeOfPredicates, 0 NumberOfNonLiveVariables, 71 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...